Relativized hyperequivalence of logic programs for modular programming

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

Volumn 5366 LNCS, Issue , 2008, Pages 576-590

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

^a UNIVERSITY OF KENTUCKY   (United States)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; INFORMATION THEORY; PROGRAMMING THEORY; SEMANTICS; APPLICATION PROGRAMS;

LOGIC PROGRAMS; PROGRAM OPTIMIZATION;

LOGIC PROGRAMMING;

HYPEREQUIVALENCE; IN CONTEXTS; LOGIC PROGRAMS; MINIMAL MODEL; MODULAR PROGRAMMING; PROGRAM OPTIMIZATION;

EID: 58549086191     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89982-2_48     Document Type: Conference Paper

References (27)

1. Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: Apt, K., Marek, W., Truszczyński, M., Warren, D. (eds.) The Logic Programming Paradigm: A 25-Year Perspective, pp. 375-398. Springer, Berlin (1999)
2. Niemelä, I.: Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 241-273 (1999)
3. Gelfond, M., Leone, N.: Logic programming and knowledge representation -the A-prolog perspective. Artificial Intelligence 138, 3-38 (2002)
4. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
5. Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., Truszczyński, M.: The first answer set programming system competition. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS, vol. 4483, pp. 3-17. Springer, Heidelberg (2007)
6. Gelfond, M.: Representing knowledge in A-Prolog. In: Kakas, A., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS, vol. 2408, pp. 413-451. Springer, Heidelberg (2002)
7. Janhunen, T.: Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics 16, 35-86 (2006)
8. Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: Proceedings of ECAI 2006, pp. 412-416. IOS Press, Amsterdam (2006)
9. 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, vol. 4483, pp. 175-187. Springer, Heidelberg (2007)
10. Gaifman, H., Shapiro, E.: Fully abstract compositional semantics for logic programs. In: Proceedings of POPL 1989, pp. 134-142 (1989)
11. Lifschitz, V., Turner, H.: Splitting a logic program. In: Proceedings of ICLP 1994, pp. 23-37 (1994)
12. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2(4), 526-541 (2001)
13. Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Proceedings of KR 2002, pp. 170-176. Morgan Kaufmann, San Francisco (2002)
14. Turner, H.: Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming 3, 609-622 (2003)
15. de Jongh, D., Hendriks, L.: Characterizations of strongly equivalent logic programs in intermediate logics. Theory and Practice of Logic Programming 3, 259-270 (2003)
16. Eiter, T., Fink, M.: Uniform equivalence of logic programs under the stable model semantics. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 224-238. Springer, Heidelberg (2003)
17. Eiter, T., Fink, M., Woltran, S.: Semantical characterizations and complexity of equivalences in answer set programming. ACM Transactions on Computational Logic 8, 53 (2007)
18. Sagiv, Y.: Optimizing datalog programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 659-698. Morgan Kaufmann, San Francisco (1988)
19. Inoue, K., Sakama, C.: Equivalence of logic programs under updates. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS, vol. 3229, pp. 174-186. Springer, Heidelberg (2004)
20. Woltran, S.: A common view on strong, uniform, and other notions of equivalence in answerset programming. Theory and Practice of Logic Programming 8, 217-234 (2008)
21. Eiter, T., Tompits, H., Woltran, S.: On solution correspondences in answer-set programming. In: Proceedings of IJCAI 2005, pp. 97-102. Morgan Kaufmann, San Francisco (2005)
22. 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 AAAI 2007, pp. 458-464. AAAI Press, Menlo Park (2007)
23. Cabalar, P., Odintsov, S., Pearce, D., Valverde, A.: Analysing and extending well-founded and partial stable semantics using partial equilibrium logic. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 346-360. Springer, Heidelberg (2006)
24. Truszczyński, M., Woltran, S.: Hyperequivalence of logic programs with respect to supported models. In: Proceedings of AAAI 2008, pp. 560-565. AAAI Press, Menlo Park (2008)
25. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293-322. Plenum Press, New York (1978)
26. Erdogan, S., Lifschitz, V.: Definitions in answer set programming. In: LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 114-126. Springer, Heidelberg (2004)
27. Apt, K.: Logic programming. In: van Leeuven, J. (ed.) Handbook of Theoretical Computer Science, pp. 493-574. Elsevier, Amsterdam (1990)