An Abductive Framework for Negation in Disjunctive Logic Programming

In this paper, we study an abductive framework for disjunctive logic programming that provides a new way to understand negation in disjunctive logic programming. We show that the defined framework captures the existing minimal model semantics based on (Extended) Generalised Closed World Assumption ((E)GGWA), This relationship between abduction and minimal model reasoning provides a methodology to develop algorithms for minimal model reasoning. To demonstrate this, we show how a theorem prover, based on restart model elimination calculus, can be modified for abductive reasoning and thus for minimal model reasoning.

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

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

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

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

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

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

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

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

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

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

[11]  Katsumi Inoue,et al.  Linear Resolution for Consequence Finding , 1992, Artif. Intell..

[12]  Antonis C. Kakas,et al.  The role of abduction in logic programming , 1998 .

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

[14]  Phan Minh Dung.  Acyclic Disjunctive Logic Programs with Abductive Procedures as Proof Procedure , 1992, FGCS.

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

[16]  Paolo Mancarella,et al.  Abductive Logic Programming , 1992, LPNMR.

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

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

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

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

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

[22]  Danny De Schreye,et al.  SLDNFA: An Abductive Procedure for Normal Abductive Programs , 1992, JICSLP.

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

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

[25]  Matthew L. Ginsberg.  A Circumscriptive Theorem Prover , 1989, Artif. Intell..

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

[27]  Katsumi Inoue,et al.  On theorem provers for circumscription , 1990 .

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

[29]  Teodor C. Przymusinski.  An Algorithm to Compute Circumscription , 1989, Artif. Intell..

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

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

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

[33]  Chiaki Sakama,et al.  On the Equivalence between Disjunctive and Abductive Logic Programs , 1994, ICLP.

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

[35]  Teodor C. Przymusinski,et al.  On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..

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

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

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

[39]  Phan Minh Dung,et al.  Negations as Hypotheses: An Abductive Foundation for Logic Programming , 1991, ICLP.

[40]  Robert A. Kowalski,et al.  Abduction Compared with Negation by Failure , 1989, ICLP.

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

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

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

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