60 search results - page 1 / 12 » Loop Formulas for Circumscription |
AAAI
2004
13 years 6 months ago
2004
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 ...
ECSQARU
2001
Springer
13 years 9 months ago
2001
Springer
Abstract A (general) preferential entailment is defined by a “preference relation” among “states”. States can be either interpretations or sets of interpretations, or “c...
CL
2000
Springer
13 years 9 months ago
2000
Springer
IJCAI
1989
13 years 6 months ago
1989
In a recent paper, Ginsberg shows how a backward-chaining ATMS can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized cir...
JAIR
2012
11 years 7 months ago
2012
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...