Pages that link to "Item:Q1079022"

The following pages link to Closed-world databases and circumscription (Q1079022):

Displaying 27 items.

• Negation in rule-based database languages: A survey (Q753476) (← links)
• The semantics of incomplete databases as an expression of preferences (Q753482) (← links)
• Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (Q910251) (← links)
• Closed world assumptions having precedence in predicates (Q922726) (← links)
• Efficient reasoning about rich temporal domains (Q1113891) (← links)
• On the relationship between circumscription and negation as failure (Q1115207) (← links)
• An algorithm to compute circumscription (Q1115208) (← links)
• The importance of open and recursive circumscription (Q1117210) (← links)
• Minimalism, justification and non-monotonicity in deductive databases (Q1123011) (← links)
• Between constructive mathematics and PROLOG (Q1173742) (← links)
• An efficient method for eliminating varying predicates from a circumscription (Q1193478) (← links)
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs (Q1199545) (← links)
• On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
• The open logic and its relation to circumscription (Q1297717) (← links)
• The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
• Formalizing incomplete knowledge in incomplete databases (Q1337644) (← links)
• Circumscriptive semantics for updating knowledge bases (Q1360687) (← links)
• Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
• Sound and efficient closed-world reasoning for planning (Q1399125) (← links)
• Expressing preferences in default logic (Q1589465) (← links)
• Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
• The complexity of predicate default logic over a countable domain (Q1861328) (← links)
• ECWA made easy (Q1924727) (← links)
• Embedding prioritized circumscription in disjunctive logic programs (Q4421251) (← links)
• Embedding circumscriptive theories in general disjunctive programs (Q5101461) (← links)
• Preferred First-Order Answer Set Programs (Q5169967) (← links)
• (Q5750395) (← links)