Hyper Tableaux The Next Generation

" Hyper tableau " is a sound and complete calculus for first-order clausal logic. The present paper introduces an improvement which removes the major weakness of the calculus, which is the need to (at least partially) blindly guess ground-instantiations for certain clauses. This guessing is now replaced by a unification-driven technique. The calculus is presented in detail, which includes a completeness proof. Completeness is proven by using a novel approach to extract a model from an open branch. This enables semantical redundancy criteria which are not present in related approaches.

[1]  A. Winter.  Generic Support for Understanding Heterogeneous Software Generic Support for Understanding Heterogeneous Software , 1995 .

[2]  Chandrabose Aravindan,et al.  A Rational and Efficient Algorithm for View Deletion in Databases , 1997, ILPS.

[3]  Frieder Stolzenburg,et al.  A Flexible System for Constraint Disjunctive Logic Programming , 1998, Künstliche Intell..

[4]  Jürgen Dix,et al.  Non-monotonic Extensions of Logic Programming: Theory, Implementation and Applications , 1996 .

[5]  Lutz Priese,et al.  A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets , 1998, Theor. Comput. Sci..

[6]  Peter Baumgartner,et al.  Tableaux for Diagnosis Applications , 1997, TABLEAUX.

[7]  J. A. Robinson,et al.  Automatic Deduction with Hyper-Resolution , 1983 .

[8]  Peter Baumgartner,et al.  Model Elimination, Logic Programming and Computing Answers , 1995, IJCAI.

[9]  Jürgen Ebert,et al.  Specifying Object Oriented Systems Using Gdmo, Zest and Sdl'92 Specifying Object Oriented Systems Using Gdmo, Zest and Sdl'92 Reports of the Gdmo Project Specifying Object Oriented Systems Using Gdmo, Zest and Sdl'92 , 1997 .

[10]  Ilkka Niemelä.  Implementing Circumscription Using a Tableau Method , 1996, ECAI.

[11]  Michael Maher.  Efficient Implementation of the Well-founded and Stable Model Semantics , 1996 .

[12]  Peter Baumgartner,et al.  Semantically Guided Theorem Proving for Diagnosis Applications , 1997, IJCAI.

[13]  Stefan Brass,et al.  D-wfs: a Connuent Calculus and an Equivalent Characterization , 1995 .

[14]  Bernhard Beckert,et al.  The Tableau-based Theorem Prover 3 T a P , 1996 .

[15]  Lutz Priese,et al.  Algebraic Characterization of Petri Net Pomset Semantics , 1997, CONCUR.

[16]  F. Stolzenburg,et al.  Analyzing Rule Sets for the Calculation of Banking Fees by a Theorem Prover with Constraints , 1998 .

[17]  Jürgen Dix,et al.  A Comparison of STATIC Semantics with D-WFS , 1996 .

[18]  Jürgen Ebert,et al.  The extract-transform-rewrite cycle: a step towards metaCARE , 1998, Proceedings of the Second Euromicro Conference on Software Maintenance and Reengineering.

[19]  Christoph Steigner,et al.  Modelling Timeouts in Protocol Design , 1995 .

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

[21]  Angelika Franzke,et al.  Recommendations for an Improvement of GDMO Final Report of the GDMO Project March 1997 , 1997 .

[22]  Wolfgang Albrecht,et al.  Integrating Fixed Priority and Static Scheduling to Maintain External Consistency , 1997 .

[23]  Peter Baumgartner,et al.  Calculi for Disjunctive Logic Programming , 1997, ILPS.

[24]  William H. Joyner.  Resolution Strategies as Decision Procedures , 1976, JACM.

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

[26]  Jens Woch,et al.  A Component-based and Abstractivistic Agent Architecture for the Modelling of Mas in the Social Sciences , 1997 .

[27]  Jürgen Dix,et al.  Logisches Programmieren mit Negation und Disjunktion , 1996, Künstliche Intell..

[28]  Jürgen Ebert,et al.  A Generic System to Support Multi-Level Understanding of Heterogeneous Software , 1997 .

[29]  Jürgen Ebert,et al.  Graph Based Modeling and Implementation with EER / GRAL , 1996, ER.

[30]  Lutz Priese,et al.  Abstract Fairness and Semantics , 1997, Theor. Comput. Sci..

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

[32]  Stephan Philippi,et al.  Integration of Integrity Constraints into Object-Oriented Database Schema according to ODMG-93 , 1995 .

[33]  Gottfried Vossen,et al.  I-Serializability: Generalized Correctness for Transaction-Based Environments , 1997, Inf. Process. Lett..

[34]  Jürgen Ebert,et al.  Meta-CASE in Practice: a Case for KOGGE , 1997, CAiSE.

[35]  Chandrabose Aravindan.  DisLoP: A Disjunctive Logic Programming System Based on PROTEIN Theorem Prover , 1996, KI.

[36]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[37]  Ilkka Niemelä,et al.  A Tableau Calculus for Minimal Model Reasoning , 1996, TABLEAUX.

[38]  Carlo Simon,et al.  The Petri Net Tools Neptun and Poseidon , 1997 .

[39]  Wenjin Lu.  Minimal Model Generation Based on E-hyper Tableaux , 1997, KI.

[40]  U. Furbach.  Re nements for Restart Model Elimination , 1996 .

[41]  Jürgen Dix,et al.  Knowledge Representation with Logic Programs , 1997, LPKR.

[42]  Jürgen Dix,et al.  Characterizations and Implementation of Static Semantics of Disjunctive Programs , 1996 .

[43]  Jürgen Dix,et al.  Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations , 1996, Fundam. Informaticae.

[44]  Jürgen Dix,et al.  A Framework to Incorporate Non-Monotonic Reasoning Into Constraint Logic Programming , 1998, J. Log. Program..

[45]  Ilkka Niemell.  A Tableau Calculus for Minimal Model Reasoning Ilkka Niemel a a Tableau Calculus for Minimal Model Reasoning , 1996 .

[46]  Luís Moniz Pereira,et al.  Logic Programming and Knowledge Representation (LPKR'97) , 1997, ILPS.

[47]  Angelika Franzke.  GRAL 2.0: A Reference Manual , 1997 .

[48]  Martin Volk,et al.  Constraint Logic Programming for Computational Linguistics , 1996, LACL.

[49]  Chandrabose Aravindan.  An Abductive Framework for Negation in Disjunctive Logic Programming , 1996, JELIA.

[50]  Thomas Marx,et al.  NetCASE -- a Petri Net based Method for Database Application Design and Generation , 1995 .

[51]  Harro Wimmel.  Fachberichte Informatik on Some Compositional Petri Net Semantics Universitt at Koblenz{landau on Some Compositional Petri Net Semantics , 1995 .

[52]  Peter Baumgartner,et al.  Theorem Proving with Analytic Tableaux and Related Methods , 1995, Lecture Notes in Computer Science.

[53]  Stephan Philippi,et al.  System modelling using Object-Oriented Pr / T-Nets , 1997 .

[54]  Luís Moniz Pereira,et al.  Prolegomena to Logic Programming for Non-monotonic Reasoning , 1996, NMELP.

[55]  Jürgen Dix,et al.  Towards Well-Behaved Semantics Suitable for Aggregation , 1997 .

[56]  Frieder Stolzenburg,et al.  Membership-Constraints and Complexity in Logic Programming with Sets , 1996, FroCoS.

[57]  J. Ebert,et al.  Querying Graph Structures with GQL , 1996 .

[58]  Reiner Hähnle,et al.  Semantic Tableaux with Ordering Restrictions , 1994, CADE.

[59]  L Priese,et al.  Finite H-systems with 3 test tubes are not predictable. , 1998, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.

[60]  Hiroshi Fujita,et al.  A Model Generation Theorem Prover in KL1 Using a Ramified -Stack Algorithm , 1991, International Conference on Logic Programming.

[61]  Daniel Brand.  Analytic Resolution in Theorem Proving , 1976, Artif. Intell..