Compiling prioritized circumscription into answer set programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3132, Issue , 2004, Pages 356-370

  Wakaki, Toshiko ^a   Inoue, Katsumi ^b  

^a SHIBAURA INSTITUTE OF TECHNOLOGY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; COMPUTER PROGRAMMING; RECONFIGURABLE HARDWARE;

ANSWER SET PROGRAMMING; CANDIDATE MODELS; COMPUTING MODEL; HERBRAND MODEL; LOGIC PROGRAMS; MODEL GENERATOR; PRIORITIZED CIRCUMSCRIPTION; STABLE MODEL;

LOGIC PROGRAMMING;

EID: 35048817421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27775-0_25     Document Type: Article

References (24)

1. Brewka, G., Niemelä, I. and Syrjänen, T.: Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs, Proc. of 8th European Conf. on Logics in Artificial Intelligence (JELIA 2002), LNAI 2424, pages 444-455, Springer, 2002.
2. Brewka, G., Niemelä, I. and Truszczynski, M.: Answer set Optimization, Proc. of 17th Int. Joint Conf. on Artificial Intelligence (IJCAI 2003), pages 867-872, 2003.
3. Cadoli, M.: The complexity of model checking for circumscriptive formulae, Information Processing Letters 44, pages 113-118, 1992.
4. Delgrande, J. P., Schaub, T. and Tompits, H.: A framework for compiling preferences in logic programs, Theory and Practice of Logic Programming 3(2), pages 129-187, 2003.
5. P-Complete. Theoretical Computer Science 114 (2), pages 231-245, 1993.
6. Eiter, T., Leone, N., Mateis, C., Pfeifer, G. and Scarcello, F.: A deductive system for nonmonotonic reasoning, Proc. of LPNMR 1997, LNCS 1265, pages 364-375, Springer, 1997. URL http://www.dbai.tuwien.ac.at/proj/dlv/
7. Eiter, T., Faber, W., Leone, N. and Pfeifer G.: Computing preferred answer sets by meta-interpretation in answer set programming, Theory and Practice of Logic Programming 3 (4-5), pages 463-498, 2003.
8. Gelfond, M. and Lifschitz, V.: Compiling circumscriptive theories into logic programs. Proc. of AAAI1988, pages 455-459, 1988.
9. Gelfond, M. and Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, pages 365-385, 1991.
10. Inoue, K.: Linear resolution for consequence finding, Artificial Intelligence 56, pages 301-353, 1992.
11. Inoue, K. and Sakama, C.: On positive occurrences of negation as failure. Proc. of KR 1994, pages 293-304, 1994.
12. Janhunen, T., Niemelä, I. Simons, P. and You, J.: Unfolding Partiality and Disjunctions in Stable Model Semantics, Proc. of KR 2000, pages 411-422, 2000.
13. Janhunen, T. and Oikarinen, E.: Testing the equivalence of logic programs under stable models semantics, Proc. of 8th European Conf. on Logics in Artificial Intelligence (JELIA 2002), LNAI 2424, pages 493-504, Springer, 2002.
14. Lifschitz, V.: Computing circumscription. Proc. of IJCAI'85, pages 121-127, 1985.
15. McCarthy, J.: Applications of circumscription to formalizing commonsense knowledge. Artificial Intelligence 28, pages 89-116, 1986.
16. Nerode, A., Ng, R. T. and Subrahmanian, V.S.: Computing circumscriptive databases, part I: theory and algorithms, Information and Computation, Vol. 116, pages 58-80, 1995
17. Oikarinen, E. and Janhunen, T.: Verifying the equivalence of logic programs in the disjunctive case, Proc. of 7th Int. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR 2004), LNAI 2923, pages 180-193, Springer, 2004.
18. Pfeifer, G.: Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs, Proc. of 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2004), LNAI 2923, pages 220-233, Springer, 2004.
19. Sakama, C. and Inoue, K.: Embedding circumscriptive theories in general disjunctive programs, Proc. of 3rd Int. Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 1995), LNAI 928, pages 344-357, Springer, 1995.
20. Sakama, C. and Inoue, K.: Representing priorities in logic programs. Proc. of Joint Int. Conf. and Sympo. on Logic Programming (JICSLP'96), pages 82-96, 1996.
21. Sakama, C. and Inoue, K.: Prioritized logic programming and its application to commonsense reasoning, Artificial Intelligence 123, pages 185-222, 2000.
22. Satoh, K.: Formalizing soft constraints by interpretation ordering, Proc. of 9th European Conference on Artificial Intelligence (ECAI 1990), pages 585-590, 1990.
23. Wakaki, T. and Satoh, K.: Compiling prioritized circumscription into extended logic programs. Proc. of IJCAI'97, pages 182-187, 1997.
24. Wakaki, T., Inoue, K., Sakama, C. and Nitta, K.: Computing preferred answer sets in answer set programming, Proc. of 10th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR 2003), LNAI 2850, pages 259-273, Springer, 2003.