MidL: A SAT(ID) solver
暂无分享,去创建一个
[1] Timo Soininen,et al. Extending and implementing the stable model semantics , 2000, Artif. Intell..
[2] Maarten Mariën,et al. On the Relation Between ID-Logic and Answer Set Programming , 2004, JELIA.
[3] Alexander A. Razborov,et al. Why are there so many loop formulas? , 2006, TOCL.
[4] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[5] Martin Gebser,et al. Approaching the core of unfounded sets , 2006 .
[6] John S. Schlipf,et al. Answer Set Programming with Clause Learning , 2004, LPNMR.
[7] Yuliya Lierler,et al. cmodels - SAT-Based Disjunctive Answer Set Solver , 2005, LPNMR.
[8] Johan Wittocx,et al. The IDP framework for declarative problem solving , 2006 .
[9] Eugenia Ternovska,et al. Inductive situation calculus , 2004, Artif. Intell..
[10] Johan Wittocx,et al. Integrating Inductive Definitions in SAT , 2007, LPAR.
[11] Marc Denecker,et al. Extending Classical Logic with Inductive Definitions , 2000, Computational Logic.
[12] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[13] Joao Marques-Silva,et al. GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.
[14] Martin Gebser,et al. clasp : A Conflict-Driven Answer Set Solver , 2007, LPNMR.
[15] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[16] Lawrence Ryan. Efficient algorithms for clause-learning SAT solvers , 2004 .