Quantified equilibrium logic and foundations for answer set programs

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

Volumn 5366 LNCS, Issue , 2008, Pages 546-560

  Pearce, David ^a   Valverde, Agustín ^b  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; FOURIER TRANSFORMS; LOGIC PROGRAMMING; PROGRAMMING THEORY; FORMAL LOGIC; KNOWLEDGE REPRESENTATION;

ANSWER SET PROGRAMMING (ASP); ENCODINGS; EQUILIBRIUM LOGIC; INTUITIONISTIC LOGIC (IL); LOGIC PROGRAMS;

LIGHT SOURCES; LOGIC PROGRAMMING;

ANSWER SET PROGRAMMING; CLASSICAL LOGIC; EQUILIBRIUM LOGIC; INTUITIONISTIC LOGIC; LOGIC PROGRAMS; NONMONOTONIC; PROOF THEORY; UNIVERSAL THEORY;

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

References (29)

1. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2002)
2. 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: AAAI 2005, Proceedings, pp. 695-700. AAAI Press/The MIT Press (2005)
3. Fink, M., Pichler, R., Tompits, H., Woltran, S.: Complexity of rule redundancy in non-ground answer-set programming over finite domains. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS, vol. 4483, pp. 123-135. Springer, Heidelberg (2007)
4. Ferraris, P., Lee, J., Lifschitz, V.: A new perspective on stable models. In: IJCAI 2007, Proceedings, pp. 372-379 (2007)
5. 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)
6. Lee, J., Lifschitz, V., Palla, R.: A reductive semantics for counting and choice in answer set programming. In: AAAI 2008, Proceedings, pp. 472-479. AAAI Press, Menlo Park (2008)
7. Pearce, D., Valverde, A.: Towards a first order equilibrium logic for nonmonotonic reasoning. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS, vol. 3229, pp. 147-160. Springer, Heidelberg (2004)
8. Pearce, D., Valverde, A.: A first order nonmonotonic extension of constructive logic. Studia Logica 80(2-3), 321-346 (2005)
9. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Trans. Comput. Log. 2(4), 526-541 (2001)
10. Pearce, D., Valverde, A.: Quantified equilibrium logic. Technical report, Universidad Rey Juan Carlos (2006), http://www.matap.uma.es/investigacion/tr/ ma06-02.pdf
11. Traxler, P.: Techniques for simplifying disjunctive datalog programs with negation. Magisterarbeit, TU Wien (January 2006)
12. Lin, F., Chen, Y.: Discovering classes of strongly equivalent logic programs. In: IJCAI 2005, Proceedings, Professional Book Center, pp. 516-521 (2005)
13. Pearce, D., Tompits, H., Woltran, S.: Encodings for equilibrium logic and logic programs with nested expressions. In: Brazdil, P.B., Jorge, A.M. (eds.) EPIA 2001. LNCS, vol. 2258, pp. 306-320. Springer, Heidelberg (2001)
14. Traxler, P.: Testing strong equivalence of datalog programs - implementation and examples. Technical report, TU Wien (September 2004)
15. Pearce, D.: Equilibrium logic. Ann. Math. Artif. Intell. 47(1-2), 3-41 (2006)
16. van Dalen, D.: Logic and Structure, 3rd edn. Springer, Heidelberg (1997)
17. Lifschitz, V., Woo, T.Y.C.: Answer sets in general nonmonotonic reasoning (preliminary report). In: KR, pp. 603-614 (1992)
18. de Bruijn, J., Pearce, D., Polleres, A., Valverde, A.: Quantified equilibrium logic and hybrid rules. In: Marchiori, M., Pan, J.Z., Marie, C.d.S. (eds.) RR 2007. LNCS, vol. 4524, pp. 58-72. Springer, Heidelberg (2007)
19. Heymans, S., Nieuwenborgh, D.V., Vermeir, D.: Open answer set programming with guarded programs. ACM Trans. Comput. Log. 9(4) (2008)
20. Heymans, S., Predoiu, L., Feier, C., de Bruijn, J., Nieuwenborgh, D.V.: G-hybrid knowledge bases. In: ALPSWS 2006, Proceedings. CEUR Workshop Proceedings, CEUR-WS.org., vol. 196, pp. 39-54 (2006)
21. Pearce, D.: A new logical characterization of stable models and answer sets. In: Dix, J., Przymusinski, T.C., Moniz Pereira, L. (eds.) NMELP 1996. LNCS, vol. 1216, pp. 57-70. Springer, Heidelberg (1997)
22. Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: KR 2002, Proceedings, pp. 170-176. Morgan Kaufmann, San Francisco (2002)
23. Cabalar, P., Pearce, D., Valverde, A.: Reducing propositional theories in equilibrium logic to logic programs. In: Bento, C., Cardoso, A., Dias, G. (eds.) EPIA 2005. LNCS, vol. 3808, pp. 4-17. Springer, Heidelberg (2005)
24. Lee, J., Palla, R.: Yet another proof of the strong equivalence between propositional theories and logic programs. In: CENT 2007, Proceedings. CEUR Workshop Proceedings, CEUR-WS.org. vol. 265 (2007)
25. Pearce, D., de Guzmán, I.P., Valverde, A.: A tableau calculus for equilibrium entailment. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol. 1847, pp. 352-367. Springer, Heidelberg (2000)
26. Hähnle, R.: Automated Deduction in Multiple-Valued Logics. International Series of Monographs on Computer Science, vol. 10. Oxford University Press, Oxford (1994)
27. 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)
28. Pearce, D., Tompits, H., Woltran, S.: Chatacterising equilibrium logic and nested logic programs: reductions and complexity. Technical Report GIA 2007-01-12, Universidad Rey Juan Carlos (2007); (to appear in Theory and Practice of Logic programming)
29. Papadimitriu, C.: Comptuational Complexity. Addison-Wesley, Reading (1994)