论文信息 - Progression Semantics for Disjunctive Logic Programs

Progression Semantics for Disjunctive Logic Programs

In this paper, we extend the progression semantics for first-order disjunctive logic programs and show that it coincides with the stable model semantics. Based on it, we further show how disjunctive answer set programming is related to Satisfiability Modulo Theories.

Yi Zhou | Yan Zhang

[1] Yan Zhang,et al. On the Progression Semantics and Boundedness of Answer Set Programs , 2010, KR.

[2] David Pearce,et al. Towards a First Order Equilibrium Logic for Nonmonotonic Reasoning , 2004, JELIA.

[3] Yi Zhou,et al. Ordered completion for first-order logic programs on finite structures , 2010, Artif. Intell..

[4] Fangzhen Lin,et al. First-Order Loop Formulas for Normal Logic Programs , 2006, KR.

[5] Michael Gelfond,et al. Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[6] Ilkka Niemelä,et al. Stable models and difference logic , 2008, Annals of Mathematics and Artificial Intelligence.

[7] Jack Minker,et al. A Fixpoint Semantics for Disjunctive Logic Programs , 1990, J. Log. Program..

[8] Joohyung Lee,et al. Stable models and circumscription , 2011, Artif. Intell..

[9] Cesare Tinelli,et al. Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.

[10] Yi Zhou,et al. From Answer Set Logic Programming to Circumscription via Logic of GK , 2007, IJCAI.

[11] Georg Gottlob,et al. Disjunctive datalog , 1997, TODS.