Model-Theoretic Methods in Combined Constraint Satisfiability

Abstract We extend the Nelson–Oppen combination procedure to the case of theories that are compatible with respect to a common subtheory in the shared signature. The notion of compatibility relies on model completions and related concepts from classical model theory.

[1]  Michaël Rusinowitch,et al.  Uniform Derivation of Decision Procedures by Superposition , 2001, CSL.

[2]  W. Wheeler.  Model-companions and definability in existentially complete structures , 1976 .

[3]  Silvio Ghilardi,et al.  Combining word problems through rewriting in categories with products , 2003, Theor. Comput. Sci..

[4]  Harald Ganzinger,et al.  Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..

[5]  Derek C. Oppen,et al.  Complexity, Convexity and Combinations of Theories , 1980, Theor. Comput. Sci..

[6]  C. Tinelli,et al.  A New Approach for Combining Decision Procedures for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method , 1996 .

[7]  Cesare Tinelli,et al.  A New Correctness Proof of the {Nelson-Oppen} Combination Procedure , 1996, FroCoS.

[8]  Calogero G. Zarba,et al.  Combining Nonstably Infinite Theories , 2005, Journal of Automated Reasoning.

[9]  Alan Bundy,et al.  A General Setting for Flexibly Combining and Augmenting Decision Procedures , 2004, Journal of Automated Reasoning.

[10]  Torben Amtoft,et al.  Faithful Translations between Polyvariant Flows and Polymorphic Types , 2000, ESOP.

[11]  Derek C. Oppen,et al.  Reasoning about recursively defined data structures , 1978, POPL.

[12]  Marek W. Zawadowski,et al.  Sheaves, games, and model completions , 2002 .

[13]  Cesare Tinelli,et al.  Deciding the Word Problem in the Union of Equational Theories , 1998, Inf. Comput..

[14]  Calogero G. Zarba,et al.  Combining Non-Stably Infinite Theories , 2003, FTP.

[15]  Cesare Tinelli,et al.  A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics , 2004, IJCAR.

[16]  Volker Weispfenning,et al.  The Complexity of Linear Problems in Fields , 1988, Journal of symbolic computation.

[17]  Harald Ganzinger,et al.  On Restrictions of Ordered Paramodulation with Simplification , 1990, CADE.

[18]  Calogero G. Zarba.  A Tableau Calculus for Combining Non-disjoint Theories , 2002, TABLEAUX.

[19]  Silvio Ghilardi,et al.  Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics , 2003, LPAR.

[20]  Michael J. Maher,et al.  Solving Numerical Constraints , 2001, Handbook of Automated Reasoning.

[21]  Derek C. Oppen,et al.  A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic , 1978, J. Comput. Syst. Sci..

[22]  Cesare Tinelli,et al.  A New Approach for Combining Decision Procedure for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method , 1997, CADE.

[23]  Christoph Weidenbach.  System Description: Spass Version 1.0.0 , 1999, CADE.

[24]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[25]  Albert Rubio,et al.  Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.

[26]  Cesare Tinelli,et al.  Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing , 2003, Journal of Automated Reasoning.

[27]  Cesare Tinelli,et al.  Unions of non-disjoint theories and combinations of satisfiability procedures , 2003, Theor. Comput. Sci..

[28]  J. Ferrante,et al.  The computational complexity of logical theories , 1979 .

[29]  Frank Wolter,et al.  Fusions of Modal Logics Revisited , 1996, Advances in Modal Logic.

[30]  Cesare Tinelli,et al.  Combining Decision Procedures for Positive Theories Sharing Constructors , 2002, RTA.

[31]  Greg Nelson,et al.  Simplification by Cooperating Decision Procedures , 1979, TOPL.

[32]  H. Ganzinger,et al.  Equational Reasoning in Saturation-Based Theorem Proving , 1998 .