DisLoP: A Disjunctive Logic Programming System Based on PROTEIN Theorem Prover

In this paper, we describe a disjunctive logic programming system, referred to as DisLoP, based on PROTEIN theorem prover. PROTEIN supports certain theorem proving calculi, such as restart model elimination and hyper tableaux, that are suitable for working with positive disjunctive logic programs. In particular, restart model elimination calculus is answer complete for postive queries. The DisLoP project started at this point with the aim of extending this further to minimal model reasoning and query processing wrt normal disjunctive logic programming too. The first phase of the project is complete and DisLoP can now perform minimal model reasoning with positive disjunctive logic programs, using both bottom-up and top-down strategies.

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

[2]  Jürgen Dix,et al.  Disjunctive Semantics based upon Partial and Bottom-Up Evaluation , 1995, ICLP.

[3]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

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

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

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

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

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

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

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

[11]  Dieter Zöbel,et al.  PROGRAM TRANSFORMATIONS FOR DISTRIBUTED CONTROL SYSTEMS , 1994 .

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

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

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

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

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

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

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

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

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

[21]  Ralf Hofestädt,et al.  Workshop Parallele Datenverarbeitung im Verbund von Hochleistungs-Workstations , 1994 .

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

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

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

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

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

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

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

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

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

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

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

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

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

[35]  Jack Minker,et al.  Circumscription and Disjunctive Logic Programming , 1991, Artificial and Mathematical Theory of Computation.

[36]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

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

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

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

[40]  Jürgen Dix,et al.  Characterizing D-WFS: Confluence and Iterated GCWA , 1996, JELIA.