DisLoP: A research project on Disjunctive Logic Programming

AI Communications

Volumn 10, Issue 3-4, 1997, Pages 151-165

  Aravindan, Chandrabose ^a   Dix, Jürgen ^a   Niemelä, Ilkka ^a  

^a University of Koblenz ^*  (Germany)

Author keywords

Disjunctive Logic Programming; Non monotonic reasoning; Semantics

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL LINGUISTICS; MANAGEMENT INFORMATION SYSTEMS; MATHEMATICAL MODELS;

DISJUNCTIVE LOGIC PROGRAMMING SYSTEM; STABLE MODEL SEMANTICS; WELL FOUNDED SEMANTICS;

LOGIC PROGRAMMING;

EID: 0031369623     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (88)

1. K.R. Apt and R.N. Bol, Logic programming and negation: A survey, Journal of Logic Programming 19-20 (1994), 9-71.
2. C. Aravindan and P. Baumgartner, A rational and efficient algorithm for view deletion in databases, in: Proc. of International Logic Programming Symposium, J. Maluszynski, ed., The MIT Press, 1997. Also available as Technical Report RR-10-97 from the University of Koblenz, Germany.
3. C. Aravindan, P. Baumgartner, J. Dix, U. Furbach, G. Neugebauer, I. Niemelä, D. Schäfer and F. Stolzenburg, On merging theorem proving and logic programming paradigms, in: Proc. of the Joint International Conference and Symposium on Logic Programming, M. Maher, ed., Bonn, Germany, The MIT Press, 1996, p. 546.
4. C. Aravindan and P.M. Dung, Partial deduction of logic programs wrt well-founded semantics, New Generation Computing 13 (1994), 45-74. A related report is available on the Web from 〈http://www.uni-koblenz.de/∼arvind/papers/〉.
5. C. Aravindan and P.M. Dung, Knowledge base dynamics, abduction, and database updates, Journal of Applied Non-Classical Logics 5(1) (1995), 51-76. A related report is available on the Web from 〈http://www.unikoblenz.de/∼arvind/papers/〉.
6. C. Aravindan and P.M. Dung, On the correctness of unfold/fold transformations of normal and extended logic programs, Journal of Logic Programming 24(3) (1995), 201-218. A related report is available on the Web from 〈http://www.uni-koblenz.de/∼arvind/papers/〉.
7. C. Aravindan, An abductive framework for negation in disjunctive logic programming, in: Proc. of Joint European Workshop on Logics in AI, number 1126 in Lecture Notes in Artificial Intelligence, J.J. Alferes, L.M. Pereira and E. Orlowska, eds, Springer-Verlag, 1996, pp. 252-267. A related report is available on the Web from 〈http://www.uni-koblenz.de/∼arvind/papers/〉.
8. C. Aravindan, DisLoP: A disjunctive logic programming system based on PROTEIN theorem prover, in: Proc. of KI'96, number 1137 in Lecture Notes in Artificial Intelligence, G. Görz and S. Hölldobler, eds, Springer-Verlag, 1996, pp. 19-23.
9. S. Brass and J. Dix, A general approach to bottom-up computation of disjunctive semantics, in: Nonmonotonic Extensions of Logic Programming, LNAI 927, J. Dix, L. Pereira and T. Przymusinski, eds, Springer-Verlag, Berlin, 1995, pp. 127-155.
10. S. Brass and J. Dix, Disjunctive semantics based upon partial and bottom-up evaluation, in: Proc. of the 12th Int. Conf. on Logic Programming, L. Sterling, ed., Tokyo, MIT Press, 1995, pp. 199-213.
11. S. Brass and J. Dix, Characterizing D-WFS: Confluence and Iterated GCWA, in: Logics in Artificial Intelligence (JELIA '96), LNCS 1126, L.M. Pereira J.J. Alferes and E. Orlowska, eds, Springer-Verlag, 1996, pp. 268-283.
12. S. Brass and J. Dix, Characterizations of the disjunctive stable semantics by partial evaluation, Journal of Logic Programming 32(3) (1997), 207-228. (Extended abstract appeared in: Characterizations of the stable semantics by partial evaluation LPNMR, Proc. of the Third International Conference, LNCS 928, Kentucky, Springer-Verlag, 1995, pp. 85-98.)
13. S. Brass and J. Dix, Characterizations of the disjunctive stable semantics by partial evaluation, Journal of Logic Programming 32(3) (1997), 207-228. (Extended abstract appeared in: Characterizations of the stable semantics by partial evaluation LPNMR, Proc. of the Third International Conference, LNCS 928, Kentucky, Springer-Verlag, 1995, pp. 85-98.)
14. S. Brass and J. Dix, Characterizations of the disjunctive wellfounded semantics: Confluent calculi and iterated GCWA, Journal of Automated Reasoning, 1998, to appear. (Extended abstract appeared in: Characterizing D-WFS: Confluence and iterated GCWA. Logics in Artificial Intelligence, JELIA '96, LNCS 1126, Springer-Verlag, 1996, pp. 268-283.) .
15. S. Brass and J. Dix, Characterizations of the disjunctive wellfounded semantics: Confluent calculi and iterated GCWA, Journal of Automated Reasoning, 1998, to appear. (Extended abstract appeared in: Characterizing D-WFS: Confluence and iterated GCWA. Logics in Artificial Intelligence, JELIA '96, LNCS 1126, Springer-Verlag, 1996, pp. 268-283.) .
16. S. Brass and J. Dix, Semantics of disjunctive logic programs based on partial evaluation. Journal of fogic Programming, accepted for publication, 1998. (Extended abstract appeared in: Disjunctive semantics based upon partial and bottom-up evaluation, Proc. of the 12th Int. Conf. on Logic Programming, L. Sterling, ed., Tokyo, MIT Press, 1995, pp. 199-213.)
17. S. Brass and J. Dix, Semantics of disjunctive logic programs based on partial evaluation. Journal of fogic Programming, accepted for publication, 1998. (Extended abstract appeared in: Disjunctive semantics based upon partial and bottom-up evaluation, Proc. of the 12th Int. Conf. on Logic Programming, L. Sterling, ed., Tokyo, MIT Press, 1995, pp. 199-213.)
18. S. Brass and J. Dix, Semantics of disjunctive logic programs based on partial evaluation, Journal of Logic Programming, accepted for publication, 1998.
19. G. Brewka and J. Dix, Knowledge representation with logic programs, in: Handbook of Philosophical Logic, 2nd edn, Vol. 6, Methodologies, Chapter 6, D. Gabbay and F. Guenthner, eds, Reidel Publ., 1998.
20. G. Brewka, J. Dix and K. Konolige, Nonmonotonic Reasoning: An Overview, CSLI Lecture Notes 73, CSLI Publications, Stanford, CA, 1997.
21. S. Brass, J. Dix, I. Niemelä and T.C. Przymusinski, Comparison and efficient computation of the static and the disjunctive WFS, in: Proc. of the third Dutch-German Workshop on Nonmonotonic Reasoning and its Applications, G. Brewka, E. Weydert and C. Witteveen, eds, 1997, pp. 37-42, appeared also as TR-2/96.
22. S. Brass, J. Dix and T.C. Przymusinski, Super logic programs, in: Principles of Knowledge Representation and Reasoning: Proc. of the Fifth International Conference (KR '96), L.C. Aiello, J. Doyle and S.C. Shapiro, eds, San Francisco, CA, Morgan Kaufmann, 1996, pp. 529-541.
23. R. Ben-Eliyahu and I. Niemelä, eds, Working Notes of the IJCA1'95 Workshop on Applications and Implementations of Nonmonotonic Reasoning Systems, Montreal, Canada, AAAI Press, 1995.
24. P. Baumgartner and U. Furbach, Model elimination without contrapositives and its application to PTTP, Journal of Automated Reasoning 13 (1994), 339-359. Short version in: Proc. of CADE-12, LNAI 814, Springer-Verlag, 1994, pp. 87-101.
25. P. Baumgartner and U. Furbach, Model elimination without contrapositives and its application to PTTP, Journal of Automated Reasoning 13 (1994), 339-359. Short version in: Proc. of CADE-12, LNAI 814, Springer-Verlag, 1994, pp. 87-101.
26. P. Baumgartner and U. Furbach, PROTEIN: A PROver with a Theory Extension Interface, in: Automated Deduction - CADE-12, vol. 814 of Lecture Notes in Aritificial Intelligence, A. Bundy, ed., Springer-Verlag, 1994, pp. 769-773. Available at the URL: http://www.uni-koblenz.de/agki/Systems/PROTEIN/.
27. P. Baumgartner, P. Fröhlich, U. Furbach and W. Nejdl, Semantically guided theorem proving for diagnosis applications, in: 15th International Joint Conference on Artificial Intelligence (IJCAI '97), Nagoya, 1997, International Joint Conference on Artificial Intelligence, to appear.
28. P. Baumgartner, P. Fröhlich, U. Furbach and W. Nejdl, Tableaux for diagnosis applications, in: Automated Reasoning with Analytic Tableaux and Related Methods, number 1227 in Lecture Notes in Aritificial Intelligence, D. Galmiche, ed., Springer-Verlag, 1997, pp. 76-90.
29. P. Baumgartner, U. Furbach and I. Niemelä, Hyper Tableaux, in: Proc. JELIA '96, number 1126 in Lecture Notes in Aritificial Intelligence, European Workshop on Logic in AI, Springer-Verlag, 1996. (Long version in: Fachberichte Informatik, 8-96, Universität Koblenz-Landau.)
30. P. Baumgartner, U. Furbach and I. Niemelä, Hyper Tableaux, in: Proc. JELIA '96, number 1126 in Lecture Notes in Aritificial Intelligence, European Workshop on Logic in AI, Springer-Verlag, 1996. (Long version in: Fachberichte Informatik, 8-96, Universität Koblenz-Landau.)
31. P. Baumgartner, U. Furbach and F. Stolzenburg, Computing answers with model elimination. Artificial Intelligence 90(1-2) (1997), 135-176.
32. C. Baral and M. Gelfond, Logic programming and knowlege representation, Journal of Logic Programming 19-20 (1994).
33. S. Brass, U. Zukowski and B. Freitag, Transformation based bottom-up computation of the well-founded model, in: Nonmonotonic Extensions of Logic Programming, LNAI 1216, J. Dix, L. Pereira and T. Przymusinski, eds, Springer-Verlag, Berlin, 1997, pp. 171-201.
34. E.P.F. Chan, A possible world semantics for disjunctive databases, IEEE Trans. on Knowledge and Data Engineering 5(2) (1993), 282-292.
35. P. Cholewinski, V.W. Marek, A. Mikitiuk and M. Truszczyński, Experimenting with nonmonotonic reasoning, in: Proc. of the 12th International Conference on Logic Programming, Tokyo, 1995, pp. 267-281.
36. W. Chen, T. Swift, and D.S. Warren, Efficient top-down computation of queries under the well-founded semantics, Journal of Logic Programming 24(3) (1995), 219-245.
37. W. Chen and D.S. Warren, The SLG system, 1993. Available by ftp from seas.smu.edu:pub or sbcs.sunysv.edu:pub/XSB.
38. W. Chen and D.S. Warren, Computing of stable models and its integration with logical query processing, IEEE Trans. on Knowledge and Data Engineering 17 (1995), 279-300.
39. W. Chen and D.S. Warren, Tabled evaluation with delaying for general logic programs, Journal of the ACM 43(1) (1996), 20-74.
40. J. Dix, L. Farinas del Cerro and U. Furbach, eds, Logics in Artificial Intelligence, Springer-Verlag, Berlin, 1998, to appear.
41. J. Dix, U. Furbach and A. Nerode, eds, Logic Programming and Nonmonotonic Reasoning, LNAI 1265, Springer-Verlag, Berlin, 1997.
42. J. Dix, U. Furbach and I. Niemelä, Nonmonotonic reasoning: Towards efficient calculi and implementations, in: Handbook ttf Automated Reasoning, A. Voronkov and A. Robinson, eds, Elsevier-Science-Press, 1998, to appear.
43. J. Dix, G. Gottlob and V. Marek, Reducing disjunctive to non-disjunctive semantics by shift-operations, Fundamenta Infarmaticae XXVIII(1/2) (1996), 87-100.
44. J. Dix, A classification-theory of semantics of normal logic programs: I. Strong properties, Fundcimenta Infarmaticae XXII(3) (1995), 227-255.
45. J. Dix, A classification-theory of semantics of normal logic programs: II. Weak properties, Fundamenta Informaticae XXII(3) (1995), 257-288.
46. J. Dix, Semantics of logic programs: Their intuitions and formal properties. An overview, in: Logic, Action and Information - Essays on Logic in Philosophy and Artificial Intelligence, A. Fuhrmann and H. Roll, eds, DeGruyter, 1995, pp. 241-327.
47. J. Dix, D. Loveland, J. Minker and D.S. Warren, Disjunctive Logic Programming and databases: Nonmonotonic aspects. Technical Report Dagstuhl Seminar Report 150, IBFI GmbH, Schloß Dagstuhl, 1996.
48. J. Dix, L. Pereira and T. Przymusinski, eds, Non-Monotonic Extensions of Logic Programming, LNAI 927, Springer-Verlag, Berlin, 1995.
49. J. Dix, L. Pereira and T. Przymusinski, eds, Non-Monotonic Extensions of Logic Programming, LNAI 1216, Springer-Verlag, Berlin, 1997.
50. J. Dix, L. Pereira and T. Przymusinski, Prolegomena to logic programming for non-monotonic reasoning, in: Nonmonotonic Extensions of Logic Programming, LNAI 1216, J. Dix, L. Pereira and T. Przymusinski, eds, Springer-Verlag, Berlin, 1997, pp. 1-36.
51. J. Dix, L.M. Pereira and T. Przymusinski, Logic programming and knowledge representation. Technical Report TR-19/97, University of Koblenz, Department of Computer Science, Rheinau 1, September, 1997.
52. J. Dix and F. Stolzenburg, Computation of non-ground disjunctive well-founded sssemantics with cconstraint logic programming (preliminary report), in: Nonmonotonic Extensions of Logic Programming, LNAI 1216, J. Dix, L. Pereira and T. Przymusinski, eds, Springer-Verlag, Berlin, 1997, pp. 202-226.
53. J. Dix and F. Stolzenburg, A framework to incorporate nonmonotonic reasoning into constraint logic programming, Journal of Logic Programming, 1998. Special Issue on Constraint Logic Programming, Guest Editors: K. Marriott and P. Stuckey, to appear in 1998. Also appeared as Technical Report 19/97 at Dept. of CS, University of Koblenz-Landau, May, 1997.
54. J. Dix and F. Stolzenburg, A framework to incorporate nonmonotonic reasoning into constraint logic programming, Journal of Logic Programming, 1998. Special Issue on Constraint Logic Programming, Guest Editors: K. Marriott and P. Stuckey, to appear in 1998. Also appeared as Technical Report 19/97 at Dept. of CS, University of Koblenz-Landau, May, 1997.
55. P.M. Dung, On the relations between stable and well-founded semantics of logic programs, Theoretical Computer Science 105 (1992), 7-25.
56. P.M. Dung, An argumentation theoretic foundation for logic programming, Journal of Logic Programming 22(2) (1995), 151-177.
57. P.M. Dung, On the acceptability of argument and its fundamental role in non-monotonic reasoning and logic programming and n-person game. Artificial Intelligence 76, 1995.
58. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: 5th Conference on Logic Programming, R. Kowalski and K. Bowen, eds, MIT Press, 1988, pp. 1070-1080.
59. M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases. New Generation Computing 9 (1991), 365-387. (Extended abstract appeared in: Logic programs with classical negation, Proc. of the 7th International Logic Programming Conference, Jerusalem, MIT Press, 1990, pp. 579-597.)
60. M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases. New Generation Computing 9 (1991), 365-387. (Extended abstract appeared in: Logic programs with classical negation, Proc. of the 7th International Logic Programming Conference, Jerusalem, MIT Press, 1990, pp. 579-597.)
61. G. Gottlob, Complexity results for nonmonotonic logics, Journal of Logic and Computation 2(3) (1992), 397-425.
62. D.E. Knuth, Stanford GraphBase: A Platform for Combinatorial Computing, Addison-Wesley, 1993.
63. J. Lobo, J. Minker and A. Rajasekar, Foundations of Disjunctive Logic Programming, MIT Press, 1992.
64. N. Leone, L. Rullo and F. Scarcello, Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation, Information and Computation 135(2) (1997), 69-112.
65. J. Minker, On indefinite databases and the closed world assumption, in: Lecture Notes in Computer Science 138, Springer-Verlag, 1982, pp. 292-308.
66. J. Minker, An overview of nonmonotonic reasoning and logic programming, Journal of Logic Programming, Special Issue, 17, 1993.
67. J. Minker, Logic and databases: A 20 year retrospective, in: Proc. of the International Workshop on Logic in Databases (LID), LNCS 1154, D. Pedreschi and C. Zaniolo, eds, Springer-Verlag, Berlin, 1996, pp. 3-58.
68. W. Marek and M. Truszczyński, Autoepistemic logic. Journal of the ACM 38 (1991), 588-619.
69. W. Marek and M. Truszczyński, Nonmonotonic Logics; Context-Dependent Reasoning, 1st edn, Springer-Verlag, Berlin, 1993.
70. I. Niemelä, A decision method for nonmonotonic reasoning based on autoepistemic reasoning. Journal of Automated Reasoning 14 (1995), 3-42.
71. I. Niemelä, Towards efficient default reasoning, in: Proc. of the 14th International Joint Conference on Artificial Intelligence, Montreal, Canada, Morgan Kaufmann, 1995, pp. 312-318.
72. I. Niemelä, Autoepistemic logic as a basis for automating nonmonotonic reasoning, in: Partiality, Modality and Nonmonotonicity, P. Doherty, ed., CSLI Publications, Stanford, CA, 1996, pp. 251-289.
73. I. Niemelä, Implementing circumscription using a tableau method, in: Proc. of the European Conference on Artificial Intelligence, Budapest, Hungary, Wiley, 1996, pp. 80-84.
74. I. Niemelä, A tableau calculus for minimal model reasoning, in: Proc. of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Terrasini, Italy, Springer-Verlag, 1996, pp. 278-294.
75. I. Niemelä, ed., Proc. of the ECAI '96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems, Budapest, Hungary, 1996. Universität Koblenz-Landau, Fachbericht Informatik 18-96. Available at http://www.uni-koblenz.de/universitaet/fb4/publications/GelbeReihe/.
76. I. Niemelä and P. Simons, Evaluating an algorithm for default reasoning, in: Working Notes of the IJCAI '95 Workshop on Applications and Implementations of Nonmonotonic Reasoning Systems, Montreal, Canada, 1995, pp. 66-72.
77. I. Niemelä and P. Simons, Efficient implementation of the well-founded and stable model semantics, in: Proc. of the Joint International Conference and Symposium on Logic Programming, M. Maher, ed., Bonn, Germany, The MIT Press, 1996, pp. 289-303.
78. R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980), 81-132.
79. R. Reiter, A theory of diagnosis from first principles. Artificial Intelligence 32(1) (1987), 57-95.
80. A. Rajasekar, J. Lobo and J. Minker, Weak generalized closed world assumption, Journal of Automated Reasoning 5 (1989), 293-307.
81. K.A. Ross and R.W. Topor, Inferring negative information from disjunctive databases, Journal of Automated Reasoning 4(2) (1988), 397-424.
82. C. Sakama, Possible model semantics for disjunctive databases, in: Deductive and Object-Oriented Databases, Proc. of the First International Conference (DOOD '89), W. Kim, J.-M. Nicolas and S. Nishio, eds, Kyoto, Japan, North-Holland, 1989, pp. 369-383.
83. Ch. Sakama and K. Inoue, An Alternative approach to the semantics of disjunctive logic programs and deductive databases, Journal of Automated Reasoning 13 (1994), 145-172.
84. K. Sagonas, T. Swift and D.S. Warren, An abstract machine for computing the Well-Founded semantics, in: Proc. of Joint international Conference and Symposium on Logic Programming, M. Maher, ed., The MIT Press, 1996, pp. 274-288.
85. F. Stolzenburg and B. Thomas, Analysing rule sets for the calculation of banking fees by a theorem prover with constraints, in: Proc. of the 2nd International Conference on Practical Application of Constraint Technology, London, Practical Application Company, 1996, pp. 269-282.
86. J. Stuber, Computing stable models by program transformation, in: Proc. of International Conference on Logic Programming, P. Van Hentenryck, ed., The MIT Press, 1994, pp. 58-73.
87. A. van Gelder, K.A. Ross and J.S. Schlipf, Unfounded sets and well-founded semantics for general logic programs, in: Proc. 7th Symposion on Principles of Database Systems, 1988, pp. 221-230.
88. A. van Gelder, K.A. Ross and J.S. Schlipf, The well-founded semantics for general logic programs, Journal of the ACM 38 (1991), 620-650.