Alternating fixpoint theory for logic programs with priority

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

Volumn 1861, Issue , 2000, Pages 164-178

  Wang, Kewen ^a   Zhou, Lizhu ^a   Lin, Fangzhen ^b  

^a TSINGHUA UNIVERSITY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

answer sets; Logic programs; alternating fixpoints; priority; well founded model

Indexed keywords

ANSWER SET; FIXPOINTS; LOGIC PROGRAMS; PRIORITY; WELL-FOUNDED MODELS;

SEMANTICS;

LOGIC PROGRAMMING;

EID: 84867764884     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_11     Document Type: Conference Paper

References (28)

1. A. Analyti, S. Pramanik. Reliable semantics for extended logic programs with rule prioritization. Journal of Logic and Computation, 303-325, 1995.
2. K. Apt, H. B lair and A. Walker. Towards a theory of declarative knowledge. In: J. Minker ed. Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Washington, pages 89-148, 1988.
3. F. Badder, B. Hollunder. Priorities on defaults with prerequisites, and their application in treating speci-city in terminological default logic. Journal of Automated Reasoning, 15(1), 41-68, 1995.
4. C. Baral, J. Lobo. Defeasible speci-cations in action theories. In: Proceedings of IJCAI'97, Morgan Kaufmann, pages 1441-1446, 1997.
5. G. Brewka. Well-founded semantics for extended logic programs with dynamic preferences. J. AI Research, 4: 19-36, 1996.
6. G. Brewka, T. Either. Preferred answer sets for extended logic programs, Artificial Intelligence, 109(1-2), 295-356, 1999.
7. J. Delgrade, T. Schaub. Compiling reasoning with and about preferences in default logic. In: Proc. IJCAI'97, pages 168-174, 1997.
8. D. Gabbay, E. Laenens and D. Vermeir. Credulous vs. skepti cal semantics for ordered logic programs. In: Proc. KR'92, pages 208-217, 1992.
9. M. Gelfond, V. Lifschitz. The stable model semantics for logic programming, in Logic Programming: Proc. Fifth Intl Conference and Symposium, pages 1070-1080, MIT Press, 1988.
10. M. Gelfond, V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9: 365-386, 1991.
11. M. Gelfond,T. Son. Reasoning with prioritized defaults. In Proc. LPKR'97 (LNAI1471 Springer, 164-233, 1998.
12. E. Laenens, D. Vermeir. A-xpoint semantics for ordered logic. Journal of Logic and Computation, 1:159-185, 1990.
13. F. Lin. Embracing causality in specifying the indirect e-ects of actions. In: Proc. IJCAI'95, pages 1985-1991, 1995.
14. W. Marek, A. Nerode and J. B. Remmel. Basic forward chaining construction for logic programs. In Logic Foundations of Computer Science (LNCS 1234), Springer, 1997.
15. W. Marek, A. Nerode and J. B. Remmel. Logic programs, well-ordering, and forward chaining. Journal of Pure and Applied Logic, 96(1-3):231-76, 1999.
16. W. Marek, M. Truszczynski. Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, Springer, pages 375-398, 1999.
17. J. McCarthy, P. Hayes. Some philosophical problems from the standpoint of arti--cial intelligence. In: B. Meltzer and D. Michie eds. Machine Intelligence, vol.4, pages 463-502, 1969.
18. I. Niemelä. Lo gic programs with stable model semantics as a constraint programming paradigm. In: Proc. the Workshop on Computational Aspects of Nonmono-tonic Reasoning, pages 72-79, 1998.
19. H. Prakken, G. Sartor. Argume nt-based logic programming with defeasible priorities. J. Applied Non-Classical Logics, 7: 25-75, 1997.
20. T. Przymusinski. On the declarative semantics of deductive databases and logic programming. In: J. Minker ed. Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Washington, pages 193-216, 1988.
21. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1-2), 81-132, 1980.
22. C. Sakama, K. Inoue. Representing priorities in logic programs. In: Proc. IJC-SLP'96, MIT Press, pages 82-96, 1996.
23. A. Van Gelder. The alternating-xpoint of logic programs with negation. Journal of Computer and System Science, 47: 185-120, 1993.
24. K. Wang. Argumentation-based abduction in disjunctive logic programming. Jour-nal Logic Programming (47 pages, to appear), 2000.
25. K. Wang, L. Zhou and F. Lin. A semantic framework for prioritized logic programs and its application to causal theories. Tech. report TUCS-9906, 1999.
26. J. You, L. Yuan. Three-valued semantics of logic programming: is it needed? In Proc. the 9th ACM PODS, pages 172-182, 1990.
27. J. You, X. Wa ng and L. Yuan. Disjunctive logic programming as constrained inferences. In: Proc. ICLP'97, MIT Press, 1997.
28. Y. Zhang, N. Foo. Answer sets for prioritized logic programs. In: Proc. the 1997 International Symposium on Logic Programming, MIT Press, pages 69-83, 1997.