Tableau calculi for answer set programming

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

Volumn 4079 LNCS, Issue , 2006, Pages 11-25

  Gebser, Martin ^a   Schaub, Torsten ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; GRANULATION; PROBLEM SOLVING;

ANSWER SET PROGRAMMING (ASP); SET HANDLING; SET PROGRAMMING; TABLEAU CALCULUS;

SET THEORY;

EID: 33749360592     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11799573_4     Document Type: Conference Paper

References (33)

1. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press (2003)
2. Mitchell, D.: A SAT solver primer. Bulletin of the European Association for Theoretical Computer Science 85 (2005) 112-133
3. Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157(1-2) (2004) 115-137
4. Giunchiglia, E., Lierler, Y., Maratea, M.: A SAT-based polynomial space algorithm for answer set programming. In Delgrande, J., Schaub, T., eds.: Proceedings of the Tenth International Workshop on Non-MonotonicReasoning. (2004) 189-196
5. Simons, P., Niemelä I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2) (2002) 181-234
6. Faber, W.: Enhancing Efficiency and Expressiveness in Answer Set Programming Systems. Dissertation, Technische Universität Wien (2002)
7. Anger, C., Gebser, M., Linke, T., Neumann, A., Schaub, T.: The nomore++ approach to answer set solving. In Sutcliffe, G., Voronkov, A., eds.: Proceedings of the Twelfth International Conference on Logic for Programming, Artificial Intelligence, and Reasoning. Springer (2005) 95-109
8. D'Agostino, M., Gabbay, D., Hähnle, R., Posegga, J., eds.: Handbook of Tableau Methods. Kluwer Academic (1999)
9. Leone, N., Faber, W., Pfeifer, G., Eiter, T., Gottlob, G., Koch, C., Mateis, C., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic (2006) To appear.
10. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7 (1960) 201-215
11. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM 5 (1962) 394-397
12. 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) (2005) 373-399
13. Junttila, T., Niemelä, I.: Towards an efficient tableau method for boolean circuit satisfiability checking. In Lloyd J., et al., eds.: Proceedings of the First International Conference on Computational Logic. Springer (2000) 553-567
14. Beame, P., Pitassi, T.: Propositional proof complexity: Past, present, and future. Bulletin of the European Association for Theoretical Computer Science 65 (1998) 66-89
15. Hähnle, R.: Tableaux and related methods. In Robinson, A., Voronkov, A., eds.: Handbook of Automated Reasoning. Elsevier and MIT Press (2001) 100-178
16. Fitting, M.: Tableaux for logic programming. J. Automated Reasoning 13(2) (1994) 175-188
17. Pearce, D., de Guzmán, I., Valverde, A.: A tableau calculus for equilibrium entailment. In Dyckhoff, R., ed.: Proceedings of the Ninth International Conference on Automated Reasoning with Analytic Tableaux and Related Methods. Springer (2000) 352-367
18. Olivetti, N.: Tableaux for nonmonotonic logics. [8] 469-528
19. Bonatti, P.: Resolution for skeptical stable model semantics. J. Automated Reasoning 27(4) (2001) 391-421
20. Calimeri, F., Faber, W., Leone, N., Pfeifer, G.: Pruning operators for answer set programming systems. Technical Report INFSYS RR-1843-01-07, Technische Universität Wien (2001)
21. van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. Journal of the ACM 38(3) (1991) 620-650
22. Lee, J.: A model-theoretic counterpart of loop formulas. In Kaelbling, L., Saffiotti, A., eds.: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Professional Book Center (2005) 503-508
23. Fitting, M.: Fixpoint semantics for logic programming: A survey. Theoretical Computer Science 278(1-2) (2002) 25-51
24. Clark, K.: Negation as failure. In Gallaire, H., Minker, J., eds.: Logic and Data Bases. Plenum Press (1978) 293-322
25. Apt, K., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In Minker, J., ed.: Found, of Deductive Databases and Logic Programming. Morgan Kaufmann (1987) 89-148
26. Lifschitz, V., Razborov, A.: Why are there so many loop formulas? ACM Transactions on Computational Logic (2006) To appear.
27. Pages, F.: Consistency of Clark's completion and the existence of stable models. Journal of Methods of Logic in Computer Science 1 (1994) 51-60
28. Babovich, Y., Lifschitz, V.: Computing answer sets using program completion. Draft (2003)
29. Giunchiglia, E., Maratea, M.: On the relation between answer set and SAT procedures (or, between cmodels and smodels). In Gabbrielli, M., Gupta, G., eds.: Proceedings of the Twenty-first International Conference on Logic Programming. Springer (2005) 37-51
30. Konczak, K., Linke, T., Schaub, T.: Graphs and colorings for answer set programming. Theory and Practice of Logic Programming 6(1-2) (2006) 61-106
31. Anger, C., Gebser, M., Schaub, T.: What's a head without a body. In Brewka, G., ed.: Proceedings of the Seventeenth European Conference on Artificial Intelligence, IOS Press (2006) To appear.
32. Simons, P.: Extending and Implementing the Stable Model Semantics. Dissertation, Helsinki University of Technology (2000)
33. Anger, C., Gebser, M., Schaub, T.: Approaching the core of unfounded sets. In Dix, J., Hunter, A., eds.: Proceedings of the Eleventh International Workshop on Non-Monotonic Reasoning. (2006) To appear.