A Resolution Calculus for First-order Schemata

We devise a resolution calculus that tests the satisfiability of infinite families of clause sets, called clause set schemata. For schemata of propositional clause sets, we prove that this calculus is sound, refutationally complete, and terminating. The calculus is extended to first-order clauses, for which termination is lost, since the satisfiability problem is not semi-decidable for nonpropositional schemata. The expressive power of the considered logic is strictly greater than the one considered in our previous work.

[1]  Ernst Althaus,et al.  Superposition Modulo Linear Arithmetic SUP(LA) , 2009, FroCoS.

[2]  Vincent Aravantinos,et al.  A DPLL Proof Procedure for Propositional Iterated Schemata , 2009 .

[3]  Vincent Aravantinos,et al.  A Decidable Class of Nested Iterated Schemata , 2010, IJCAR.

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

[5]  Alexander Leitsch,et al.  The Resolution Calculus , 1997, Texts in Theoretical Computer Science An EATCS Series.

[6]  Christoph Weidenbach,et al.  Deciding the Inductive Validity of FOR ALL THERE EXISTS * Queries , 2009, CSL.

[7]  Vincent Aravantinos,et al.  A Schemata Calculus for Propositional Logic , 2009, TABLEAUX.

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

[9]  Christian G. Fermüller,et al.  Resolution Methods for the Decision Problem , 1993, Lecture Notes in Computer Science.

[10]  Alexander Leitsch,et al.  CERES: An analysis of Fürstenberg's proof of the infinity of primes , 2008, Theoretical Computer Science.

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

[12]  Vincent Aravantinos,et al.  Schemata of SMT-Problems , 2011, TABLEAUX.

[13]  Uwe Waldmann.  Superposition and Chaining for Totally Ordered Divisible Abelian Groups , 2001, IJCAR.

[14]  Vincent Aravantinos,et al.  RegSTAB: A SAT Solver for Propositional Schemata , 2010, IJCAR.

[15]  Andrei Voronkov,et al.  Integrating Linear Arithmetic into Superposition Calculus , 2007, CSL.

[16]  Hubert Comon-Lundh,et al.  Equational Problems and Disunification , 1989, J. Symb. Comput..

[17]  Vincent Aravantinos,et al.  Decidability and Undecidability Results for Propositional Schemata , 2014, J. Artif. Intell. Res..

[18]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[19]  Harald Ganzinger,et al.  Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.

[20]  Aarti Gupta,et al.  Parametric Circuit Representation Using Inductive Boolean Functions , 1993, CAV.