Sciweavers

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

11

AAAI
2004

favoriteEmaildiscussreport

181views Intelligent Agents» more AAAI 2004»

Loop Formulas for Circumscription

13 years 6 months ago

Loop Formulas for Circumscription

Download peace.eas.asu.edu

Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop formulas" so that general cases of nonmonotonic logics such as logic programs (under the answer set semantics) and McCain

Joohyung Lee, Fangzhen Lin

Real-time Traffic

AAAI 2004 | Intelligent Agents | Logic | Loop Formulas | Nonmonotonic Logics |

claim paper

Related Content

» General Preferential Entailments as Circumscriptions

» Smallest Equivalent Sets for Finite Propositional Formula Circumscription

» A Theorem Prover for Prioritized Circumscription

» Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stabl...

» A New Perspective on Stable Models

» A generalization of the LinZhao theorem

» Loop Formulas for Disjunctive Logic Programs

» Loop Formulas for Description Logic Programs

» Loop Formulas for Logic Programs with Arbitrary Constraint Atoms

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2004
Where	AAAI
Authors	Joohyung Lee, Fangzhen Lin

Comments (0)