On Eliminating Disjunctions in Stable Logic Programming

Principles of Knowledge Representation and Reasoning: Proceedings of the 9th International Conference, KR 2004

Volumn , Issue , 2004, Pages 447-457

  Eiter, Thomas ^a   Fink, Michael ^a   Tompits, Hans ^a   Woltran, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; EQUIVALENCE CLASSES; KNOWLEDGE REPRESENTATION; SEMANTICS;

CONDITION; DISJUNCTIVE LOGIC PROGRAMS; EXPRESSIVE POWER; KNOWLEDGE REPRESENTATION AND REASONING; LOGIC PROGRAMS; LOGIC-PROGRAMMING; PROGRAMMING PARADIGMS; SIMPLE++; STABLE MODEL; STABLE MODEL SEMANTICS;

LOGIC PROGRAMMING;

EID: 85116856708     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. Ben-Eliyahu, R., and Dechter, R. 1994. Propositional Semantics for Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence 12:53-87.
2. Cadoli, M.; Donini, F.; Liberatore, P.; and Schaerf, M. 2000a. Space Efficiency of Propositional Knowledge Representation Formalisms. Journal of Artificial Intelligence Research 13:1-31.
3. Cadoli, M.; Donini, F.; Schaerf, M.; and Silvestri, R. 2000b. On Compact Representations of Propositional Circumscription. Theoretical Computer Science 182(1-2):183-202.
4. de Jongh, D. J., and Hendriks, L. 2003. Characterizations of Strongly Equivalent Logic Programs in Intermediate Logics. Theory and Practice of Logic Programming 3(3):259-270.
5. Dix, J.; Gottlob, G.; and Marek, W. 1996. Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations. Fundamenta Informaticae 28:87-100.
6. Eiter, T., and Fink, M. 2003. Uniform Equivalence of Logic Programs under the Stable Model Semantics. Technical Report INFSYS RR-1843-03-08, Institut für Informationssysteme, Technische Universität Wien, A-1040 Vienna, Austria. Preliminary Report. Short version in Proc. ICLP-03.
7. Eiter, T., and Gottlob, G. 1995. On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Annals of Mathematics and Artificial Intelligence 15(3/4):289-323.
8. Eiter, T., and Gottlob, G. 1997. Expressiveness of Stable Model Semantics for Disjunctive Logic Programs with Functions. Journal of Logic Programming 33(2):167-178.
9. Eiter, T.; Faber, W.; Leone, N.; and Pfeifer, G. 2000. Declarative Problem-Solving Using the DLV System. In Minker, J., ed., Logic-Based Artificial Intelligence, 79-103. Kluwer Academic Publishers.
10. Eiter, T.; Fink, M.; Tompits, H.; and Woltran, S. 2004. Simplifying Logic Programs under Uniform and Strong Equivalence. In Proc. LPNMR 2004, number 2923 in LNCS, 87-99. Springer.
11. Eiter, T.; Gottlob, G.; and Mannila, H. 1997. Disjunctive Datalog. ACM Transactions on Database Systems 22(3):364-417.
12. Gelfond, M., and Lifschitz, V. 1991. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9:365-385.
13. Gelfond, M.; Przymusinska, H.; Lifschitz, V.; and Truszczyński, M. 1991. Disjunctive Defaults. In Proc. KR-91, 230-237.
14. Gogic, G.; Kautz, H.; Papadimitriou, C. H.; and Selman, B. 1995. The Comparative Linguistics of Knowledge Representation. In Proc. IJCAI-95, 862-869. Morgan Kaufmann.
15. Janhunen, T.; Niemelä, I.; Simons, P.; and You, J.-H. 2000. Partiality and Disjunctions in Stable Model Semantics. In Proc. KR-00, 411-419. Morgan Kaufmann.
16. Karp, R. 1972. Reducibility among Combinatorial Problems. In Miller, R. E.; and J. W. Thatcher, J. W., eds., Complexity Of Computer Computations, 85-103. Plenum Press.
17. Lifschitz, V.; Pearce, D.; and Valverde, A. 2001. Strongly Equivalent Logic Programs. ACM Trans. on Computational Logic 2(4):526-541.
18. Lin, F., and Zhao, Y. 2002. ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In Proc. AAAI-02. 112-117. AAAI Press/MIT Press.
19. Lin, F. 2002. Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. In Proc. KR-02, 170-176. Morgan Kaufmann.
20. Maher, M. J. 1988. Equivalences of Logic Programs. In Minker (1988). 627-658.
21. Marek, W., and Remmel, J. 2003. On the Expressibility of Stable Logic Programming. Theory and Practice of Logic Programming 3(4-5):551-567.
22. Marek, V. W.; Treur, J.; and Truszczyński, M. 1997. Representation Theory for Default Logic. Annals of Mathematics and Artificial Intelligence 21(2-4):343-358.
23. Minker, J., ed. 1988. Foundations of Deductive Databases and Logic Programming. Washington DC: Morgan Kaufman.
24. Osorio, M.; Navarro, J.; and Arrazola, J. 2001. Equivalence in Answer Set Programming. In Proc. LOPSTR-01, number 2372 in LNCS, 57-75. Springer.
25. Pearce, D., and Valverde, A. 2003. Some Types of Equivalence for Logic Programs and Equilibrium Logic. In Proc. APPIA-GULP-PRODE-03, Informal Proceedings.
26. Pearce, D.; Tompits, H.; and Woltran, S. 2001. Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. In Proc. EPIA-01, volume 2258 of LNCS, 306-320. Springer.
27. Pearce, D. 1997. A New Logical Characterisation of Stable Models and Answer Sets. In Non-Monotonic Extensions of Logic Programming (NEMLP 1996), volume 1216 of LNCS, 57-70. Springer.
28. Przymusinski, T. 1991. Stable Semantics for Disjunctive Programs. New Generation Computing 9:401-424. Sagiv, Y. 1988. Optimizing Datalog Programs. In Minker (1988). 659-698.
29. Schlipf, J. 1995. The Expressive Powers of Logic Programming Semantics. Journal of Computer and System Sciences 51(1):64-86. Abstract in Proc. PODS-90, pp. 196-204.
30. Simons, P.; Niemelä, I.; and Soininen, T. 2002. Extending and Implementing the Stable Model Semantics. Artificial Intelligence 138:181-234.
31. Turner, H. 2001. Strong Equivalence for Logic Programs and Default Theories (Made Easy). In Proc. LPNMR-01, number 2173 in LNCS, 81-92. Springer.
32. Turner, H. 2003. Strong Equivalence Made Easy: Nested Expressions and Weight Constraints. Theory and Practice of Logic Programming 3(4-5):609-622.