A Knowledge Representation Framework Based on Epistemic Logic

• Autorzy: Przymusiński T.
• Języki publikacji: EN

Abstrakty

EN

We introduce a uniform non-monotonic framework for knowledge representation based on epistemic logic which is sufficiently general to encompass several nonmonotonic formalisms, including circumscription, autoepistemic logic, various semantics proposed for logic programs and deductive databases (stable semantics, well-founded semantics and stationary semantics) as well as Gelfond’s epistemic specifications. The existence of such a uniform framework allows us not only to provide simpler and perhaps more natural definitions of various formalisms but it also enables us to better understand mutual relationships existing between them.

Słowa kluczowe

EN

non-monotonic reasoning; semantics of logic programs; disjunctive logic programs; deductive databases

• Wydawca: Warszawska Wyższa Szkoła Informatyki
• Czasopismo: Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
• Rocznik: 2014
• Tom: nr 11
• Strony: 41--53
• Opis fizyczny: Bibliogr. 21 poz., rys., tab., wykr

Twórcy

autor

Przymusiński T.

• University of California at Riverside, USA
• Warsaw School of Computer Science, Poland

Bibliografia

• [1] R.C. Moore. Semantic considerations on non-monotonic logic. Journal of Artificial Intelligence, 25:75-94, 1985.
• [2] J. McCarthy. Circumscription – a form of non-monotonic reasoning. Journal of Artificial Intelligence, 13:27–39, 1980.
• [3] R. Reiter. On closed-world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 55–76. Plenum Press, New York, 1978.
• [4] J. Minker. On indefinite data bases and the closed world assumption. In Proc. 6-th Conference on Automated Deduction, pages 292–308, New York, 1982. Springer Verlag.
• [5] M. Gelfond, H. Przymusinska, and T. Przymusinski. On the relationship between circumscription and negation as failure. Journal of Artificial Intelligence, 38:75–94, 1989.
• [6] T. C. Przymusinski. Autoepistemic logics of closed beliefs and logic programming. In A. Nerode, W. Marek, and V.S. Subrahmanian, editors, Proceedings of the First International Workshop on Logic Programming and Non-monotonic Reasoning, Washington, D.C., July 1991, pages 3–20, Cambridge, Mass., 1991. MIT Press.
• [7] M. Gelfond. Logic programming and reasoning with incomplete information. Technical report, University of Texas at El Paso, 1992.
• [8] M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 1070-1080, Cambridge, Mass., 1988. Association for Logic Programming, MIT Press.
• [9] M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proceedings of the Seventh International Logic Programming Conference, Jerusalem, Israel, pages 579-597, Cambridge, Mass., 1990. Association for Logic Programming, MIT Press.
• [10] A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 1990. (to appear). Preliminary abstract appeared in Seventh ACM Symposium on Principles of Database Systems, March 1988, pp. 221–230.
• [11] T. C. Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, 13(4):445-464, 1990.
• [12] T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing Journal, 9:401-424, 1991. (Extended abstract appeared in: Extended stable semantics for normal and disjunctive logic programs. Proceedings of the 7-th International Logic Programming Conference, Jerusalem, pages 459-477, 1990. MIT Press.).
• [13] T. C. Przymusinski. Semantics of disjunctive logic programs and deductive databases. In C. Delobel, M. Kifer, and Y. Masunaga, editors, Proceedings of the Second International Conference on Deductive and Object-Oriented Databases DOOD’81, pages 85-107, Munich, Germany, 1991. Springer Verlag.
• [14] R. Reiter. A logic for default theory. Journal of Artificial Intelligence, 13:81-132, 1980
• [15] H. Przymusinska and T. C. Przymusinski. Stationary extensions of default theories. Fundamenta Informaticae, page (In print.), 1992. Special issue devoted to the Fourth Workshop on Non-monotonic Reasoning, Plymouth, Vermont, 1992.
• [16] L. Yuan and J. You. Autoepistemic circumscription and logic programming. Technical Report TR92-18, Dept. of Computing Science, Univerisity of Alberta, 1992.
• [17] V. Lifschitz. Between circumscription and autoepistemic logic. Research report, Stanford University, 1989.
• [18] L.M. Pereira, J.A. Aparicio, and J.J. Alferes. Non-monotonic reasoning with well-founded semantics. In Proceedings of the Eigth International Logic Programming Conference, Paris, France, pages 475-489, Cambridge, Mass., 1991. Association for Logic Programming, MIT Press.
• [19] J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT Press, Cambridge, Massachusetts, 1992.
• [20] J. Minker and A. Rajasekar. A fixpoint semantics for disjunctive logic programs. Journal of Logic Programming, page (to appear), 1990.
• [21] A. Rajasekar, J. Lobo, and J. Minker. Weak generalized closed world assumption. Journal of Automated Reasoning, 5:293-307, 1989.