A general theory of confluent rewriting systems for logic programming and its applications

Annals of Pure and Applied Logic

Volumn 108, Issue 1-3, 2001, Pages 153-188

  Dix, Jürgen ^a   Osorio, Mauricio ^b   Zepeda, Claudia ^c  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b UNIVERSIDAD DE LAS AMÉRICAS PUEBLA   (Mexico)

^c BENEMÉRITA UNIVERSIDAD AUTÓNOMA DE PUEBLA   (Mexico)

Author keywords

03B70; 68P15; 68T27; Aggregation; Databases; Logic in artificial intelligence; Logic programming; Nonmonotonic semantics; Theory of data

Indexed keywords

EID: 0011087828     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(00)00044-0     Document Type: Article

References (52)

1. K.R. Apt, V. Marek, M. Truszczynski, D.S. Warren (Eds.), The Logic Programming Paradigm: Current Trends and Future Directions, Springer, Berlin, 1999.
2. Baral C., Gelfond M. Logic programming and knowledge representation. J. Logic Programming. 19-20:1994;73-148.
3. Brass S., Dix J. A general approach to bottom-up computation of disjunctive semantics. Dix J., Pereira L., Przymusinski T. Nonmonotonic Extensions of Logic Programming, Lecture Notes in Artificial Intelligence. vol. 927:1995;127-155 Springer, Berlin.
4. S. Brass, J. Dix, Characterizations of the disjunctive stable semantics by partial evaluation, J. Logic Programming 32(3) (1997) 207-228 (Extended abstract appeared in: Characterizations of the stable semantics by partial evaluation LPNMR, Proc. 3rd Internat. Conf., Kentucky, Lecture Notes in Computer Science, vol. 928, Springer, Berlin, 1995, pp. 85-98).
5. S. Brass, J. Dix, Characterizations of the disjunctive stable semantics by partial evaluation, J. Logic Programming 32(3) (1997) 207-228 (Extended abstract appeared in: Characterizations of the stable semantics by partial evaluation LPNMR, Proc. 3rd Internat. Conf., Kentucky, Lecture Notes in Computer Science, vol. 928, Springer, Berlin, 1995, pp. 85-98).
6. S. Brass, J. Dix, Characterizations of the disjunctive well-founded semantics: confluent calculi and iterated GCWA, J. Automat. Reason. 20(1) (1998) 143-165 (Extended abstract appeared in: Characterizing D-WFS: confluence and iterated GCWA, Logics in Artificial Intelligence, JELIA '96, Lecture Notes in Computer Science, vol. 1126, Springer, Berlin, 1996, pp. 268-283).
7. S. Brass, J. Dix, Characterizations of the disjunctive well-founded semantics: confluent calculi and iterated GCWA, J. Automat. Reason. 20(1) (1998) 143-165 (Extended abstract appeared in: Characterizing D-WFS: confluence and iterated GCWA, Logics in Artificial Intelligence, JELIA '96, Lecture Notes in Computer Science, vol. 1126, Springer, Berlin, 1996, pp. 268-283).
8. S. Brass, J. Dix, Semantics of (disjunctive) logic programs based on partial evaluation, J. Logic Programming 38(3) (1999) 167-213 (Extended abstract appeared in: Disjunctive semantics based upon partial and bottom-up evaluation, Proc. 12th Internat. Logic Programming Conf., Tokyo, MIT Press, Cambridge, MA, 1995, pp. 199-213.).
9. S. Brass, J. Dix, Semantics of (disjunctive) logic programs based on partial evaluation, J. Logic Programming 38(3) (1999) 167-213 (Extended abstract appeared in: Disjunctive semantics based upon partial and bottom-up evaluation, Proc. 12th Internat. Logic Programming Conf., Tokyo, MIT Press, Cambridge, MA, 1995, pp. 199-213.).
10. S. Brass, J. Dix, B. Freitag, U. Zukowski, Transformation-based bottom-up computation of the well-founded model, Tech. Report TR 15/98, University of Koblenz, Department of Computer Science, Rheinau 1, August 1998. Currently under review for J. Logic Programming.
11. S. Brass, J. Dix, I. Niemelä, T. Przymusinski, On the equivalence of the static and disjunctive well-founded semantics and its computation, Theoret. Comput. Sci. (2001), to appear.
12. Brass S., Dix J., Przymusinski T. Computation of the semantics of autoepistemic belief theories. Artificial Intelligence. 112(1-2):1999.
13. Brass S., Zukowski U., Freitag B. Transformation based bottom-up computation of the well-founded model. Dix J., Pereira L., Przymusinski T. Nonmonotonic Extensions of Logic Programming, Lecture Notes in Artificial Intelligence. vol. 1216:1997;171-201 Springer, Berlin.
14. G. Brewka, J. Dix, Knowledge representation with logic programs, in: J. Dix, L. Pereira, T. Przymusinski (Eds.), Logic Programming and Knowledge Representation, Lecture Notes in Artificial Intelligence, vol. 1471, Springer, Berlin, 1998, pp. 1-55. Full version will appear as in Handbook of Philosophical Logic, 2nd ed., Methodologies, vol. 6, 2001 (Chapter 6).
15. G. Brewka, J. Dix, Knowledge representation with logic programs, in: J. Dix, L. Pereira, T. Przymusinski (Eds.), Logic Programming and Knowledge Representation, Lecture Notes in Artificial Intelligence, vol. 1471, Springer, Berlin, 1998, pp. 1-55. Full version will appear as in Handbook of Philosophical Logic, 2nd ed., Methodologies, vol. 6, 2001 (Chapter 6).
16. G. Brewka, J. Dix, Knowledge representation with extended logic programs. in: D. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, 2nd ed., Methodologies, vol. 6, Reidel Publ., Dordrecht, 2000, Ch. 6. Shortened version also appeared in: Dix, Pereira, Przymusinski (Eds.), Logic Programming and Knowledge Representation, Lecture Notes in Artificial Intelligence, vol. 1471, Springer, Berlin, 1998, pp. 1-55.
17. G. Brewka, J. Dix, Knowledge representation with extended logic programs. in: D. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, 2nd ed., Methodologies, vol. 6, Reidel Publ., Dordrecht, 2000, Ch. 6. Shortened version also appeared in: Dix, Pereira, Przymusinski (Eds.), Logic Programming and Knowledge Representation, Lecture Notes in Artificial Intelligence, vol. 1471, Springer, Berlin, 1998, pp. 1-55.
18. Brewka G., Dix J., Konolige K. Nonmonotonic Reasoning. erview, CSLI Lecture Notes vol. 73:1997;CSLI Publications, Stanford, CA.
19. Clark K.L. Negation as failure. Gallaire H., Minker J. Logic and Data-Bases. 1978;293-322 Plenum, New York.
20. Dix J. A framework for representing and characterizing semantics of logic programs. B. Nebel B., Rich C., Swartout W. Principles of Knowledge Representation and Reasoning. Proc. 3rd Internat. Conf. (KR '92):1992;591-602 Morgan Kaufmann, San Mateo, CA.
21. Dix J. A classification-theory of semantics of normal logic programs. I. Strong properties Fund. Inform. XXII(3):1995;227-255.
22. Dix J. A classification-theory of semantics of normal logic programs. II. Weak properties Fund. Inform. XXII(3):1995;257-288.
23. J. Dix, The logic programming paradigm, AI Commun. 11(3) (1998) 39-43. Short version in Newslett. ALP 11(3) (1998) 10-14.
24. J. Dix, The logic programming paradigm, AI Commun. 11(3) (1998) 39-43. Short version in Newslett. ALP 11(3) (1998) 10-14.
25. Dix J., Furbach U., Niemelä I. Nonmonotonic reasoning: towards efficient calculi and implementations. Voronkov A., Robinson A. Handbook of Automated Reasoning. 2001;Elsevier Science Press, Amsterdam.
26. Dix J., Müller M. Partial evaluation and relevance for approximations of the stable semantics. Ras Z.W., Zemankova M. Proc. 8th Internat. Symp. on Methodologies for Intelligent Systems, Charlotte, NC, 1994, Lecture Notes in Artificial Intelligence. vol. 869:1994;511-520 Springer, Berlin.
27. Dix J., Müller M. The stable semantics and its variants. a comparison of recent approaches Dreschler-Fischer L., Nebel B. Proc. 18th German Annual Conf. on Artificial Intelligence (KI '94), Saarbrücken, Germany, Lecture Notes on Artificial Intelligence. vol. 861:1994;82-93 Springer, Berlin.
28. Dix J., Osorio M. On well-behaved semantics suitable for aggregation. Maluszynski J. Logic Programming. Proc. 1997 Internat. Symp. 1997;505 MIT Press, Cambridge, MA.
29. J. Dix, M. Osorio, Provability closures in logic programming, Proc. Internat. Symp. on Computer Science in Mexico, Instituto Politectico Nacional, 1997, pp. 313-319.
30. J. Dix, M. Osorio, Towards well-behaved semantics suitable for aggregation, Tech. Report TR 11/97, University of Koblenz, Department of Computer Science, Rheinau 1, April 1997. Accepted at ILPS '97 as poster paper.
31. Dix J., Osorio M. Confluent rewriting systems in non-monotonic reasoning. Comput. Sistemas. II(2-3):1999;104-123.
32. Dix J., Stolzenburg F. A framework to incorporate nonmonotonic reasoning into constraint logic programming. J. Logic Programming. 37((1,2,3)):1998;47-76. (Special Issue on Constraint Logic Programming, Guest Editors: K. Marriott, P. Stuckey).
33. Fitting M.C. A Kripke-Kleene semantics of logic programs. J. Logic Programming. 4:1985;295-312.
34. Fitting M.C. Partial models and logic programming. Theoret. Comput. Sci. 48:1986;229-255.
35. Gelfond M., Lifschitz V. The stable model semantics for logic programming. Kowalski R., Bowen K. 5th Conf. on Logic Programming. 1988;1070-1080 MIT Press, Cambridge, MA.
36. M. Gelfond, V. Lifschitz, Logic program with classical negation, in: D.H.D. Warren, P. Szeredi (Eds.), Proc. 7th Internat. Conf. on Logic Programming, MIT, June 1990, pp. 579-597.
37. D. Jana, B. Jayaraman, Set constructors, finite sets, and logical semantics, Tech. Report TR 94-030, Department of Computer Science, SUNY-Buffalo, August 1994.
38. Jayaraman B. Implementation of subset-equational programs. J. Logic Programming. 11(4):1992;299-324.
39. Jayaraman B., Osorio M., Moon K. Partial order programming (revisited). Nivat M., Alagar V.S. Proc. AMAST, Lecture Notes in Computer Science. vol. 936:1995;561-575 Springer, Berlin.
40. Lloyd J.W. Foundations of Logic Programming. 2nd ed. 1987;Springer, Berlin.
41. K. Moon, Implementation of subset logic languages, Ph.D. Thesis, Department of Computer Science, SUNY-Buffalo, 1997.
42. I. Niemelä, P. Simons, Efficient implementation of the well-founded and stable model semantics, in: M. Maher (Ed.), Proc. Joint Internat. Conf. and Symp. on Logic Programming, Bonn, Germany, The MIT Press, Cambridge, MA, September 1996, pp. 289-303.
43. Osorio M., Jayaraman B. Integrating the completion and the well-founded semantics. Coelho H. Proc. Iberamia '98, Lecture Notes in Artificial Intelligence. vol. 1484:1998;230-241 Springer, Berlin.
44. Osorio M., Jayaraman B. Aggregation and negation-as-failure. New Generation Comput. 17(3):1999;255-284.
45. Osorio M., Jayaraman B., Nieves J.C. Declarative pruning in a functional query language. de Schreye D. Proc. ICLP '99. 1999;MIT Press, Cambridge, CA.
46. Osorio M., Jayaraman B., Plaisted D. Theory of partial-order programming. Sci. Comput. Programming. 34(3):1999;207-238.
47. D. Sacca, C. Zaniolo, Partial models and three-valued models in logic programs with negation, in: A. Nerode, W. Marek, V.S. Subrahmanian (Eds.), Logic Programming and Non-Monotonic Reasoning, Proc. 1st Internat. Workshop, MIT Press, Washington DC, Cambridge, MA, July 1991, 87-104.
48. Schlipf J.S. Formalizing a logic for logic programming. Ann. Math. Artificial Intelligence. 5:1992;279-302.
49. Van Gelder A. The well-founded semantics of aggregation, Proc. 11th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, San Diego, USA. 1992;127-138 ACM Press, New York.
50. A. Van Gelder, K.A. Ross, J.S. Schlipf, Unfounded sets and well-founded semantics for general logic programs, Proc. 7th Symp. on Principles of Database Systems, 1988, pp. 221-230.
51. Van Gelder A., Ross K.A., Schlipf J.S. The well-founded semantics for general logic programs. J. ACM. 38:1991;620-650.
52. C. Zepeda, Semanticas Bien Fundamentadas, Tech. Report, Department of Computer Science, UDLA, December 1997.