Semantics of (disjunctive) logic programs based on partial evaluation

Journal of Logic Programming

Volumn 40, Issue 1, 1999, Pages 1-46

  Brass, Stefan ^a,b   Dix, Jürgen ^c,d  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

^b UNIVERSITY OF PITTSBURGH   (United States)

^c University of Maryland ^*  (United States)

^d University of Koblenz ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS;

DISJUNCTIVE LOGIC PROGRAMS;

LOGIC PROGRAMMING;

EID: 0032687460     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10030-4     Document Type: Article

References (65)

1. C. Aravindan, P. Minh Dung, On the correctness of unfold/fold transformations of normal and extended logic programs, Journal of Logic Programming 24 (3) (1995) 201-218.
2. J. Arrazola, J. Dix, M. Osorio, Confluent rewriting systems for logic programming semantics, Technical Report TR 27/97, University of Koblenz, Department of Computer Science, Rheinau 1, October 1997.
3. S. Brass, J. Dix, A general approach to bottom-up computation of disjunctive semantics, in: J. Dix, L. Pereira, T. Przymusinski (Eds.), Nonmonotonic Extensions of Logic Programming, LNAI 927, Springer, Berlin, 1995, pp. 127-155.
4. S. Brass, J. Dix, Disjunctive semantics based upon partial and bottom-up evaluation, in: L. Sterling (Ed.), Proceedings of The 12th Int. Conf. on Logic Programming, Tokyo, MIT Press, Cambridge, MA, June 1995, pp. 199-213.
5. S. Brass, 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, Proceedings of the Third International Conference, Kentucky, LNCS 928, Springer, Berlin, 1995, pp. 85-98).
6. S. Brass, 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, Proceedings of the Third International Conference, Kentucky, LNCS 928, Springer, Berlin, 1995, pp. 85-98).
7. S. Brass, J. Dix, Characterizations of the disjunctive well-founded semantics: confluent calculi and iterated GCWA, Journal of Automated Reasoning 20 (1) (1998) 143-165 (Extended abstract appeared in: Characterizing D-WFS: Confluence and Iterated GCWA. Logics in Artificial Intelligence, JELIA '96, LNCS 1126, Springer, Berlin, 1996, pp. 268-283).
8. S. Brass, J. Dix, Characterizations of the disjunctive well-founded semantics: confluent calculi and iterated GCWA, Journal of Automated Reasoning 20 (1) (1998) 143-165 (Extended abstract appeared in: Characterizing D-WFS: Confluence and Iterated GCWA. Logics in Artificial Intelligence, JELIA '96, LNCS 1126, Springer, Berlin, 1996, pp. 268-283).
9. G. Brewka, J. Dix, Knowledge representation with extended logic programs, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, 2nd edition, vol. 6, Methodologies, Ch. 6, Reidel, Dordrecht, 1998.
10. S. Brass, J. Dix, I. Niemelä, T.C. Przymusinski, A comparison of the static and the disjunctive well-founded semantics and its implementation, in: A.G. Cohn, L.K. Schubert, S.C. Shapiro (Eds.), Proceedings of The Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR '98), San Francisco, CA, Morgan Kaufmann, Los Altos, CA, May 1998, appeared also as TR 17/97, University of Koblenz.
11. S. Brass, J. Dix, T.C. Przymusinski, Super logic programs, in: L.C. Aiello, J. Doyle, S.C. Shapiro (Eds.), Proceedings of The Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), San Francisco, CA, Morgan Kaufmann, Los Altos, CA, 1996, pp. 529-541.
12. S. Brass, U.W. Lipeck, Generalized bottom-up query evaluation, in: A. Pirotte, C. Delobel, G. Gottlob (Eds.), Third Int. Conf. on Advances in Database Technology (EDBT'92), LNCS 580, Springer, Berlin, 1992, pp. 88-103.
13. C. Bell, A. Nerode, R.T. Ng, V.S. Subrahmanian, Mixed integer programming methods for computing non-monotonic deductive databases, Journal of the ACM 41 (6) (1994) 1178-1215.
14. S. Brass, Improved bottom-up query evaluation in positive disjunctive databases, in: B. Wolfinger (Ed.), Innovationen bei Rechen- und Kommunikationssystemen (IFIP-Congress, Workshop FG2: Disjunctive Logic Programming and Disjunctive Databases), Springer, Berlin, 1994, pp. 75-82.
15. S. Brass, Bottom-up query evaluation in extended deductive databases, Habilitationsschrift, Fachbereich Mathematik, Universität Hannover, 1996, http://www.informatik.uni-hannover.de/ 126sb/habil.html.
16. F. Bry, Logic programming as constructivism: A formalization and its application to databases, in: Proc. of The Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'89), 1989, pp. 34-50.
17. F. Bry, Negation in logic programming: A formalization in constructive logic, in: D. Karagiannis (Ed.), Information Systems and Artificial Intelligence: Integration Aspects, Springer, Berlin, 1990, pp. 30-46.
18. S. Brass, U. Zukowski, B. Freitag, Transformation-based bottom-up computation of the well-founded model, in: J. Dix, L. Moniz Pereira, T.C. Przymusinski (Eds.), Non-Monotonic Extensions of Logic Programming (NMELP'96), LNAI 1216, Springer, Berlin, 1997, pp. 171-201.
19. C.-L. Chang, R.C.-T. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.
20. S. Costantini, G.A. Lanzarone, Static semantics as program transformation and well-founded computation, in: J. Dix, L. Pereira, T. Przymusinski (Eds.), Nonmonotonic Extensions of Logic Programming, LNAI 927, Springer, Berlin, 1995, pp. 156-180.
21. K.L. Clark, Negation as failure, in: H. Gallaire, J. Minker (Eds.), Logic and Data-Bases, Plenum Press, New York, 1978, pp. 293-322.
22. W. Chen, T. Swift, D.S. Warren, Efficient top-down computation of queries under the well-founded semantics, Journal of Logic Programming 24 (3) (1995) 219-245.
23. W. Chen, D.S. Warren, A goal oriented approach to computing the well-founded semantics, Journal of Logic Programming 17 (1993) 279-300.
24. W. Chen, D.S. Warren, Computing of stable models and its integration with logical query processing, IEEE Transactions on Knowledge and Data Engineering 17 (1995) 279-300.
25. W. Chen, D.S. Warren, Tabled evaluation with delaying for general logic programs, Journal of the ACM 43 (1) (1996) 20-74.
26. J. Dix, U. Furbach, I. Niemelä, Nonmonotonic reasoning: towards efficient calculi and implementations, in: A. Voronkov, A. Robinson (Eds.), Handbook of Automated Reasoning, Elsevier, Amsterdam, to appear.
27. J. Dix, A framework for representing and characterizing semantics of logic programs, in: B. Nebel, C. Rich, W. Swartout (Eds.), Proceedings of The Third International Conference on Principles of Knowledge Representation and Reasoning (KR '92), Morgan Kaufmann, San Mateo, CA, 1992, pp. 591-602.
28. J. Dix, A classification-theory of semantics of normal logic programs: I. Strong properties, Fundamenta Informaticae XXII (3) (1995) 227-255.
29. J. Dix, A classification-theory of semantics of normal logic programs: II. Weak properties, Fundamenta Informaticae XXII (3) (1995) 257-288.
30. J. Dix, Semantics of logic programs: their intuitions and formal properties. An overview, in: A. Fuhrmann, H. Rott (Eds.), Logic, Action and Information - Essays on Logic in Philosophy and Artificial Intelligence, De Gruyter, Berlin, 1995, pp. 241-327.
31. P.M. Dung, K. Kanchansut, A fixpoint approach to declarative semantics of logic programs, in: E.L. Lusk, R.A. Overbeek (Eds.), Proceedings of North American Conference Cleveland, Ohio, USA, MIT Press, Cambridge, MA, October 1989.
32. P.M. Dung, K. Kanchansut, A natural semantics for logic programs with negation, in: E.L. Lusk, R.A. Overbeek (Eds.), Proceedings of The Ninth Conference on Foundations of Software Technology and Theoretical Computer Science, Springer, Berlin, 1989.
33. J. Dix, M. Müller, Implementing semantics for disjunctive logic programs using fringes and abstract properties, in: L. Moniz Pereira, A. Nerode (Eds.), Logic Programming and Non-Monotonic Reasoning, Proceedings of The Second International Workshop, Lisbon, MIT Press, Cambridge, MA, July 1993, pp. 43-59.
34. J. Dix, M. Müller, An axiomatic framework for representing and characterizing semantics of disjunctive logic programs, in: Pascal Van Hentenryck (Ed.), Proceedings of The 11th Int. Conf. on Logic Programming, S. Margherita Ligure, MIT Press, Cambridge, MA, June 1994, pp. 303-322.
35. J. Dix, M. Müller, Partial evaluation and relevance for approximations of the stable semantics, in: Z.W. Ras, M. Zemankova (Eds.), Proceedings of The Eighth Int. Symp. on Methodologies for Intelligent Systems, Charlotte, NC, 1994, LNAI 869, Springer, Berlin, 1994, pp. 511-520.
36. J. Dix, M. Osorio, On well-behaved semantics suitable for aggregation, in: Jan Maluszynski (Ed.), Proceedings of The 1997 International Symposium on Logic Programming, MIT Press, Cambridge, MA, 1997, p. 505.
37. J. Dix, M. Osorio, Provability closures in logic programming, in: Instituto Politectico Nacional (Ed.), Proceedings of The International Symposium on Computer Science in Mexico, 1997, pp. 313-319.
38. J. Dix, F. Stolzenburg, A framework to incorporate nonmonotonic reasoning into constraint logic programming, Journal of Logic Programming 37 (1-3) (1998) 5-37 (Special Issue on Constraint Logic Programming, Guest Editors: K. Marriott, P. Stuckey).
39. J. Dix, F. Stolzenburg, A framework to incorporate nonmonotonic reasoning into constraint logic programming, Journal of Logic Programming 37 (1-3) (1998) 5-37 (Special Issue on Constraint Logic Programming, Guest Editors: K. Marriott, P. Stuckey).
40. M.C. Fitting, A Kripke-Kleene semantics of logic programs, Journal of Logic Programming 4 (1985) 295-312.
41. M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: R. Kowalski, K. Bowen (Eds.), The Fifth Conference on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1070-1080.
42. M. Gelfond, 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, Proceedings of The Seventh International Logic Programming Conference, Jerusalem, MIT Press, Cambridge, MA, 1990, pp. 579-597).
43. M. Gelfond, 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, Proceedings of The Seventh International Logic Programming Conference, Jerusalem, MIT Press, Cambridge, MA, 1990, pp. 579-597).
44. M. Gelfond, H. Przymusinska, T. Przymusinski, The extended closed world assumption and its relationship to parallel circumscription, in: Proceedings of The Seventh Symposium on Principles of Database Systems, 1988.
45. M. Gelfond, H. Przymusinska, T. Przymusinski, On the relationship between CWA, minimal model and minimal Herbrand model semantics, International Journal of Intelligent Systems 5 (5) (1990) 549-564.
46. Y. Hu, L. Yan Yuan, Extended well-founded model semantics for general logic programs, in: K. Furukawa (Ed.), Proceedings of The Eighth Int. Conf. on Logic Programming, Paris, MIT Press, Cambridge, MA, June 1991, pp. 412-425.
47. D.B. Kemp, P.J. Stuckey, D. Srivastava, Magic sets and bottom-up evaluation of well-founded models, in: V. Saraswat, K. Ueda (Eds.), Proceedings of The 1991 Int. Symposium on Logic Programming, MIT Press, Cambridge, MA, June 1991, pp. 337-351.
48. J. Minker, On indefinite databases and the closed world assumption, in: Proceedings of The Sixth Conference on Automated Deduction, New York, Springer, Berlin, 1982, pp. 292-308.
49. J. Minker, A. Rajasekar, A fixpoint semantics for disjunctive logic programs, Journal of Logic Programming 9 (1990) 45-74.
50. I. Niemelä, P. Simons, Efficient implementation of the well-founded and stable model semantics, in: M. Maher (Ed.), Proceedings of The Joint International Conference and Symposium on Logic Programming, Bonn, Germany, MIT Press, Cambridge, MA, September 1996, pp. 289-303.
51. T. Przymusinski, Semantics of disjunctive logic programs and deductive databases, in: C. Delobel, M. Kifer, Y. Masunaga (Eds.), Deductive and Object-Oriented Databases, Second Int. Conf. (DOOD'91), LNCS 566, Springer, Berlin, 1991, pp. 85-107.
52. T. Przymusinski, Stable semantics for disjunctive programs, New Generation Computing Journal 9 (1991) 401-424 (Extended abstract appeared in: Extended stable semantics for normal and disjunctive logic programs, Proceedings of The Seventh International Logic Programming Conference, Jerusalem, MIT Press, Cambridge, MA, 1990, pp. 459-477).
53. T. Przymusinski, Stable semantics for disjunctive programs, New Generation Computing Journal 9 (1991) 401-424 (Extended abstract appeared in: Extended stable semantics for normal and disjunctive logic programs, Proceedings of The Seventh International Logic Programming Conference, Jerusalem, MIT Press, Cambridge, MA, 1990, pp. 459-477).
54. T. Przymusinski, Static semantics for normal and disjunctive logic programs, Annals of Mathematics and Artificial Intelligence 14 (1995) 323-357.
55. A. Rajasekar, J. Lobo, J. Minker, Weak generalized closed world assumption, Journal of Automated Reasoning 5 (1989) 293-307.
56. K.A. Ross, The well-founded semantics for disjunctive logic programs, in: Proceedings of The First International Conference on Deductive and Object Oriented Databases, Kyoto, Japan, 1989, pp. 1-22.
57. K.A. Ross, R.A. Topor, Inferring negative information from disjunctive databases, Journal of Automated Reasoning 4 (1988) 397-424.
58. J.S. Schlipf, Formalizing a logic for logic programming, Annals of Mathematics and Artificial Intelligence 5 (1992) 279-302.
59. J.S. Schlipf, The expressive powers of the logic programming semantics, Journal of Computer and System Sciences 5 (1) (1995) 64-86.
60. V.S. Subrahmanian, Nau, Vago, WFS + Branch and Bound = Stable Models, IEEE Transactions on Knowledge and Data Engineering 17 (3) (1995) 362-377.
61. C. Sakama, H. Seki, Partial deduction of disjunctive logic programs: a declarative approach, in: Logic Program Synthesis and Transformation - Meta Programming in Logic, LNCS 883, Springer, Berlin, 1994, pp. 170-182.
62. C. Sakama, H. Seki, Partial deduction in disjunctive logic programming, Journal of Logic Programming 32 (3) (1997) 229-245.
63. A. Van Gelder, The alternating fixpoint of logic programs with negation, in: Proc. of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, Pennsylvania, ACM Press, New York, March 1989, pp. 1-10.
64. A. Van Gelder, K.A. Ross, J.S. Schlipf, The well-founded semantics for general logic programs, Journal of the ACM 38 (1991) 620-650.
65. U. Zukowski, S. Brass, B. Freitag, Improving the alternating fixpoint: the transformation approach, in: J. Dix, U. Furbach, A. Nerode (Eds.), Proc. of The Fourth Int. Conf. on Logic Programming and Non-Monotonic Reasoning (LPNMR'97), LNAI 1265, Springer, Berlin, 1997, pp. 40-59.