Conflict-driven answer set enumeration

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

Volumn 4483 LNAI, Issue , 2007, Pages 136-148

  Gebser, Martin ^a   Kaufmann, Benjamin ^a   Neumann, André ^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

ALGORITHMS; CASE BASED REASONING; KNOWLEDGE BASED SYSTEMS; SET THEORY;

ANSWER SETS; EMPIRICAL EVALUATION; SATISFIABILITY CHECKING;

LOGIC PROGRAMMING;

EID: 38049077926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72200-7_13     Document Type: Conference Paper

References (20)

1. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press (2003)
2. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2) (2002) 181-234
3. 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) (2006) 499-562
4. Mitchell, D.: A SAT solver primer. Bulletin of EATCS 85 (2005) 112-133
5. Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157(1-2) (2004) 115-137
6. Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on prepositional satisfiability. Journal of Automated Reasoning (2007) To appear.
7. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. Proceedings UCAI'07, AAAI Press/The MIT Press (2007) 386-392
8. Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)
9. Clark, K.: Negation as failure. In Gallaire, H., Minker, J., eds.: Logic and Data Bases. Plenum Press (1978) 293-322
10. Apt, K., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In: Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann (1987) 89-148
11. Fages, F.: Consistency of Clark's completion and the existence of stable models. Journal of Methods of Logic in Computer Science 1 (1994) 51-60
12. Lee, J.: A model-theoretic counterpart of loop formulas. Proceedings IJCAI'05, Professional Book Center (2005) 503-508
13. Dechter, R., Frost, D.: Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence 136(2) (2002) 147-188
14. Ryan, L.: Efficient algorithms for clause-learning SAT solvers. MSc thesis, Simon Fraser University (2004)
15. Bayardo, R., Schrag, R.: Using CSP look-back techniques to solve real-world SAT instances. Proceedings AAAI'97, AAAI Press/The MIT Press (1997) 203-208
16. Ward, J., Schlipf, J.: Answer set programming with clause learning. Proceedings LP-NMR'04. Springer (2004) 302-313
17. (http://www.cs.uni-potsdam.de/clasp)
18. Sang, T., Bacchus, F., Beame, P., Kautz, H., Pitassi, T.: Combining component caching and clause learning for effective model counting. Proceedings SAT'04. (2004)
19. Lin, Z., Zhang, Y., Hernandez, H.: Fast SAT-based answer set solver. Proceedings AAAI'06, AAAI Press/The MIT Press (2006)
20. Ricca, F., Faber, W., Leone, N.: A backjumping technique for disjunctive logic programming. AI Communications 19(2) (2006) 155-172