Splitting a Logic Program Revisited
暂无分享,去创建一个
[1] Krzysztof R. Apt,et al. Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[2] Ilkka Niemelä,et al. Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.
[3] Fangzhen Lin,et al. ASSAT: computing answer sets of a logic program by SAT solvers , 2002, Artif. Intell..
[4] Joohyung Lee,et al. Loop Formulas for Disjunctive Logic Programs , 2003, ICLP.
[5] Martin Gebser,et al. Conflict-Driven Answer Set Solving , 2007, IJCAI.
[6] Michael Gelfond,et al. Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.
[7] Fangzhen Lin,et al. Computing Loops with at Most One External Support Rule , 2013, TOCL.
[8] Martin Gebser,et al. Engineering an Incremental ASP Solver , 2008, ICLP.
[9] Tomi Janhunen,et al. Achieving compositionality of the stable model semantics for smodels programs1 , 2008, Theory and Practice of Logic Programming.
[10] Vladimir Lifschitz,et al. Splitting a Logic Program , 1994, ICLP.
[11] Joohyung Lee,et al. Symmetric Splitting in the General Theory of Stable Models , 2009, IJCAI.
[12] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[13] Thomas Eiter,et al. Modular Nonmonotonic Logic Programming Revisited , 2009, ICLP.