A Flexible System for Constraint Disjunctive Logic Programming

Constraint logic programming combines Horn-clause logic a nd constraint reasoning. However, the specification of many problems often requires d isjunctive, i.e. non-Horn rules in addition. There are approaches proposing such an extensi on of logic programming, but first and foremost they provide theoretical frameworks only . Here, we want to introduce a method which is also well-suited for implementation, namel y constraint model elimination. It can be seen as a powerful programming language for positiv e disjunctive logic programs. Hence, we state not only refutational, but answer-complete ness of our calculus in this paper. The main idea of the implementation is to compile the logical part of a problem specification into Prolog (using the so-called PTTP-technique) and to exp loit existing constraint solvers (available with many Prolog systems nowadays). The whole ap proach is integrated into the Protein theorem prover. We also consider some applications for this approach, e.g. analysing rule sets.

[1]  Jürgen Ebert,et al.  A Declarative Approach to Graph Based Modeling , 1994, WG.

[2]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[3]  Ulrich Furbach.  Theory Reasoning in First Order Calculi , 1994, IS/KI.

[4]  Peter Baumgartner,et al.  Hyper Tableaux and Disjunctive Logic Programming , 1996, DDLP.

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

[6]  Jürgen Dix,et al.  Deduktion und Logisches Programmieren , 1996, Künstliche Intell..

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

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

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

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

[11]  Walter Hower,et al.  Constraint Satisfaction - Algorithms and Complexity Analysis , 1995, Inf. Process. Lett..

[12]  Peter Baumgartner,et al.  Model Elimination Without Contrapositives , 1994, CADE.

[13]  Peter Baumgartner,et al.  Constraint Model Elimination and a PTTP-Implementation , 1995, TABLEAUX.

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

[15]  Jürgen Dix,et al.  A Disjunctive Semantics Bases on Unfolding and Bottom-Up Evaluation , 1994, GI Jahrestagung.

[16]  Michael J. Maher.  Complete axiomatizations of the algebras of finite, rational and infinite trees , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[17]  NET CASE: Towards a Petri Net Based Technique for the Development of Expert/Database Systems , 1994 .

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

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

[20]  Gert Smolka,et al.  Records for Logic Programming , 1994, J. Log. Program..

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

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

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

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

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

[26]  Mark Johnson,et al.  Computing with Features as Formulae , 1994, Comput. Linguistics.

[27]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[28]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

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

[30]  Martin Jung,et al.  GTU - A workbench for the development of natural language grammars , 1995 .

[31]  Jürgen Dix,et al.  Computation of Non-Ground Disjunctive Well-Founded Semantics with Constraint Logic Programming , 1996, NMELP.

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

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

[34]  Jürgen Dix,et al.  Characterizations of the Stable Semantics by Partial Evaluation , 1994, LPNMR.

[35]  Reinhold Letz.  First-order calculi and proof procedures for automated deduction , 1993 .

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

[37]  Michael J. Maher.  A Logic Programming View of CLP , 1993, ICLP.

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

[39]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

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

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

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

[43]  Jürgen Dix,et al.  A general Approach to Bottom-Up Computation of Disjunctive Semantics , 1994, NMELP.

[44]  Alan M. Frisch.  The Substitutional Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning , 1991, Artif. Intell..

[45]  Thom W. Frühwirth,et al.  Terminological Reasoning with Constraint Handling Rules , 1993, PPCP.

[46]  Peter Baumgartner.  Refinements of Theory Model Elimination and a Variant without Contrapositives , 1994, ECAI.

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

[48]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

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

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