A Confluent Connection Calculus

This work is concerned with basic issues of the design of calculi and proof procedures for first-order connection methods and tableaux calculi. Proof procedures for these type of calculi developed so far suffer from not exploiting proof confluence, and very often unnecessarily rely on a heavily backtrack oriented control regime. As a new result, we present a variant of a connection calculus and prove its strong completeness. This enables the design of backtrack-free control regimes. To demonstrate that the underlying fairness condition is reasonably implementable we define an effective search strategy.

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

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

[3]  Peter Baumgartner,et al.  PROTEIN: A PROver with a Theory Extension INterface , 1994, CADE.

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

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

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

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

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

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

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

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

[12]  Peter Baumgartner,et al.  Hyper Tableau - The Next Generation , 1998, TABLEAUX.

[13]  Elmar Eder,et al.  Relative complexities of first order calculi , 1992, Artificial intelligence = Künstliche Intelligenz.

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

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

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

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

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

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

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

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

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

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

[24]  Reiner Hähnle,et al.  Ordered Tableaux: Extensions and Applications , 1997, TABLEAUX.

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

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

[27]  François Bry,et al.  Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux , 1996, TABLEAUX.

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

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

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

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

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

[33]  P. Simons.  Eecient Implementation of the Well- Founded and Stable Model Seman- Tics , 1996 .

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

[35]  Reiner Hähnle,et al.  A-Ordered Tableaux , 1996, J. Log. Comput..

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

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

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

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

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

[41]  Peter Baumgartner,et al.  Consolution as a Framework for Comparing Calculi , 1993, J. Symb. Comput..

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

[43]  Jean-Paul Billon,et al.  The Disconnection Method - A Confluent Integration of Unification in the Analytic Framework , 1996, TABLEAUX.

[44]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

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

[46]  Donald W. Loveland,et al.  Mechanical Theorem-Proving by Model Elimination , 1968, JACM.

[47]  Wolfgang Bibel,et al.  Automated Theorem Proving , 1987, Artificial Intelligence / Künstliche Intelligenz.

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

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

[50]  Peter Baumgartner,et al.  Computing Answers with Model Elimination , 1997, Artif. Intell..

[51]  Bernhard Beckert,et al.  The Many-Valued Theorem Prover 3TAP , 1992, IWBS Report.

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

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

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

[55]  Peter Baumgartner,et al.  Hyper Tableaux The Next Generation , 1997 .

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

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

[58]  Andrei Voronkov.  Herbrand's theorem, automated reasoning and semantic tableaux , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[59]  Franz Baader,et al.  Unification theory , 1986, Decis. Support Syst..

[60]  Andrei Voronkov,et al.  Strategies in Rigid-Variable Methods , 1997, IJCAI.

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

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

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

[64]  Manfred Kamp.  Managing a multi-file, multi-language software repository for program comprehension tools: a generic approach , 1998, Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242).

[65]  Jürgen Ebert,et al.  Program comprehension in multi-language systems , 1998, Proceedings Fifth Working Conference on Reverse Engineering (Cat. No.98TB100261).