Equivalences in answer-set programming by countermodels in the logic of here-and-there

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

Volumn 5366 LNCS, Issue , 2008, Pages 99-113

  Fink, Michael ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Answer set programming; Knowledge representation; Program optimization; Uniform equivalence

Indexed keywords

CHARACTERIZATION; COMPUTER PROGRAMMING; INFORMATION THEORY; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING; PROGRAMMING THEORY; SEMANTICS; EQUIVALENCE CLASSES; NETWORK SECURITY;

ANSWER-SET PROGRAMMING; INFINITE DOMAINS; LOGIC PROGRAMS; PROGRAM OPTIMIZATION; SET PROGRAMMING; SET SEMANTICS; UNIFORM EQUIVALENCE;

EQUIVALENCE CLASSES; LOGIC PROGRAMMING;

ANSWER SET PROGRAMMING; ANSWER SET SEMANTICS; FIRST ORDER THEORIES; INFINITE DOMAINS; INFINITE THEORIES; LOGIC PROGRAMS; PROGRAM OPTIMIZATION; UNIFORM EQUIVALENCE;

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

References (24)

1. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
2. 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)
3. Janhunen, T., Niemelä, I.: GnT - A solver for disjunctive logic programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS, vol. 2923, pp. 331-335. Springer, Heidelberg (2003)
4. Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. Artif. Intell. 157(1-2), 115-137 (2004)
5. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: A conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS, vol. 4483, pp. 260-265. Springer, Heidelberg (2007)
6. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365-385 (1991)
7. Ferraris, P., Lee, J., Lifschitz, V.: A new perspective on stable models. In: Veloso, M.M. (ed.) IJCAI 2007, pp. 372-379 (2007)
8. Heymans, S., Nieuwenborgh, D.V., Vermeir, D.: Open answer set programming for the semantic web. J. Applied Logic 5(1), 144-169 (2007)
9. Heymans, S., de Bruijn, J., Predoiu, L., Feier, C., Nieuwenborgh, D.V.: Guarded hybrid knowledge bases. CoRR abs/0711.2155 (2008) (to appear in TPLP)
10. de Bruijn, J., Pearce, D., Polleres, A., Valverde, A.: Quantified equilibrium logic and hybrid rules. In: Marchiori, M., Pan, J.Z., de Sainte Marie, C. (eds.) RR 2007. LNCS, vol. 4524, pp. 58-72. Springer, Heidelberg (2007)
11. Pearce, D., Valverde, A.: Quantified equilibrium logic an the first order logic of here-andthere. Technical Report MA-06-02, Univ. Rey Juan Carlos (2006)
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: Veloso, M.M., Kambhampati, S. (eds.) AAAI 2005, 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. Woltran, S.: A common view on strong, uniform, and other notions of equivalence in answerset programming. TPLP 8(2), 217-234 (2008)
15. Faber, W., Konczak, K.: Strong order equivalence. AMAI 47(1-2), 43-78 (2006)
16. 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)
17. Eiter, T., Fink, M., Tompits, H., Traxler, P., Woltran, S.: Replacements in non-ground answerset programming. In: Doherty, P., Mylopoulos, J., Welty, C.A. (eds.) KR 2006, pp. 340-351. AAAI Press, Menlo Park (2006)
18. Lin, F., Chen, Y.: Discovering classes of strongly equivalent logic programs. JAIR 28, 431-451 (2007)
19. 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)
20. Eiter, T., Fink, M., Woltran, S.: Semantical characterizations and complexity of equivalences in answer set programming. ACM TOCL 8(3) (2007)
21. Pearce, D., Valverde, A.: Uniform equivalence for equilibrium logic and logic programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS, vol. 2923, pp. 194-206. Springer, Heidelberg (2003)
22. Cabalar, P., Ferraris, P.: Propositional theories are strongly equivalent to logic programs. TPLP 7(6), 745-759 (2007)
23. Cabalar, P., Pearce, D., Valverde, A.: Minimal logic programs. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 104-118. Springer, Heidelberg (2007)
24. Oetsch, J., Tompits, H., Woltran, S.: Facts do not cease to exist because they are ignored: Relativised uniform equivalence with answer-set projection. In: AAAI, pp. 458-464. AAAI Press, Menlo Park (2007)