Hyperequivalence of logic programs with respect to supported models

Annals of Mathematics and Artificial Intelligence

Volumn 53, Issue 1-4, 2008, Pages 331-365

  Truszczyński, Mirosław ^a   Woltran, Stefan ^b  

^a UNIVERSITY OF KENTUCKY   (United States)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Hyperequivalence; Logic programs; Supported models

Indexed keywords

EID: 67349118124     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-009-9119-8     Document Type: Article

References (36)

1. Apt, K.: Logic programming. In: van Leeuven, J. (ed.) Handbook of Theoretical Computer Science, pp. 493-574. Elsevier, Amsterdam (1990)
2. S. Brass J. Dix 1997 Characterizations of the disjunctive stable semantics by partial evaluation J. Log. Program. 32 3 207 228 (Pubitemid 127382248)
3. Cabalar, P., Odintsov, S., Pearce, D., Valverde, A.: Analysing and extending well-founded and partial stable semantics using partial equilibrium logic. In: Etalle, S., Truszczynski, M. (eds.) Proceedings of the 22nd International Conference on Logic Programming (ICLP 2006), LNCS, vol. 4079, pp. 346-360. Springer, Berlin (2006) (Pubitemid 44492601)
4. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293-322. Plenum, New York (1978)
5. D. de Jongh L. Hendriks 2003 Characterizations of strongly equivalent logic programs in intermediate logics Theory Pract. Log. Program. 3 3 259 270
6. T. Eiter G. Gottlob 1992 Reasoning with arsimonious and moderately grounded expansions Fundam. Inform. 17 1-2 31 53
7. Eiter, T., Fink, M., Tompits, H., Traxler, P., Woltran, S.: Replacements in non-ground answer-set programming. In Doherty, P., Mylopoulos, J., Welty, C. (eds.) Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR'06), pp. 340-351. AAAI, CA (2006)
8. T. Eiter M. Fink S. Woltran 2007 Semantical characterizations and complexity of equivalences in answer set programming ACM Trans. Comput. Log. 8 2 53 (Pubitemid 47182335)
9. Eiter, T., Tompits, H., Woltran, S.: On solution correspondences in answer-set programming. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 97-102. Morgan Kaufmann, San Francisco (2005)
10. F. Fages 1994 Consistency of Clark's completion and existence of stable models J. Meth. Logic Comput. Sci. 1 51 60
11. Ferraris, P.: On modular translations and strong equivalence. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2005), LNCS, vol. 3552, pp. 79-91. Springer, New York (2005)
12. Gebser, M. Schaub, T., Tompits, H., Woltran, S.: Alternative characterizations for program equivalence under answer-set semantics based on unfounded sets. In: Hartmann, S., Kern-Isberner, G. (eds.) Foundations of Information and Knowledge Systems, 5th International Symposium, FoIKS 2008, Proceedings, LNCS, vol. 4932, pp. 24-41. Springer, New York (2008)
13. K. Inoue C. Sakama 1998 Negation as failure in the head J. Log. Program. 35 39 78 (Pubitemid 128381257)
14. Inoue, K., Sakama, C.: Equivalence of logic programs under updates. In: Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA 2004), LNCS, vol. 3229, pp. 174-186. Springer, New York (2004)
15. M. Kaminski 1991 Embedding a default system into nonmonotonic logic Fundam. Inform. 14 3 345 353
16. K. Konolige 1988 On the relation between default and autoepistemic logic Artif. Intell. 35 3 343 382 (Pubitemid 18634285)
17. K. Konolige 1989 Errata: on the relation between default and autoepistemic logic Artif. Intell. 41 1 115
18. Lee, J., Lifschitz, V.: Loop formulas for disjunctive logic programs. In: Palamidessi, C. (ed.) Proceedings of the 19th International Conference on Logic Programming (ICLP 2003), LNCS, vol. 2916, pp. 451-465. Springer, New York (2003) (Pubitemid 137631306)
19. V. Lifschitz D. Pearce A. Valverde 2001 Strongly equivalent logic programs ACM Trans. Comput. Log. 2 4 526 541
20. V. Lifschitz L. Tang H. Turner 1999 Nested expressions in logic programs Ann. Math. Artif. Intell. 25 3-4 369 389
21. F. Lin Y. Chen 2007 Discovering classes of strongly equivalent logic programs J. Artif. Intell. Res. 28 431 451 (Pubitemid 46790307)
22. Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. In: Proceedings of the 18th National Conference on Artificial Intelligence (AAAI 2002), pp. 112-117. AAAI, CA (2002)
23. Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Fensel, D., McGuinness, D., Williams, M. (eds.) Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR 2002), pp. 170-176. Morgan Kaufmann, San Francisco (2002)
24. Maher, M.: Equivalences of logic programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 627-658. Morgan Kaufmann, San Francisco (1988)
25. Marek, W., Truszczyński, M.: Nonmonotonic Logic; Context-Dependent Reasoning. Springer, Berlin (1993)
26. R. Moore 1985 Semantical considerations on nonmonotonic logic Artif. Intell. 25 1 75 94 (Pubitemid 14513893)
27. Oetsch, J., Tompits, H., Woltran, S.: Facts do not cease to exist because they are ignored: relativised uniform equivalence with answer-set projection. In: Proceedings of the 22nd National Conference on Artificial Intelligence (AAAI 2007), pp. 458-464. AAAI, CA (2007) (Pubitemid 350149613)
28. Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: Proceedings of the 17th European Conference on Artificial Intelligence (ECAI 2006), pp. 412-416. IOS, Amsterdam (2006)
29. Sagiv, Y.: Optimising DATALOG programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 659-698. Morgan Kaufmann, San Francisco (1988)
30. Truszczyński, M., Woltran, S.: Relativized hyperequivalence of logic programs for modular programming. In: Proceedings of the 24th International Conference on Logic Programming (ICLP 2008), LNCS, vol. 5366, pp. 576-590. Springer, New York (2008)
31. M. Truszczyński 1991 Modal nonmonotonic logic with restricted application of the negation as failure to prove rule Fundam. Inform. 14 3 355 366
32. M. Truszczynski 2006 Strong and uniform equivalence of nonmonotonic theories-an algebraic approach Ann. Math. Artif. Intell. 48 3-4 245 265
33. H. Turner 2003 Strong equivalence made easy: nested expressions and weight constraints Theory Pract. Log. Program. 3 4-5 609 622
34. M. van Emden R. Kowalski 1976 The semantics of predicate logic as a programming language J. ACM 23 4 733 742
35. S. Woltran 2008 A common view on strong, uniform, and other notions of equivalence in answer-set programming Theory Pract. Log. Program. 8 2 217 234
36. K. Wong 2008 Sound and complete inference rules for SE-consequence J. Artif. Intell. Res. 31 205 216