Pages that link to "Item:Q1073786"

The following pages link to On the satisfiability of circumscription (Q1073786):

Displaying 24 items.

• A theorem on the consistency of circumscription (Q578934) (← links)
• Using approximate reasoning to represent default knowledge (Q578935) (← links)
• Decidability and definability with circumscription (Q579240) (← links)
• Circumscription: Completeness reviewed (Q685339) (← links)
• A new deductive approach to planning (Q922685) (← links)
• Negation as failure: careful closure procedure (Q1097727) (← links)
• Autocircumscription (Q1105394) (← links)
• The importance of open and recursive circumscription (Q1117210) (← links)
• Between constructive mathematics and PROLOG (Q1173742) (← links)
• Nonmonotonic reasoning, preferential models and cumulative logics (Q1174512) (← links)
• Three-valued nonmonotonic formalisms and semantics of logic programs (Q1182168) (← links)
• Nonmonotonicity and the scope of reasoning (Q1189875) (← links)
• Abstract minimality and circumscription (Q1193477) (← links)
• Automatically generating abstractions for planning (Q1332851) (← links)
• Deriving properties of belief update from theories of action (Q1334984) (← links)
• Exploiting the normative aspect of preference: A deontic logic without actions (Q1353855) (← links)
• Circumscriptive semantics for updating knowledge bases (Q1360687) (← links)
• Prioritized logic programming and its application to commonsense reasoning (Q1589476) (← links)
• Default reasoning by deductive planning (Q1896366) (← links)
• ECWA made easy (Q1924727) (← links)
• Annotation theories over finite graphs (Q2269516) (← links)
• An extension of pointwise circumscription (Q2676573) (← links)
• Model enumeration in propositional circumscription via unsatisfiable core analysis (Q4592705) (← links)
• Is there an alternative to parsimonious semantics? (Q4864836) (← links)