Cooperation of Decision Procedures for the Satisfiability Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1995

Cooperation of Decision Procedures for the Satisfiability Problem

Abstract

Constraint programming is strongly based on the use of solvers which are able to check satisfiability of constraints. We show in this paper a rule-based algorithm for solving in a modular way the satisfiability problem w.r.t. a class of theories $Th$. The case where $Th$ is the union of two disjoint theories $Th_1$ and $Th_2$ is known for a long time but we study here different cases where function symbols are shared by $Th_1$ and $Th_2$. The chosen approach leads to a highly non-deterministic decomposition algorithm but drastically simplifies the understanding of the combination problem. The obtained decomposition algorithm is illustrated by the combination of non-disjoint equational theories.
Fichier principal
Vignette du fichier
RR-2753.pdf (281.01 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00073939 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073939 , version 1

Cite

Christophe Ringeissen. Cooperation of Decision Procedures for the Satisfiability Problem. [Research Report] RR-2753, INRIA. 1995, pp.19. ⟨inria-00073939⟩
72 View
170 Download

Share

Gmail Facebook Twitter LinkedIn More