Obtaining Finite Local Theory Axiomatizations via Saturation

In this paper we present a method for obtaining local sets of clauses from possibly non-local ones. For this, we follow the work of Basin and Ganzinger and use saturation under a version of ordered resolution. In order to address the fact that saturation can generate infinite sets of clauses, we use constrained clauses and show that a link can be established between saturation and locality also for constrained clauses: This often allows us to give a finite representation of possibly infinite saturated sets of clauses.

[1]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

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

[3]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[4]  Christoph Weidenbach,et al.  Superposition for fixed domains , 2008, TOCL.

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

[6]  Christoph Weidenbach,et al.  Deciding the inductive validity of ∀∃* queries , 2009, CSL 2009.

[7]  Harald Ganzinger,et al.  Modular proof systems for partial functions with Evans equality , 2006, Inf. Comput..

[8]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[9]  Martin Wirsing,et al.  Theoretical Aspects of Computing - ICTAC 2005, Second International Colloquium, Hanoi, Vietnam, October 17-21, 2005, Proceedings , 2005, ICTAC.

[10]  Carsten Ihlemann,et al.  On Local Reasoning in Verification , 2008, TACAS.

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

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

[13]  Albert Rubio,et al.  Theorem Proving with Ordering Constrained Clauses , 1992, CADE.

[14]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[15]  Graham Steel,et al.  Deduction with XOR Constraints in Security API Modelling , 2005, CADE.

[16]  Maria Paola Bonacina,et al.  New results on rewrite-based satisfiability procedures , 2006, TOCL.

[17]  Christoph Weidenbach,et al.  Decidability Results for Saturation-Based Model Building , 2009, CADE.

[18]  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.

[19]  Christoph Weidenbach,et al.  Combining Superposition, Sorts and Splitting , 2001, Handbook of Automated Reasoning.

[20]  Robert Givan,et al.  Polynomial-time computation via local inference relations , 2000, TOCL.

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

[22]  Renate A. Schmidt.  Automated Deduction - CADE-22, 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009. Proceedings , 2009, CADE.

[23]  Christophe Ringeissen,et al.  Automatic Decidability: A Schematic Calculus for Theories with Counting Operators , 2013, RTA.

[24]  Harald Ganzinger,et al.  Automated complexity analysis based on ordered resolution , 2001, JACM.

[25]  Christopher Lynch,et al.  Automatic decidability , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[26]  Hélène Kirchner,et al.  On Superposition-Based Satisfiability Procedures and Their Combination , 2005, ICTAC.

[27]  Christophe Ringeissen,et al.  Automatic decidability and combinability , 2011, Inf. Comput..

[28]  Harald Ganzinger,et al.  Complexity analysis based on ordered resolution , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[29]  Viorica Sofronie-Stokkermans,et al.  Locality Results for Certain Extensions of Theories with Bridging Functions , 2009, CADE.

[30]  Carsten Ihlemann,et al.  On Hierarchical Reasoning in Combinations of Theories , 2010, IJCAR.

[31]  Toby Walsh,et al.  Automated Deduction—CADE-11 , 1992, Lecture Notes in Computer Science.