Generic tableaux for answer set programming

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

Volumn 4670 LNCS, Issue , 2007, Pages 119-133

  Gebser, Martin ^a   Schaub, Torsten ^a,b,c  

^a UNIVERSITY OF POTSDAM   (Germany)

^b SIMON FRASER UNIVERSITY   (Canada)

^c GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS;

ANSWER SET PROGRAMMING; CARDINALITY CONSTRAINTS; LANGUAGE CONSTRUCTS; LITERALS; MODULAR FRAMEWORK; SMODELS; TABLEAU METHOD;

LOGIC PROGRAMMING;

EID: 38149118255     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74610-2_9     Document Type: Conference Paper

References (19)

1. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
2. Mitchell, D.: A SAT solver primer. Bulletin of the European Association for Theoretical Computer Science 85, 112-133 (2005)
3. Beame, P., Kautz, H., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. Journal of Artificial Intelligence Research 22, 319-351 (2004)
4. Gebser, M., Schaub, T.: Tableau calculi for answer set programming. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 11-25. Springer, Heidelberg (2006)
5. D'Agostino, M., Gabbay, D., Hahnle, R., Posegga, J. (eds.): Handbook of Tableau Methods. Kluwer Academic Publishers, Dordrecht (1999)
6. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181-234 (2002)
7. Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. Theory and Practice of Logic Programming 5(1-2), 45-74 (2005)
8. Liu, L., Truszczynski, M.: Properties of programs with monotone and convex constraints. In: Veloso, M., Kambhampati, S. (eds.) Proceedings of the National Conference on Artificial Intelligence (AAAI'05), pp. 701-706. AAAI/MIT Press (2005)
9. Faber, W.: Unfounded sets for disjunctive logic programs with arbitrary aggregates. [19] 40-52
10. Ferraris, P.: Answer sets for propositional theories. [19] 119-131
11. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293-322. Plenum Press, New York (1978)
12. van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620-650 (1991)
13. Beame, P., Pitassi, T.: Propositional proof complexity: Past, present, and future. Bulletin of the European Association for Theoretical Computer Science 65, 66-89 (1998)
14. Järvisalo, M., Junttila, T., Niemelä, I.: Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence 44(4), 373-399 (2005)
15. Syrjänen, T.: Lparse 1.0 user's manual, http://www.tcs.hut.fi/ Software/smodels/lparse.ps.gz
16. Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation 135(2), 69-112 (1997)
17. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Peni, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7(3), 499-562 (2006)
18. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Veloso, M. (ed.) Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'07), pp. 386-392. AAAI/MIT Press (2007)
19. Baral, C., Greco, G., Leone, N., Terracina, G. (eds.): LPNMR 2005. LNCS (LNAI), vol. 3662. Springer, Heidelberg (2005)