Computing preferred answer sets in answer set programming

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

Volumn 2850, Issue , 2003, Pages 259-273

  Wakaki, Toshiko ^a   Inoue, Katsumi ^b   Sakama, Chiaki ^c   Nitta, Katsumi ^d  

^a SHIBAURA INSTITUTE OF TECHNOLOGY   (Japan)

^b KOBE UNIVERSITY   (Japan)

^c WAKAYAMA UNIVERSITY   (Japan)

^d TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; COMPUTER PROGRAMMING; SEMANTICS; ALGORITHMS; LOGIC PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; THEOREM PROVING;

ANSWER SET PROGRAMMING; DECLARATIVE SEMANTICS; NON-MONOTONIC REASONING; PREFERENCE ABDUCTION; PRIORITIZED LOGIC PROGRAMS; PRIORITY KNOWLEDGE; PROGRAM TRANSFORMATIONS; SOUND AND COMPLETE;

LOGIC PROGRAMMING; SET THEORY;

ANSWER SET PROGRAMMING (ASP); GENERAL EXTENDED DISJUNCTIVE LOGIC PROGRAM (GEDP); LOGIC PROGRAMS; PRIORTIZED LOGIC PROGRAMS (PLP);

EID: 9444247029     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39813-4_18     Document Type: Conference Paper

References (19)

1. G. Brewka, I. Niemelä and T. Syrjänen: Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs, Proc. 8th European Conference on Logics in Artificial Intelligence (JELIA'02), LNAI 2424, Springer (2002) 445-455.
2. G. Brewka and T. Eiter: Preferred Answer Sets for Extended Logic Programs, Artificial Intelligence 109 (1999) 297-356.
3. G. Brewka: Well-founded Semantics for Extended Logic Programs with Dynamic Preferences, Journal of Artificial Intelligence Research 4 (1996) 19-36.
4. J. P. Delgrande and T. Schaub T: Expressing Preferences in Default Logic, Artificial Intelligence 123 (2000) 41-87.
5. J. P. Delgrande, T. Schaub and H. Tompits: A Framework for Compiling Preferences in Logic Programs, Theory and Practice of Logic Programming 3(2) (2003) 129-187.
6. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, F. Scarcello: A deductive system for nonmonotonic reasoning, Proc. LPNMR-97, LNCS 1265, Springer (1997) 364-375.
7. M. Gelfond and V. Lifschitz: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9 (1991) 365-385.
8. Gelfond, M. and Lifschitz, V.: Compiling Circumscriptive Theories into Logic Programs, Proc. AAA1-88, 455-459.
9. Extended version in: Proc. 2nd Int. Workshop on Nonmonotonic Reasoning, LNAI 346 (1988) 74-99.
10. T. F. Gorden: The Pleadings Game: An Artifical Intelligence Model of Procedural Justice. Ph.D. thesis, TU Darmstadt (1993).
11. K. Inoue, M. Koshimura and R. Hasegawa: Embedding negation as failure into a model generation theorem prover, In: Deepak Kapur, editor, Proceedings of the Eleventh International Conference on Automated Deduction, LNAI 607, Springer (1992) 400-415.
12. K. Inoue and C. Sakama: On Positive Occurrences of Negation as Failure. Proc. KR'94 (1994) 293-304.
13. K. Inoue and C. Sakama: Abducing Priorities to Derive Intended Conclusions Proc. Sixteenth International Joint Conference on Artificial Intelligence (1999) 44-49.
14. V. Lifschitz: Computing Circumscription. Proc. IJCAI-85 (1985) 121-127.
15. J. McCarthy: Applications of Circumscription to Formalizing Commonsense Knowledge. Artificial Intelligence 28 (1986) 89-116.
16. I. Niemelä and P. Simons: Smodels: An implementation of the stable model and well-founded semantics for normal logic programs. Proc. the Fourth International Conference on Logic Programming and Nonmonotonic Reasoning, Springer-Verlag, (1997) 420-429.
17. D. Poole: A Logical framework for default reasoning, Artificial Intelligence 36 (1988) 27-47.
18. C. Sakama and K. Inoue: Representing Priorities in Logic Programs. Proc. Joint International Conference and Symposium on Logic Programming (1996) 82-96.
19. C. Sakama and K. Inoue: Prioritized logic programming and its application to commonsense reasoning, Artificial Intelligence 123 (2000) 185-222.