Automatic Combinability of Rewriting-Based Satisfiability Procedures

Hélène Kirchner (1) , Silvio Ranise (2) , Christophe Ringeissen (2) , Duc-Khanh Tran (2)

1 PROTHEO - Constraints, automatic deduction and software properties proofs
2 CASSIS - Combination of approaches to the security of infinite states systems

We address the problems of combining satisfiability procedures and consider two combination scenarios: (i) the combination within the class of rewriting-based satisfiability procedures and (ii) the Nelson-Oppen combination of rewriting-based satisfiability procedures and arbitrary satisfiability procedures. In each scenario, we use meta-saturation, which schematizes saturation of the set containing the axioms of a given theory and an arbitrary set of ground literals, to syntactically decide sufficient conditions for the combinability of rewriting-based satisfiability procedures. For (i), we give a sufficient condition for the modular termination of meta-saturation. When meta-saturation for the union of theories halts, it yields a rewriting-based satisfiability procedure for the union. For (ii), we use meta-saturation to prove the stable infiniteness of the component theories and deduction completeness of their rewriting-based satisfiability procedures. These properties are important to establish the correctness of the Nelson-Oppen combination method and to obtain an efficient implementation.

Domaines: Logique en informatique [cs.LO]

Hélène Kirchner, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran. Automatic Combinability of Rewriting-Based Satisfiability Procedures. 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning - LPAR 2006, Nov 2006, Phnom Penh/Cambodia, pp.542--556, ⟨10.1007/11916277⟩. ⟨inria-00117261⟩