Abstract Answer Set Solvers
暂无分享,去创建一个
[1] Martin Gebser,et al. Tableau Calculi for Answer Set Programming , 2006, ICLP.
[2] Fangzhen Lin,et al. ASSAT: computing answer sets of a logic program by SAT solvers , 2002, Artif. Intell..
[3] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[4] Keith L. Clark,et al. Negation as Failure , 1987, Logic and Data Bases.
[5] Timo Soininen,et al. Extending and implementing the stable model semantics , 2000, Artif. Intell..
[6] John S. Schlipf,et al. Answer Set Programming with Clause Learning , 2004, LPNMR.
[7] Krzysztof R. Apt,et al. Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[8] Cesare Tinelli,et al. Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.
[9] François Fages,et al. Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..
[10] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[11] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[12] Yuliya Lierler,et al. Answer Set Programming Based on Propositional Satisfiability , 2006, Journal of Automated Reasoning.
[13] Jack Minker,et al. Logic and Data Bases , 1978, Springer US.
[14] Francesco Scarcello,et al. Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation , 1997, Inf. Comput..
[15] Enrico Giunchiglia,et al. On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels) , 2005, ICLP.
[16] Donald Loveland. A Machine Program for Theorem-Provingt , 2000 .