Capturing parallel circumscription with disjunctive logic programs

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

Volumn 3229, Issue , 2004, Pages 134-146

  Janhunen, Tomi ^a   Oikarinen, Emilia ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE REPRESENTATION; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS; SET THEORY; THEOREM PROVING; ARTIFICIAL INTELLIGENCE; ATOMS; PROGRAM TRANSLATORS;

CHARACTERISTIC CLAUSE; DISJUNCTIVE LOGIC PROGRAMS; PARALLEL CIRCUMSCRIPTION; STABLE MODEL SEMANTICS;

LOGIC PROGRAMMING;

CLASSICAL MODEL; DISJUNCTIVE LOGIC PROGRAMMING; DISJUNCTIVE LOGIC PROGRAMS; EXPRESSIVE POWER; MINIMAL MODEL; PARALLEL CIRCUMSCRIPTION; PROBLEM REPRESENTATION; STABLE MODEL SEMANTICS;

EID: 22944445494     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30227-8_14     Document Type: Conference Paper

References (23)

1. P. Baumgartner, P. Fröhlich, U. Furbach, and W. Nejdl. Semantically guided theorem proving for diagnosis applications. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, pages 460-465, Nagoya, 1997. Morgan Kaufmann.
2. M. Cadoli, T. Eiter, and G. Gottlob. An efficient method for eliminating varying predicates from a circumscription. Artificial Intelligence, 54(2):397-410, 1992.
3. J. de Kleer and K. Konolige. Eliminating the fixed predicates from a circumscription. Artificial Intelligence, 39(3):391-398, July 1989.
4. T. Eiter, W. Faber, N. Leone, and G. Pfeifer. The diagnosis frontend of the DLV system. AI Communications, 12(1-2):99-111, 1999.
5. T. Eiter and G. Gottlob. On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence, 15:289-323, 1995.
6. T. Eiter, G. Gottlob, and H. Veith. Modular logic programming and generalized quantifiers. In J. Dix, U. Furbach, and A. Nerode, editors, Logic Programming and Nonmonotonic Reasoning, pages 289-308, Dagstuhl Castle, Germany, July 1997. Springer-Verlag. LNAI 1265.
7. M. Gelfond and V. Lifschitz. Compiling circumscriptive theories into logic programs. In Proceedings of the 7th National Conference on Artificial Intelligence, pages 455-449, St. Paul, MN, August 1988. AAAI Press.
8. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
9. K. Inoue and C. Sakama. Negation as failure in the head. Journal of Logic Programming, 35(1):39-78, 1998.
10. T. Janhunen. On the intertranslatability of non-monotonic logics. Annals of Mathematics and Artificial Intelligence, 27(1-4):79-128, 1999.
11. T. Janhunen. On the effect of default negation on the expressiveness of disjunctive rules. In T. Eiter, W. Faber, and M. Truszczyski, editors, Logic Programming and Nonmonotonic Reasoning, Proceedings of the 6th International Conference, pages 93-106, Vienna, Austria, September 2001. Springer-Verlag. LNAI 2173.
12. T. Janhunen. Translatability and intranslatability results for certain classes of logic programs. Series A: Research report 82, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2003.
13. T. Janhunen, I. Niemelä, D. Seipel, P. Simons, and J.-H. You. Unfolding partiality and disjunctions in stable model semantics. ACM Transactions on Computational Logic, 2004. Accepted for publication, see http://www.acm.org/tocl/accepted.html.
14. J. Lee and F. Lin. Loop formulas for circumscription. In Proceedings of the 19th National Conference on Artificial Intelligence, pages 281-286, San Jose, California, July 2004. AAAI.
15. N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, and F. Scarcello. The DLV system for knowledge representation and reasoning. CoRR: cs. AI/0211004 v2, August 2003.
16. V. Lifschitz. Computing circumscription. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 121-127, Los Angeles, California, USA, August 1985. Morgan Kaufmann.
17. V. Lifschitz and H. Turner. Splitting a logic program. In Proceedings of the 11th International Conference on Logic Programming, pages 23-37. MIT Press, 1994.
18. J. McCarthy. Circumscription - a form of non-monotonic reasoning. Artificial Intelligence, 13:27-39, 1980.
19. Ilkka Niemelä. A tableau calculus for minimal model reasoning. In Analytic Tableaux and Related Methods: Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, pages 278-294, 1996. LNCS 1071.
20. T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401-424, 1991.
21. R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32:57-95, 1987.
22. C. Sakama and K. Inoue. Embedding circumscriptive theories in general disjunctive programs. In Proceedingsofthe3rdInternational Conferenceon Logic Programmingand Nonmonotonic Reasoning, pages 344-357. Springer-Verlag, 1995.
23. P. Simons. Extending the stable model semantics with more expressive rules. In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 305-316, El Paso, Texas, USA, 1999. Springer-Verlag.