Hyper Tableaux with Equality

In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition inference rule, where equations used for paramodulation are drawn (only) from a set of positive unit clauses, the candidate model. The calculus also features a generic, semantically justified simplification rule which covers many redundancy elimination techniques known from superposition theorem proving. Our main results are soundness and completeness, but we briefly describe the implementation, too.

[1]  Ulrich Furbach,et al.  Applications of Automated Reasoning , 2006, KI.

[2]  Anastasia Meletiadou,et al.  Begriffsbestimmung und erwartete Trends im IT-Risk-Management , 2007 .

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

[4]  Björn Pelzer,et al.  System Description: E-KRHyper , 2007, CADE.

[5]  Carla Limongelli,et al.  Design and Implementation of Symbolic Computation Systems , 1991, Lecture Notes in Computer Science.

[6]  Lutz Priese,et al.  Automatische See-Through Kalibrierung , 2007 .

[7]  W. Bibel,et al.  Automated deduction : a basis for applications , 1998 .

[8]  Frank van Harmelen,et al.  Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs , 1990, CADE.

[9]  Achim Rettinger,et al.  Intelligent exploration for genetic algorithms: using self-organizing maps in evolutionary computation , 2008, GECCO '05.

[10]  Melanie Volkamer,et al.  Security Requirements for Non-political Internet Voting , 2006, Electronic Voting.

[11]  Alan Robinson,et al.  The Inverse Method , 2001, Handbook of Automated Reasoning.

[12]  Bernhard Beckert,et al.  Semantic Tableaux with Equality , 1997, J. Log. Comput..

[13]  Steffen Staab,et al.  Networked RDF graphs , 2007 .

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

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

[16]  Jürgen Ebert,et al.  Web Engineering does profit from a Functional Approach , 2005 .

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

[18]  Martin Giese,et al.  Incremental Closure of Free Variable Tableaux , 2001, IJCAR.

[19]  Steffen Staab,et al.  Adding Formal Semantics to MPEG-7: Designing a Well-Founded Multimedia Ontology for the Web , 2007 .

[20]  Martin Giese.  Simplification Rules for Constrained Formula Tableaux , 2003, TABLEAUX.

[21]  Andrei Voronkov,et al.  What You Always Wanted to Know about Rigid E-Unification , 1996, Journal of Automated Reasoning.

[22]  Peter Baumgartner,et al.  Living Book – Deduction, Slicing, and Interaction , 2004, Journal of Automated Reasoning.

[23]  Peter Baumgartner,et al.  The Model Evolution Calculus with Equality , 2005, CADE.

[24]  Philipp Schaer,et al.  State-of-the-Art: Interaktion in Erweiterten Realitäten , 2007 .

[25]  Jürgen Ebert,et al.  A first proposal for an overall structure of an enhanced reality framework , 2007 .

[26]  Lutz Priese,et al.  Some Examples of Semi-rational and Non-semi-rational DAG Languages , 2006 .

[27]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[28]  Christian Freksa,et al.  KI 2006: Advances in Artificial Intelligence, 29th Annual German Conference on AI, KI 2006, Bremen, Germany, June 14-17, 2006, Proceedings , 2007, KI.

[29]  Andreas von Hessling.  Semantic User Profiles and their Applications in a Mobile Environment , 2004 .

[30]  Reinhold Letz,et al.  Integration of Equality Reasoning into the Disconnection Calculus , 2002, TABLEAUX.

[31]  Toshiaki Arai,et al.  Hybrid State Machines with Timed Synchronization for Multi-Robot System Specification , 2005, 2005 portuguese conference on artificial intelligence.

[32]  Peter Baumgartner,et al.  Automated Deduction Techniques for the Management of Personalized Documents , 2003, Annals of Mathematics and Artificial Intelligence.

[33]  William McCune,et al.  Experiments with discrimination-tree indexing and path indexing for term retrieval , 1992, Journal of Automated Reasoning.

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

[35]  François Bry,et al.  SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.

[36]  Martin Giese,et al.  A Model Generation Style Completeness Proof for Constraint Tableaux with Superposition , 2002, TABLEAUX.

[37]  Geoff Sutcliffe,et al.  The state of CASC , 2006, AI Commun..

[38]  Christoph Goller,et al.  Controlled integration of the cut rule into connection tableau calculi , 2004, Journal of Automated Reasoning.

[39]  Peter Baumgartner,et al.  Hyper Tableaux , 1996, JELIA.

[40]  Oliver Obst,et al.  HTN Planning for Flexible Coordination Of Multiagent Team Behavior , 2005 .

[41]  Roy Dyckhoff.  Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.

[42]  Masaki Ogino,et al.  Getting closer: How Simulation and Humanoid League can benefit from each other , 2005, AMiRE.

[43]  Andrei Voronkov,et al.  Equality Elimination for the Tableau Method , 1996, DISCO.