DisLoP: A Research Project on Disjunctive Logic Programming

This paper gives a brief highdlevel description of what has been done in the Disjunctive Logic Programmingdproject (funded by Deutsche ForschungsdGemeinschaft), undertaken by the University of Koblenz, Germany since July 1995. Presented are the main ideas, the implemented systems and how to access them, and the relevant papers are cited. This paper also serves as a brief survey of the current status of disjunctive logic programming by highlighting important developments and provides enough pointers for further reading.

[1]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

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

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

[4]  Patrik Simons,et al.  Evaluating an Algorithm for Default Reasoning , 1995 .

[5]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

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

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

[8]  Victor W. Marek,et al.  Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.

[9]  Edward P. F. Chan.  A Possible World Semantics for Disjunctive Databases , 1993, IEEE Trans. Knowl. Data Eng..

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

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

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

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

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

[15]  Francesco Scarcello,et al.  Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation , 1997, Inf. Comput..

[16]  Chandrabose Aravindan,et al.  Knowledge base dynamics, Abduction and Databases updates , 1995, J. Appl. Non Class. Logics.

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

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

[19]  Kenneth A. Ross,et al.  Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.

[20]  Jürgen Dix,et al.  Non-Monotonic Extensions of Logic Programming , 1996, Lecture Notes in Computer Science.

[21]  L. Sterling.  Disjunctive Semantics based upon Partial and Bottom-Up Evaluation , 1995 .

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

[23]  Jürgen Dix,et al.  Nonmonotonic Reasoning: An Overview , 1997, CSLI Lecture Notes.

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

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

[26]  Jack Minker,et al.  An Overview of Nonmonotonic Reasoning and Logic Programming , 1993, J. Log. Program..

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

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

[29]  Chiaki Sakama,et al.  Possible Model Semantics for Disjunctive Databases , 1989, DOOD.

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

[31]  Chandrabose Aravindan,et al.  On the Correctness of Unfold/Fold Transformation of Normal and Extended Logic Programs , 1995, J. Log. Program..

[32]  Pascal Van Hentenryck.  Computing Stable Models by Program Transformation , 1994 .

[33]  Jürgen Dix,et al.  Characterizations of the Disjunctive Stable Semantics by Partial Evaluation , 1997, J. Log. Program..

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

[35]  Jürgen Dix,et al.  Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview , 1996, Logic, Action, and Information.

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

[37]  Jan Maluszy¿ski.  Logic Programming and Knowledge Representation (LPKR'97) , 1997 .

[38]  Ilkka Niemelä,et al.  Autoepistemic logic as a basis for automating nonmonotonic reasoning , 1996 .

[39]  Raymond Turner,et al.  Logics in Artificial Intelligence , 1994, Lecture Notes in Computer Science.

[40]  Victor W. Marek,et al.  Experimenting with Nonmonotonic Reasoning , 1995, ICLP.

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

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

[43]  Jürgen Dix,et al.  A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties , 1995, Fundam. Informaticae.

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

[45]  Jack Minker,et al.  Logic and Databases: A 20 Year Retrospective , 1996, Logic in Databases.

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

[47]  Georg Gottlob,et al.  Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..

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

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

[50]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[51]  Phan Minh Dung,et al.  An Argumentation-Theoretic Foundations for Logic Programming , 1995, J. Log. Program..

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

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

[54]  Jürgen Dix,et al.  Semantics of (disjunctive) Logic Programs Based on Partial Evaluation , 1999, J. Log. Program..

[55]  Ilkka Niemelä.  Towards Efficient Default Reasoning , 1995, IJCAI.

[56]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

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

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

[59]  David Scott Warren,et al.  Efficient Top-Down Computation of Queries under the Well-Founded Semantics , 1995, J. Log. Program..

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

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

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

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

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

[65]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

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

[67]  K. A. Ross,et al.  Tabled Evaluation with Delaying for General Logic Programs , 1996 .

[68]  Donald E. Knuth,et al.  The Stanford GraphBase - a platform for combinatorial computing , 1993 .

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

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

[71]  Michael Maher.  On Merging Theorem Proving and Logic Programming Paradigms , 1996 .

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

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

[74]  Konstantinos Sagonas,et al.  An Abstract Machine for Computing the Well-Founded Semantics , 1996, JICSLP.

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

[76]  Phan Minh Dung,et al.  On the Relations between Stable and Well-Founded Semantics of Logic Programs , 1992, Theor. Comput. Sci..

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

[78]  Jürgen Dix,et al.  A Classification Theory of Semantics of Normal Logic Programs: II. Weak Properties , 1995, Fundam. Informaticae.

[79]  Chandrabose Aravindan,et al.  Partial Deduction of Logic Programs wrt Well-Founded Semantics , 1992, ALP.

[80]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

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

[82]  Ilkka Niemelä,et al.  Efficient Implementation of the Well-founded and Stable Model Semantics , 1996, JICSLP.

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

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

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

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

[87]  David Scott Warren,et al.  Computation of Stable Models and Its Integration with Logical Query Processing , 1996, IEEE Trans. Knowl. Data Eng..