论文信息 - clasp : A Conflict-Driven Answer Set Solver

clasp : A Conflict-Driven Answer Set Solver

We describe the conflict-driven answer set solver clasp, which is based on concepts from constraint processing (CSP) and satisfiability checking (SAT). We detail its system architecture and major features, and provide a systematic empirical evaluation of its features.

[1] Jinbo Huang,et al. The Effect of Restarts on the Efficiency of Clause Learning , 2007, IJCAI.

[2] Eugene Goldberg,et al. BerkMin: A Fast and Robust Sat-Solver , 2002, Discret. Appl. Math..

[3] Lawrence Ryan. Efficient algorithms for clause-learning SAT solvers , 2004 .

[4] Wolfgang Faber,et al. The DLV system for knowledge representation and reasoning , 2002, TOCL.

[5] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[6] Timo Soininen,et al. Extending and implementing the stable model semantics , 2000, Artif. Intell..

[7] J. Freeman. Improvements to propositional satisfiability search algorithms , 1995 .

[8] Martin Gebser,et al. Approaching the core of unfounded sets , 2006 .

[9] John S. Schlipf,et al. Answer Set Programming with Clause Learning , 2004, LPNMR.

[10] Martin Gebser,et al. Conflict-Driven Answer Set Enumeration , 2007, LPNMR.

[11] Chitta Baral,et al. Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[12] David Zuckerman,et al. Optimal Speedup of Las Vegas Algorithms , 1993, Inf. Process. Lett..

[13] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.

[14] David G. Mitchell,et al. A SAT Solver Primer , 2005, Bull. EATCS.

[15] Martin Gebser,et al. Conflict-Driven Answer Set Solving , 2007, IJCAI.