Program correspondence under the answer-set semantics: The non-ground case

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

Volumn 5366 LNCS, Issue , 2008, Pages 591-605

  Oetsch, Johannes ^a   Tompits, Hans ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER PROGRAMMING; COMPUTER SYSTEMS PROGRAMMING; INFORMATION THEORY; PROGRAMMING THEORY; SEMANTICS; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING;

CORRESPONDENCE PROBLEMS; EQUIVALENCE NOTIONS; GENERAL FRAMEWORK; LOGIC PROGRAMS; PROGRAM EQUIVALENCE; SET PROGRAMMING; SET SEMANTICS;

LOGIC PROGRAMMING; APPLICATION PROGRAMS;

ANSWER SET PROGRAMMING; ANSWER SET SEMANTICS; CORRESPONDENCE PROBLEMS; DISJUNCTIVE LOGIC PROGRAMS; EQUIVALENCE NOTIONS; POLYNOMIAL TRANSLATION; PROGRAM EQUIVALENCE; SECOND-ORDER LOGIC;

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

References (22)

1. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM TOCL 7(3), 499-562 (2006)
2. Janhunen, T., Niemelä, I., Seipel, D., Simons, P.: Unfolding Partiality and Disjunctions in Stable Model Semantics. ACM TOCL 7(1), 1-37 (2006)
3. Lifschitz, V., Pearce, D., Valverde, A.: Strongly Equivalent Logic Programs. ACM TOCL 2(4), 526-541 (2001)
4. 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)
5. Maher, M.J.: Equivalences of logic programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 627-658. Morgan Kaufmann, San Francisco (1988)
6. Sagiv, Y.: Optimizing Datalog Programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 659-698. Morgan Kaufmann, San Francisco (1988)
7. Woltran, S.: Characterizations for Relativized Notions of Equivalence in Answer Set Programming. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS, vol. 3229, pp. 161-173. Springer, Heidelberg (2004)
8. Eiter, T., Tompits, H., Woltran, S.: On Solution Correspondences in Answer-Set Programming. In: 19th International Joint Conference on Artificial Intelligence, pp. 97-102 (2005)
9. Oikarinen, E., Janhunen, T.: Modular Equivalence for Normal Logic Programs. In: 17th European Conference on Artificial Intelligence, pp. 412-416. IOS Press, Amsterdam (2006)
10. 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)
11. Lin, F.: Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. In: 8th International Conference on Principles of Knowledge Representation and Reasoning, pp. 170-176. Morgan Kaufmann, San Francisco (2002)
12. Eiter, T., Fink, M., Tompits, H., Woltran, S.: Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. In: 20th National Conference on Artificial Intelligence, pp. 695-700. AAAI Press, Menlo Park (2005)
13. Lifschitz, V., Pearce, D., Valverde, A.: A Characterization of Strong Equivalence for Logic Programs with Variables. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS, vol. 4483, pp. 188-200. Springer, Heidelberg (2007)
14. Oetsch, J., Tompits, H., Woltran, S.: Facts do not Cease to Exist Because They are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. In: 22nd National Conference on Artificial Intelligence, pp. 458-464. AAAI Press, Menlo Park (2007)
15. Ferraris, P., Lee, J., Lifschitz, V: A New Perspective on Stable Models. In: 20th International Joint Conference on Artificial Intelligence, pp. 372-379 (2007)
16. Gelfond, M., Lifschitz, V: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365-385 (1991)
17. Turner, H.: Strong Equivalence Made Easy: Nested Expressions and Weight Constraints. Theory and Practice of Logic Programming 3(4-5), 602-622 (2003)
18. Shmueli, O.: Decidability and Expressiveness Aspects of Logic Queries. In: 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 237-249. ACM, New York (1987)
19. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and Expressive Power of Logic Programming. ACM Computing Surveys 33(3), 374-425 (2001)
20. Eiter, T., Fink, M., Tompits, H., Woltran, S.: Complexity Results for Checking Equivalence of Stratified Logic Programs. In: 20th International Joint Conference on Artificial Intelligence, pp. 330-335 (2007)
21. McCarthy, J.: Circumscription-A Form of Non-Monotonic Reasoning. Artificial Intelligence 13, 27-39 (1980)
22. Tompits, H., Woltran, S.: Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 189-203. Springer, Heidelberg (2005)