Hyperequivalence of logic programs with respect to supported models

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 560-565

  Truszczyński, Mirostaw ^a   Woltran, Stefan ^b  

^a UNIVERSITY OF KENTUCKY   (United States)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIONICS; COMPUTER PROGRAMMING; INFORMATION THEORY; SEMANTICS;

COMPLEXITY RESULTS; EQUIVALENCE NOTIONS; LOGIC PROGRAMS; MODEL SEMANTICS; NONMONOTONIC LOGICS; PROGRAM EQUIVALENCES; PROGRAM OPTIMIZATIONS;

LOGIC PROGRAMMING;

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

References (22)

1. Apt, K. 1990. Logic Programming. In van Leeuven, J., ed., Handbook of Theoretical Computer Science. Elsevier. 493-574.
2. Brass, S., and Dix, J. 1997. Characterizations of the Disjunctive Stable Semantics by Partial Evaluation. J. Logic Programm. 32(3):207-228.
3. Cabalan P.; Odintsov, S. P.; Pearce, D.; and Valverde, A. 2006. Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic. In Proc. of ICLP 2006, LNCS 4079, 346-360. Springer.
4. Clark, K. 1978. Negation as Failure. In Gallaire, H., and Minker, J., eds., Logic and Data Bases. Plenum Press. 293-322.
5. Eiter, T., and Gottlob, G. 1992. Reasoning with Parsimonious and Moderately Grounded Expansions. Fund. Inform. 17(l-2):31-53.
6. Eiter, T.; Fink, M.; and Woltran, S. 2007. Semantical Characterizations and Complexity of Equivalences in Answer Set Programming. ACM TOCL 8(3), article 17.
7. Eiter, T.; Tompits, H.; and Woltran, S. 2005. On Solution Correspondences in Answer-Set Programming. In Proc. ofIJCAI2005, 97-102. Professional Book Center.
8. Gebser, M.; Schaub, T.; Tompits, H.; and Woltran, S. Alternative Characterizations for Program Equivalence under Answer-Set Semantics based on Unfounded Sets. Proc. of FoIKS 2008, LNCS 4932, 24-41. Springer.
9. Inoue, K., and Sakama, C. 1998. Negation as Failure in the Head. J. Logic Programm. 35:39-78.
10. Inoue, K., and Sakama, C. 2004. Equivalence of Logic Programs under Updates. In Proc. of JEUA 2004, LNCS 3229, 174-186. Springer.
11. Kaminski, M. 1991. Embedding a Default System into Nonmonotonic Logic. Fund. Inform. 14(3):345-353.
12. Konolige, K. 1988. On the Relation between Default and Autoepistemic Logic. Artif Intell. 35(3):343-382 (and errata: ibid. 41(1): 115).
13. Lifschitz, V.; Pearce, D.; and Valverde, A. 2001. Strongly Equivalent Logic Programs. ACM TOCL 2(4):526-541.
14. Lin, F. 2002. Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. In Proc. of KR 2002, 170-176. Morgan Kaufmann.
15. Oetsch, J.; Tompits, H.; and Woltran, S. 2007. Facts do not Cease to Exist Because They are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. In Proc. of AAAI2007, 458-464. AAAI Press.
16. Oikarinen, E., and Janhunen, T. 2006. Modular Equivalence for Normal Logic Programs. In Proc. of ECAI 2006, 412-416. IOS Press.
17. Truszczyński, M. 1991. Modal Nonmonotonic Logic with Restricted Application of the Negation as Failure to Prove Rule. Fund. Inform. 14(3):355-366.
18. Truszczyński, M. 2006. Strong and Uniform Equivalence of Nonmonotonic Theories - an Algebraic Approach. In Proc. of KR 2006, 389-399. AAAI Press.
19. Truszczyński, M., and Woltran, S. 2008. Hyperequivalence of Logic Programs with respect to Supported Models. Technical Report DBAI-TR-2008-58, Technische Universität Wien.
20. Turner, H. 2003. Strong Equivalence Made Easy: Nested Expressions and Weight Constraints. TPLP 3:609-622.
21. van Emden, M., and Kowalski, R. 1976. The Semantics of Predicate Logic as a Programming Language. JACM 23(4):733-742.
22. Woltran, S. 2008. A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming. TPLP, 8:217-234.