Engineering an incremental ASP solver

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

Volumn 5366 LNCS, Issue , 2008, Pages 190-205

  Gebser, Martin ^a   Kaminski, Roland ^a   Kaufmann, Benjamin ^a   Ostrowski, Max ^a   Schaub, Torsten ^a   Thiele, Sven ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; LOGIC PROGRAMMING; PROGRAMMING THEORY; MODEL CHECKING;

ANSWER SET PROGRAMMING (ASP); FORMAL FRAMEWORK; MODULE THEORY; PROGRAM SLICING;

MODEL CHECKING; LOGIC PROGRAMMING;

ANSWER SET PROGRAMMING; EXPERIMENTAL EVALUATION; FORMAL FRAMEWORK; INCREMENTAL APPROACH; PROBLEM INSTANCES; PROGRAM SLICE; REAL-WORLD;

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

References (16)

1. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
2. Kautz, H., Selman, B.: Planning as satisfiability. In: Proc. of ECAI 1992, pp. 359-363. Wiley, Chichester (1992)
3. Clarke, E., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods in System Design 19(1), 7-34 (2001)
4. Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic causal theories. Artificial Intelligence 153(1-2), 49-104 (2004)
5. Gelfond, M., Lifschitz, V.: Action languages. Electron. Trans. on AI 3(6), 193-210 (1998)
6. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Proc. of IJCAI 2007. AAAI Press, Menlo Park (2007)
7. http://www.cs.uni-potsdam.de/wv/software
8. Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: Proc. of ECAI 2006, pp. 412-416. IOS Press, Amsterdam (2006)
9. Lifschitz, V., Turner, H.: Splitting a logic program. In: Proc. of ICLP, pp. 23-37. MIT Press, Cambridge (1994)
10. Brass, S., Dix, J.: Semantics of (disjunctive) logic programs based on partial evaluation. Journal of Logic Programming 40(1), 1-46 (1999)
11. Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying logic programs under uniform and strong equivalence. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS, vol. 2923, pp. 87-99. Springer, Heidelberg (2003)
12. http://www.tcs.hut.fi/Software
13. Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157(1-2), 115-137 (2004)
14. Eén, N., Sörensson, N.: Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science 89(4) (2003)
15. http://www.ne.jp/asahi/ai/yoshio/sokoban/handmade/
16. http://asparagus.cs.uni-potsdam.de/