Modular proof systems for partial functions with Evans equality

The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. The modularity of the calculus is a consequence of the fact that all the inferences are pure-only involving clauses over the alphabet of either one, but not both, of the theories-when refuting goals represented by sets of pure formulae. The calculus is shown to be complete provided that functions that are not in the intersection of the component signatures are declared as partial. This result also means that if the unsatisfiability of a goal modulo the combined theory does not depend on the totality of the functions in the extensions, the inconsistency will be effectively found. Moreover, we consider a constraint superposition calculus for the case of hierarchical theories and show that it has a related modularity property. Finally, we identify cases where the partial models can always be made total so that modular superposition is also complete with respect to the standard (total function) semantics of the theories.

[1]  Harald Ganzinger.  Relating semantic and proof-theoretic concepts for polynomial time decidability of uniform word problems , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[2]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[3]  Harald Ganzinger,et al.  Ordered chaining calculi for first-order theories of transitive relations , 1998, JACM.

[4]  Harald Ganzinger,et al.  Modular Proof Systems for Partial Functions with Weak Equality , 2004, IJCAR.

[5]  Robert Givan,et al.  New Results on Local Inference Relations , 1992, KR.

[6]  Silvio Ghilardi,et al.  Model-Theoretic Methods in Combined Constraint Satisfiability , 2004, Journal of Automated Reasoning.

[7]  P. Burmeister.  A Model Theoretic Oriented Approach to Partial Algebras , 1986 .

[8]  Viorica Sofronie-Stokkermans,et al.  Hierarchic Reasoning in Local Theory Extensions , 2005, CADE.

[9]  Michael Kohlhase,et al.  A Mechanization of Strong Kleene Logic for Partial Functions , 1994, CADE.

[10]  David A. McAllester.  Automatic recognition of tractability in inference relations , 1993, JACM.

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

[12]  Stanley Burris,et al.  Polynomial Time Uniform Word Problems , 1995, Math. Log. Q..

[13]  James B. Morris,et al.  E-Resolution: Extension of Resolution to Include the Equality Relation , 1969, IJCAI.

[14]  Robert Nieuwenhuis,et al.  Basic paramodulation and decidable theories , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[15]  Deko V. Dekov,et al.  Embeddability and the word problem , 1995, Journal of Symbolic Logic.

[16]  Maria Paola Bonacina,et al.  On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal , 2005, FroCoS.

[17]  Jean-Pierre Jouannaud,et al.  Decidable Problems in Shallow Equational Theories (Extended Abstract) , 1992, LICS 1992.

[18]  Harald Ganzinger,et al.  Shostak Light , 2002, CADE.

[19]  Malcolm C. Harrison,et al.  Equality-based binary resolution , 1986, JACM.

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

[21]  Trevor Evans,et al.  The Word Problem for Abstract Algebras , 1951 .

[22]  Silvio Ghilardi,et al.  Quantifier Elimination and Provers Integration , 2003, FTP.

[23]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[24]  Desmond Fearnley-Sander,et al.  Universal Algebra , 1982 .

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

[26]  Christoph Weidenbach,et al.  Unification in Extension of Shallow Equational Theories , 1998, RTA.

[27]  Michaël Rusinowitch,et al.  A rewriting approach to satisfiability procedures , 2003, Inf. Comput..

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

[29]  Andrei Voronkov,et al.  Automated Deduction—CADE-18 , 2002, Lecture Notes in Computer Science.

[30]  Thomas Hillenbrand.  A Superposition View on Nelson-Oppen , 2004, IJCAR Doctoral Programme.

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

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

[33]  Harald Ganzinger,et al.  Refutational theorem proving for hierarchic first-order theories , 1994, Applicable Algebra in Engineering, Communication and Computing.

[34]  Bernhard Nebel,et al.  Principles of knowledge representation and reasoning: proceedings of the Third International Conference (KR'92) , 1992 .