Solving Hard Disjunctive Logic Programs Faster (Sometimes)
暂无分享,去创建一个
[1] Jürgen Dix,et al. Planning in Answer Set Programming using Ordered Task Decomposition , 2003, We Will Show Them!.
[2] Gerald Pfeifer,et al. Progress Report on the Disjunctive Deductive Database System dlv , 1998, FQAS.
[3] Wolfgang Faber,et al. A logic programming approach to knowledge-state planning: Semantics and complexity , 2004, TOCL.
[4] Timo Soininen,et al. Extending and implementing the stable model semantics , 2000, Artif. Intell..
[5] V. Lifschitz,et al. Foundations of Logic Programming , 1997 .
[6] Francesco Scarcello,et al. Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation , 1997, Inf. Comput..
[7] Wolfgang Faber,et al. Experimenting with Heuristics for Answer Set Programming , 2001, IJCAI.
[8] Bernhard Nebel,et al. Encoding Planning Problems in Nonmonotonic Logic Programs , 1997, ECP.
[9] Arthur B. Markman,et al. Knowledge Representation , 1998 .
[10] Chitta Baral,et al. Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .
[11] Fangzhen Lin,et al. ASSAT: computing answer sets of a logic program by SAT solvers , 2002, Artif. Intell..
[12] Gerald Pfeifer,et al. Enhancing disjunctive logic programming systems by SAT checkers , 2003, Artif. Intell..
[13] Wolfgang Faber,et al. Pruning operators for answer set programming systems , 2002, NMR.
[14] Georg Gottlob,et al. Disjunctive datalog , 1997, TODS.
[15] Georg Gottlob,et al. On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.
[16] Peter Szolovits,et al. What Is a Knowledge Representation? , 1993, AI Mag..
[17] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[18] Christos H. Papadimitriou,et al. Computational complexity , 1993 .
[19] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..