Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

ICLP
2003
Springer

favoriteEmaildiscussreport

103views Automated Reasoning» more ICLP 2003»

Loop Formulas for Disjunctive Logic Programs

13 years 9 months ago

Loop Formulas for Disjunctive Logic Programs

Download peace.eas.asu.edu

Abstract. We extend Clark’s deﬁnition of a completed program and the deﬁnition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer sets for a disjunctive program can be characterized as the models of its completion that satisfy the loop formulas. The concept of a tight program and Fages’ theorem are extended to disjunctive programs as well.

Joohyung Lee, Vladimir Lifschitz

Real-time Traffic

Disjunctive Logic Programs | Disjunctive Programs | ICLP 2003 | Loop Formulas | Programming Languages |

claim paper

Related Content

» Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs

» A generalization of the LinZhao theorem

» HeadElementarySetFree Logic Programs

» Loop Formulas for Description Logic Programs

» Equivalence for the G3stable models semantics

» Loop Formulas for Circumscription

» Loop Formulas for Logic Programs with Arbitrary Constraint Atoms

» SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions

» ASSAT computing answer sets of a logic program by SAT solvers

Post Info
More Details (n/a)

Added	07 Jul 2010
Updated	07 Jul 2010
Type	Conference
Year	2003
Where	ICLP
Authors	Joohyung Lee, Vladimir Lifschitz

Comments (0)