Towards a systematic account of different logic programming semantics

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2821, Issue , 2003, Pages 105-119

  Hitzler, Pascal ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER SCIENCE; COMPUTER SOFTWARE; KNOWLEDGE REPRESENTATION; MATHEMATICAL OPERATORS; SEMANTICS; SET THEORY; THEOREM PROVING; ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING;

CIRCULAR WELL-FOUNDED MODEL; FITTING SEMANTICS; FOUR-VALUED LOGIC; WELL-FOUNDED SEMANTICS; DECLARATIVE SEMANTICS; LOGIC PROGRAMMING SEMANTICS; LOGIC PROGRAMS; WELL FOUNDED SEMANTICS;

LOGIC PROGRAMMING; SEMANTICS;

EID: 9444236704     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39451-8_9     Document Type: Conference Paper

References (24)

1. Hitzler, P., Wendt, M.: The well-founded semantics is a stratified Fitting semantics. In Jarke, M., Koehler, J., Lakemeyer, G., eds.: Proceedings of the 25th Annual German Conference on Artificial Intelligence, KI2002, Aachen, Germany, September 2002. Volume 2479 of Lecture Notes in Artificial Intelligence., Springer, Berlin (2002) 205-221
2. Hitzler, P., Wendt, M.: A uniform approach to logic rogramming semantics. Technical Report WV-02-14, Knowledge Representation and Reasoning Group, Artificial Intelligence Institute, Department of Computer Science, Dresden University of Technology, Dresden, Germany (2002) Submitted.
3. Reiter, R.: A logic for default reasoning. Artificial Intelligence 13 (1980) 81-132
4. Lloyd, J.W.: Foundations of Logic Programming. Springer, Berlin (1988)
5. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In Kowalski, R.A., Bowen, K.A., eds.: Logic Programming. Proceedings of the 5th International Conference and Symposium on Logic Programming, MIT Press (1988) 1070-1080
6. van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM 38 (1991) 620-650
7. Fitting, M.: A Kripke-Kleene-semantics for general logic programs. The Journal of Logic Programming 2 (1985) 295-312
8. Apt, K.R., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In Minker, J., ed.: Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, Los Altos, CA (1988) 89-148
9. Przymusinski, T.C.: On the declarative semantics of deductive databases and logic programs. In Minker, J., ed.: Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, Los Altos, CA (1988) 193-216
10. Fitting, M.: Fixpoint semantics for logic programming - A survey. Theoretical Computer Science 278 (2002) 25-51
11. Denecker, M., Marek, V.W., Truszczynski, M.: Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning. In Minker, J., ed.: Logic-based Artificial Intelligence. Kluwer Academic Publishers, Boston (2000) 127-144
12. Przymusinski, T.C.: Well-founded semantics coincides with three-valued stable semantics. Fundamenta Informaticae 13 (1989) 445-464
13. van Gelder, A.: The alternating fixpoint of logic programs with negation. In: Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Philadelphia, Pennsylvania, ACM Press (1989) 1-10
14. Dung, P.M., Kanchanasut, K.: A fixpoint approach to declarative semantics of logic programs. In Lusk, E.L., Overbeek, R.A., eds.: Logic Programming, Proceedings of the North American Conference 1989, NACLP'89, Cleveland, Ohio, MIT Press (1989) 604-625
15. Fages, F.: Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science 1 (1994) 51-60
16. Wendt, M.: Unfolding the well-founded semantics. Journal of Electrical Engineering, Slovak Academy of Sciences 53 (2002) 56-59 (Proceedings of the 4th Slovakian Student Conference in Applied Mathematics, Bratislava, April 2002).
17. Hitzler, P.: Circular belief in logic programming semantics. Technical Report WV-02-13, Knowledge Representation and Reasoning Group, Artificial Intelligence Institute, Department of Computer Science, Dresden University of Technology, Dresden, Germany (2002)
18. Jachymski, J.: Order-theoretic aspects of metric fixed-point theory. In Kirk, W.A., Sims, B., eds.: Handbook of Metric Fixed Point Theory. Kluwer Academic Publishers, Dordrecht, The Netherlands (2001) 613-641
19. Fitting, M.: Bilattices and the semantics of logic programming. The Journal of Logic Programming 11 (1991) 91-116
20. Abramsky, S., Jung, A.: Domain theory. In Abramsky, S., Gabbay, D., Maibaum, T.S., eds.: Handbook of Logic in Computer Science. Volume 3. Clarendon, Oxford (1994)
21. Przymusinska, H., Przymusinski, T.C.: Weakly stratified logic programs. Fundamenta Informaticae 13 (1990) 51-65
22. Wang, K.: A comparative study of well-founded semantics for disjunctive logic programs. In Eiter, T., Faber, W., Truszczynski, M., eds.: Logic Programming and Nonmonotonic Reasoning, 6th International Conference, LPNMR 2001, Vienna, Austria, September 17-19, 2001, Proceedings. Volume 2173 of Lecture Notes in Artificial Intelligence., Springer (2001) 133-146
23. Mateis, C.: Quantitative disjunctive logic programming: Semantics and computation. AI communications 13 (2000) 225-248
24. Leite, J.A.: Evolving Knowledge Bases. Volume 81 of Frontiers of Artificial Intelligence and Applications. IOS Press (2003)