Implementing prioritized circumscription by computing disjunctive stable models

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

Volumn 5253 LNAI, Issue , 2008, Pages 167-180

  Oikarinen, Emilia ^a   Janhunen, Tomi ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Answer set programming; Disjunctive stable models; Linear transformation; Prioritized circumscription

Indexed keywords

ARTIFICIAL INTELLIGENCE; ATOMIC PHYSICS; COMPUTER PROGRAMMING; CYBERNETICS; INFORMATION THEORY; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING;

ANSWER SET PROGRAMMING; DISJUNCTIVE LOGIC PROGRAMMING; DISJUNCTIVE LOGIC PROGRAMS; DISJUNCTIVE STABLE MODELS; ENCODINGS; EXPERIMENTAL EVALUATIONS; INTERNATIONAL CONFERENCES; LINEAR TRANSFORMATION; MINIMAL MODELING; PARALLEL CIRCUMSCRIPTION; PRIORITIZED CIRCUMSCRIPTION; PRIORITY CLASSES; STABLE MODEL SEMANTICS; STABLE MODELING;

ATOMS;

EID: 52149090761     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85776-1_15     Document Type: Conference Paper

References (21)

1. Oikarinen, E., Janhunen, T.: A linear transformation from prioritized circumscription to disjunctive logic programming. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 440-441. Springer, Heidelberg (2007)
2. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3/4), 365-385 (1991)
3. Przymusinski, T.: Stable semantics for disjunctive programs. New Generation Computing 9(3/4), 401-424 (1991)
4. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7(3), 499-562 (2006)
5. Janhunen, T., Niemelä, I., Seipel, D., Simons, P., You, J.H.: Unfolding partiality and disjunctions in stable model semantics. ACM Transactions on Computational Logic 7(1), 1-37 (2006)
6. Reiter, R.: A theory of diagnosis from first principles. Artificial Intelligence 32(1), 57-95 (1987)
7. Lifschitz, V.: Computing circumscription. In: Joshi, A.K. (ed.) Proceedings of the 9th International Joint Conference on Artificial Intelligence, Los Angeles, California, August 18-23, 1985, pp. 121-127. Morgan Kaufmann, San Francisco (1985)
8. McCarthy, J.: Circumscription - A form of non-monotonic reasoning. Artificial Intelligence 13(1-2), 27-39 (1980)
9. Janhunen, T., Oikarinen, E.: Capturing parallel circumscription with disjunctive logic programs. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 134- 146. Springer, Heidelberg (2004)
10. Oikarinen, E., Janhunen, T.: CIRC2DLP - translating circumscription into disjunctive logic programming. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 405-409. Springer, Heidelberg (2005)
11. Wakaki, T., Inoue, K.: Compiling prioritized circumscription into answer set programming. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 356-370. Springer, Heidelberg (2004)
12. Wakaki, T., Tomita, K.: Compiling prioritized circumscription into general disjunctive programs. In: Provetti, A., Son, T.C. (eds.) Proceedings of PREFS 2006: Preferences and their Applications in Logic Programming Systems, August 16, 2006, pp. 1-15 (2006)
13. Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 175-187. Springer, Heidelberg (2007)
14. Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence 15(3-4), 289-323 (1995)
15. Gottlob, G.: The complexity of default reasoning under the stationary fixed point semantics. Information and Computation 121(1), 81-92 (1995)
16. de Kleer, J., Konolige, K.: Eliminating the fixed predicates from a circumscription. Artificial Intelligence 39(3), 391-398 (1989)
17. Cadoli, M., Eiter, T., Gottlob, G.: An efficient method for eliminating varying predicates from a circumscription. Artificial Intelligence 54(2), 397-410 (1992)
18. Gelfond, M., Lifschitz, V.: Compiling circumscriptive theories into logic programs. In: Re-infrank, M., Ginsberg, M.L., de Kleer, J., Sandewall, E. (eds.) Non-Monotonic Reasoning 1988. LNCS, vol. 346, pp. 74-99. Springer, Heidelberg (1988)
19. Sakama, C., Inoue, K.: Embedding circumscriptive theories in general disjunctive programs. In: Marek, V.W., Truszczyński, M., Nerode, A. (eds.) LPNMR 1995. LNCS, vol. 928, pp. 344-357. Springer, Heidelberg (1995)
20. Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning. Artificial Intelligence 123(1-2), 185-222 (2000)
21. Lee, J., Lin, F.: Loop formulas for circumscription. Artificial Intelligence 170(2), 160-185 (2006)