Ultimate approximation and its application in nonmonotonic knowledge representation systems

Information and Computation

Volumn 192, Issue 1, 2004, Pages 84-121

  Denecker, Marc ^a,b   Marek, Victor W ^c   Truszczyński, Mirosław ^c  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c UNIVERSITY OF KENTUCKY   (United States)

Author keywords

Approximation; Bilattices; Knowledge representation

Indexed keywords

ALGEBRA; APPROXIMATION THEORY; ITERATIVE METHODS; LOGIC PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SEMANTICS;

APPROXIMATING OPERATORS; BILATTICES; DECLARATIVE PROGRAMMING; MONOTONE OPERATORS;

INFORMATION ANALYSIS;

EID: 3042612062     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.02.004     Document Type: Article

References (32)

1. Aczel P. An introduction to inductive definitions. Barwise J. Handbook of Mathematical Logic. 1977;739-782 North-Holland, Amsterdam.
2. Apt K.R., van Emden M.H. Contributions to the theory of logic programming. Journal of the ACM. 29:(3):1982;841-862.
3. Baral C., Subrahmanian V.S. Dualities between alternative semantics for logic programming and nonmonotonic reasoning. Nerode A., Marek W., Subrahmanian V.S. Logic Programming and Non-monotonic Reasoning. 1991;69-86 MIT Press, Cambridge, MA.
4. Clark K.L. Negation as failure. Gallaire H., Minker J. Logic and Data Bases:1978;293-322 Plenum Press, New York.
5. Denecker M. The well-founded semantics is the principle of inductive definition. Dix J., Fariñas del Cerro L., Furbach U. Logics in Artificial Intelligence, Lecture Notes in Computer Science. vol. 1489:1998;1-16 Springer-Verlag, Berlin.
6. Denecker M., Marek V., Truszczyński M. Fixpoint 3-valued semantics for autoepistemic logic. Levesque H.J., Pirri F. Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter. 1999;113-136 Springer-Verlag, Berlin.
7. Denecker M., Marek V., Truszczyński M. Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. Minker J. Logic-Based Artificial Intelligence. 2000;127-144 Kluwer Academic Publishers, Dordrecht.
8. Denecker M., Marek V., Truszczyński M. Unified semantic treatment of default and autoepistemic logics. Cohn A.G., Giunchiglia F., Selman B. Principles of Knowledge Representation and Reasoning, Proceedings of the Seventh International Conference (KR2000). 2000;74-84 Morgan Kaufmann Publishers, Los Altos, CA.
9. Denecker M., Bruynooghe M., Marek V. Logic programming revisited: logic programs as inductive definitions. ACM Transactions on Computational Logic. 2:(4):2001;623-654.
10. Denecker M., Marek V., Truszczyński M. Ultimate approximations in nonmonotonic knowledge representation systems. Fensel D., Giunchiglia F., McGuiness D., Williams M-A. Principles of Knowledge Representation and Reasoning, Proceedings of the Eighth International Conference (KR2002). 2002;177-188 Morgan Kaufmann Publishers, Los Altos, CA.
11. Denecker M., Marek V., Truszczyński M. Uniform semantic treatment of default and autoepistemic logics. Artificial Intelligence Journal. 143:2003;79-122.
12. Denecker M., Pelov N., Bruynooghe M. Well-founded and stable semantics for logic programs with aggregates. Codognet Ph. Logic programming, Proceedings of the 2001 International Conference on Logic Programming, Lecture Notes in Computer Science. vol. 2237:2001;212-226 Springer-Verlag, Berlin.
13. Fitting M.C. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming. 2:(4):1985;295-312.
14. Fitting M.C. Bilattices and the semantics of logic programming. Journal of Logic Programming. 11:1991;91-116.
15. Fitting M.C. Tableaux for logic programming. Journal of Automated Reasoning. 13:1994;175-188.
16. Fitting M.C. Fixpoint semantics for logic programming - a survey. Theoretical Computer Science. 278:2002;25-51.
17. Ginsberg M.L. Multivalued logics: a uniform approach to reasoning in artificial intelligence. Computational Intelligence. 4:1988;265-316.
18. Gelfond M., Lifschitz V. The stable semantics for logic programs. Kowalski R., Bowen K. Proceedings of the 5th International Conference on Logic Programming. 1988;1070-1080 MIT Press, Cambridge, MA.
19. Konolige K. On the relation between default and autoepistemic logic. Artificial Intelligence Journal. 35:(3):1988;343-382.
20. Kunen K. Negation in logic programming. Journal of Logic Programming. 4:(4):1987;289-308.
21. Lifschitz V. On open defaults. Lloyd J. Proceedings of the Symposium on Computational Logic. 1990;80-95 Springer-Verlag, Berlin.
22. Markowsky G. Chain-complete posets and directed sets with applications. Algebra Universalis. 6:(1):1976;53-68.
23. R.C. Moore, Possible-world semantics for autoepistemic logic, in: Proceedings of the Workshop on Non-Monotonic Reasoning, 1984, pp. 344-354. Reprinted in: M. Ginsberg (ed.), Readings on Nonmonotonic Reasoning, pp. 137-142, Morgan Kaufmann Publishers, Los Altos, 1990.
24. R.C. Moore, Possible-world semantics for autoepistemic logic, in: Proceedings of the Workshop on Non-Monotonic Reasoning, 1984, pp. 344-354. Reprinted in: M. Ginsberg (ed.), Readings on Nonmonotonic Reasoning, pp. 137-142, Morgan Kaufmann Publishers, Los Altos, 1990.
25. Marek W., Truszczyński M. Autoepistemic logic. Journal of the ACM. 38:(3):1991;588-619.
26. Przymusinski T.C. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae. 13:(4):1990;445-464.
27. Reiter R. A logic for default reasoning. Artificial Intelligence Journal. 13:(1-2):1980;81-132.
28. Tarski A. Lattice-theoretic fixpoint theorem and its applications. Pacific Journal of Mathematics. 5:1955;285-309.
29. Van Gelder A. The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences. 47:(1):1993;185-221.
30. van Emden M.H., Kowalski R.A. The semantics of predicate logic as a programming language. Journal of the ACM. 23:(4):1976;733-742.
31. van Fraassen B. Singular terms, truth-value gaps, and free logic. The Journal of Philosophy. 63:(17):1966;481-495.
32. Van Gelder A., Ross K.A., Schlipf J.S. The well-founded semantics for general logic programs. Journal of the ACM. 38:(3):1991;620-650.