Semantical characterizations and complexity of equivalences in answer set programming

ACM Transactions on Computational Logic

Volumn 8, Issue 3, 2007, Pages

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

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Answer set semantics; Computational complexity; Program optimization; Stable models; Strong equivalence; Uniform equivalence

Indexed keywords

ANSWER SET SEMANTICS; PROGRAM OPTIMIZATION; STABLE MODELS; STRONG EQUIVALENCE; UNIFORM EQUIVALENCE;

CHARACTERIZATION; COMPUTATIONAL COMPLEXITY; LOGIC PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

SEMANTICS;

EID: 34547509865     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1243996.1244000     Document Type: Article

References (59)

1. ALFERES, J. J., LEITE, J. Á., PEREIRA, L. M., PRZYMUSINSKA, H., AND PRZYMUSINSKI, T. C. 2000. Dynamic updates of non-monotonie knowledge bases. J. Logic Program. 45, 1-3, 43-70.
2. ANGER, C., KONCZAK, K., AND LINKE, T. 2001. NoMoRe: A system for non-monotonic reasoning. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), T. Eiter et al., Eds. vol. 2173. Springer Verlag, 406-410.
3. 1. J. Comput. Syst. Sci. 41, 274-306.
4. BEN-ELIYAHU, R. AND DECHTER, R. 1994. Propositional semantics for disjunctive logic programs. Annals Math. Artif. Intell. 12, 53-87.
5. BUNTINE, W. 1988. Generalised subsumption and its applications to induction and redundancy. Artif. Intell. 36, 2, 149-176.
6. BUSS, S. 1987. The Boolean formula value problem is in ALOGTIME. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing. 123-131.
7. CABALAR, P. 2002. A three-valued characterization for strong equivalence of logic programs. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI). AAAI Press/MIT Press, Cambridge, MA, 106-111.
8. CADOLI, M. AND LENZERINI, M. 1994. The complexity of propositional closed world reasoning and circumscription. J. Comput. Syst. Sci. 48, 2, 255-310.
9. CHAUDHURI, S. AND VARDI, M. Y. 1992. On the equivalence of recursive and nonrecursive data-log programs. In Proceedings of the 11th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS). ACM Press, New York, 55-66.
10. COSMADAKIS, S. AND KANELLAKIS, P. 1986. Parallel evaluation of recursive rule queries. In Proceedings of the Sth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS). ACM Press, New York, 280-293.
11. DE JONGH, D. AND HENDRIKS, L. 2003. Characterizations of strongly equivalent logic programs in intermediate logics. Theory Pract. Logic Program. 3, 3, 259-270.
12. DIMOPOULOS, Y., NEBEL, B., AND KOEHLER, J. 1997. Encoding planning problems in nonmonotonic logic programs. In Proceedings of the European Conference on Planning (ECP), S. Steel and R. Alami, Eds. Lecture Notes in Computer Science, vol. 1348. Springer Verlag, 169-181.
13. K system. Artif. Intell. 144, 1-2, 157-211.
14. EITER, T., FABER, W., LEONE, N., PFEIFER, G., AND POLLERES, A. 2004. A logic programming approach to knowledge-state planning: Semantics and complexity. ACM Trans. Comput. Logic 5, 2, 206-263.
15. EITER, T. AND FINK, M. 2003a. Uniform equivalence of logic programs under the stable model semantics. In Proceedings of the 19th International Conference on Logic Programming (ICLP), C. Palamidessi, Ed. Lecture Notes in Computer Science, vol. 2916. Springer Verlag, 224-238.
16. EITER, T. AND FINK, M. 2003b. Uniform equivalence of logic programs under the stable model semantics. Tech. Rep. INFSYS RR-1843-03-08, Institut für Informationssysteme, Technische Universität Wien, Austria.
17. EITER, T., FINK, M., SABBATINI, G., AND TOMPITS, H. 2001. A framework for declarative update specifications in logic programs. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI), B. Nebel, Ed. Morgan Kaufmann, San Fransisco, CA; 649-654.
18. EITER, T., FINK, M., TOMPITS, H., AND WOLTRAN, S. 2004a. On eliminating disjunctions in stable logic programming. In Proceedings of the 9th International Conference on Principles of Knowledge Representation and Reasoning (KR), D. Dubois et al., Eds. AAAI Press, 447-458.
19. EITER, T., FINK, M., TOMPITS, H., AND WOLTRAN, S. 2004b. Simplifying logic programs under uniform and strong equivalence. In. Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), V. Lifschitz and I. Niemelä, Eds. Lecture Notes in Computer Science, vol. 2923. Springer Verlag, 87-99.
20. EITER, T., FINK, M., TOMPITS, H., AND WOLTRAN, S. 2005. Strong and uniform equivalence in answer-set programming: Characterizations and complexity results for the non-ground case. Accepted for publication in the Proceedings of the 20th National Conference on Artificial Intelligence (AAAI).
21. EITER, T. AND GOTTLOB, G. 1995. On the computational cost of disjunctive logic programming: Propositional case. Annals Math. Artif. Intell. 15, 3/4, 289-323.
22. EITER, T., GOTTLOB, G., AND MANNILA, H. 1997. Disjunctive datalog. ACM Trans. Database Syst. 22, 3, 364-418.
23. ERDEM, E., LIFSCHITZ, V., NAKHLEH, L., AND RINGE, D. 2003. Reconstructing the evolutionary history of Indo-European languages using answer set programming. In Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages (PADL), V. Dahl and P. Wadler, Eds. Lecture Notes in Computer Science, vol. 2562. Springer Verlag, 160-176.
24. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Proceedings of the 5th International Conference on Logic Programming (ICLP), R. Kowalski and K. Bowen, Eds. MIT Press, Cambridge, MA, 1070-1080.
25. GELFOND, M. AND LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Gen. Comput. 9, 365-385.
26. GIORGMI, P., MASSACCI, F., MYLOPOULOS, J., AND ZANNONE, N. 2004. Requirements engineering meets trust management: Model, methodology, and reasoning. In Proceedings of the 2nd International Conference on Trust Management (iTrust). Lecture Notes in Computer Science, vol. 2995. Springer Verlag, 176-190.
27. HALEVY, A. Y., MUMICK, I. S., SAGIV, Y., AND SHMUELI, O. 2001. Static analysis in datalog extensions. J. ACM 48, 5, 971-1012.
28. HELJANKO, K. AND NIEMELÄ, I. 2001. Bounded LTL model checking with stable models. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), T. Eiter et al., Eds. Lecture Notes in Computer Science, vol. 2173. Springer Verlag, 200-212.
29. IMMERMAN, N. 1999. Descriptive Complexity. Springer Verlag.
30. INOUE, K. AND SAKAMA, C. 1999. Updating extended logic programs through abduction. In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), M. Gelfond et al., Eds. Lecture Notes in Computer Science, vol. 1730. Springer Verlag, 147-161.
31. INOUE, K. AND SAKAMA, C. 2004. Equivalence of logic programs under updates. In Proceedings of the 9th European Conference on Logics in Artificial, Intelligence (JELIA), J. J. Alferes and J. A. Leite, Eds. Lecture Notes in Computer Science, vol. 3229. Springer Verlag, 174-186.
32. JANHUNEN, T. AND OKARINEN, E. 2004. LPEQ and DLPEQ-Translators for automated equivalence testing of logic programs. In Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), V. Lifschitz and I. Niemelä, Eds. Lecture Notes in Computer Science, vol. 2923. Springer Verlag, 336-340.
33. KAUTZ, H. AND SELMAN, B. 1992. Planning as satisfiability. In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI), B. Neumann, Ed. Wiley, 359-363.
34. KOWALSKI, V. 1968. The calculus of the weak "Law of Excluded Middle". Math. USSR 8, 648-658.
35. LEONE, N., PFEIFER, G., FABER, W., EITER, T., GOTTLOB, G., PERRI, S., AND SCARCELLO, F. 2002. The DLV system for knowledge representation and reasoning. Tech. Rep. cs.AI/0211004, arXiv.org. November. To appear in ACM Trans. Comput. Logic.
36. LIFSCHITZ, V. 1999. Action languages, answer sets and planning. In The Logic Programming Paradigm - A 25-Year Perspective, K. Apt et al., Eds. Springer Verlag, 357-373.
37. LIFSCHITZ, V., PEARCE, D., AND VALVERDE, A. 2001. Strongly equivalent logic programs. ACM Trans. Comput. Logic 2, 4, 526-541.
38. LIFSCHITZ, V., TANG, L., AND TURNER, H. 1999. Nested expressions in logic programs. Annals Math. Artif. Intell. 25, 3-4, 369-389.
39. LIFSCHITZ, V. AND TURNER, H. 1994. Splitting a logic program. In Proceedings of the 11th International Conference on Logic Programming (ICLP), P. Van Hentenryck, Ed. MIT-Press, Cambridge, MA, 23-38.
40. LIN, F. 2002. Reducing strong equivalence of logic programs to entailment in classical propositional logic. In Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR), D. Fensel et al., Eds. Morgan Kaufmann, San Fransisco, CA, 170-176.
41. LIN, F. AND ZHAO, Y 2002. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI). AAAI Press / MIT Press, Cambridge, MA, 112-117.
42. LINKE, T., Tompits, H., AND WOLTRAN, S. 2004. On acyclic and head-cycle free nested logic programs. In Proceedings of the 20th International Conference on Logic Programming (ICLP), B. Demoen and V. Lifschitz, Eds. Lecture Notes in Computer Science, vol. 3132. Springer Verlag, 225-239.
43. MAHER, M. J. 1988. Equivalences of logic programs. In Foundations of Deductive Databases and Logic Programming, J. Minker. Morgan, Kauffman, San Fransico, CA, 627-658.
44. MINKER, J., 1988. Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, San Fransico, CA.
45. OSORIO, M., NAVARRO, J., AND ARRAZOLA, J. 2001. Equivalence in answer set programming. In Proceedings of the 11th International Workshop on Logic Based Program Synthesis and Transformation (LOPSTR), A. Pettorossi, Ed. Lecture Notes in Computer Science, vol. 2372. Springer Verlag, 57-75.
46. PEARCE, D. 2004. Simplifying logic programs under answer set semantics. In Proceedings of the 20th International Conference on Logic Programming (ICLP), B. Demoen and V. Lifschitz, Eds. Lecture Notes in Computer Science, vol. 3132. Springer Verlag.
47. PEARCE, D., TOMPITS, H., AND WOLTRAN., S. 2001. Encodings for equilibrium logic and logic programs with nested expressions. In Proceedings of the 10th Portuguese Conference on Artificial Intelligence (EPIA), P. Brazdil and A. Jorge, Eds. Lecture Notes in Computer Science, vol. 2258. Springer Verlag, 306-320.
48. PEARCE, D. AND VALVERDE, A. 2004a. Synonymous theories in answer set programming and equilibrium logic. In Proceedings of the 16th European Conference on Artificial Intelligence (ECAI), R. L. de Mántaras and L. Saitta, Eds. IOS Press, Amsterdam, the Netherland, 388-392.
49. PEARCE, D. AND VALVERDE, A. 2004b. Uniform equivalence for equilibrium logic and logic programs. In Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), V. Lifschitz and I. Niemelä, Eds. Lecture Notes in Computer Science, vol. 2923. Springer Verlag, 194-206.
50. PROVETTI, A. AND SON, T. C. 2001. Proceedings of the Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning. AAAI Press.
51. PRZYMUSINSKI, T. 1991. Stable semantics for disjunctive programs. New Gen. Comput. 9, 401-424.
52. SAGIV, Y 1988. Optimizing datalog programs. In Foundations of Deductive Databases and Logic Programming, J. Minker. Morgan, Kauffman, San Fransico, CA, 659-698.
53. SHMUELI, O. 1993. Equivalence of datalog queries is undecidable. J. Logic Program. 15, 3, 231-242.
54. SIMONS, P., NIEMELÄ, I., AND SOININEN, T. 2002. Extending and implementing the stable model semantics. Artif. Intell. 138, 1-2, 181-234.
55. SUBRAHMANIAN, V. S. AND ZANIOLO, C. 1995. Relating stable models and AI planning domains. In Proceedings of the 12th International Conference on Logic Programming (ICLP), L. Sterling, Ed. MIT Press, Cambridge, MA, 233-247.
56. TURNER, H. 2003. Strong equivalence made easy: Nested expressions and weight constraints. Theory Pract. Logic Programm. 3, 4-5, 602-622.
57. TURNER, H. 2001. Strong equivalence for logic programs and default theories (made easy). In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), T. Eiter et al., Eds. Lecture Notes in Computer Science, vol. 2173. Springer Verlag, 81-92.
58. WOLTRAN, S. 2004. Characterizations for relativized notions of equivalence in answer set programming. In Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA), J. J. Alferes and J. A. Leite, Eds. Lecture Notes in Computer Science, vol. 3229. Springer Verlag, 161-173.
59. ZHANG, Y AND FOO, N. Y 1998. Updating logic programs. In Proceedings of the 13th European Conference on Artificial Intelligence (ECAI), H. Prade, Ed. Wiley, 403-407.