Cooperation of decision procedures for the satisfiability problem (1996) [23 citations — 4 self]
by Christophe Ringeissen
Frontiers of Combining Systems: Proceedings of the 1st International Workshop, Munich (Germany), Applied Logic
ftp://ftp.loria.fr/pub/loria/protheo/COMMUNICATIONS_1996/Ringeissen-FroCos96.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Ringeissen96cooperationof,author = {Christophe Ringeissen},
title = {Cooperation of decision procedures for the satisfiability problem},
booktitle = {Frontiers of Combining Systems: Proceedings of the 1st International Workshop, Munich (Germany), Applied Logic},
year = {1996},
pages = {121--140},
publisher = {Kluwer Academic Publishers}
}
Years of Citing Articles
Abstract:
Abstract. Constraint programming is strongly based on the use of solvers which are able to check satisability of constraints. We show in this paper a rule-based algorithm for solving in a modular way the satisability 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 dioeerent 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 simplies the understanding of the combination problem. The obtained decomposition algorithm is illustrated by the combination of non-disjoint equational theories. 1.
