Pages that link to "Item:Q1060864"

The following pages link to Saturation, nonmonotonic reasoning and the closed-world assumption (Q1060864):

Displaying 39 items.

• Preferences in artificial intelligence (Q314443) (← links)
• Inductive equivalence in clausal logic and nonmonotonic logic programming (Q413854) (← links)
• Preferential semantics using non-smooth preference relations (Q484187) (← links)
• A theorem on the consistency of circumscription (Q578934) (← links)
• Negation in rule-based database languages: A survey (Q753476) (← links)
• The semantics of incomplete databases as an expression of preferences (Q753482) (← links)
• Negation by default and unstratifiable logic programs (Q753501) (← links)
• Logical representation and fusion of prioritized information based on guaranteed possibility measures: Application to the distance-based merging of classical bases (Q814499) (← links)
• Closed world assumptions having precedence in predicates (Q922726) (← links)
• On the satisfiability of circumscription (Q1073786) (← links)
• Negation as failure: careful closure procedure (Q1097727) (← links)
• A natural semantics for modal logic over databases (Q1102937) (← 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)
• General logical databases and programs: Default logic semantics and stratification (Q1173955) (← links)
• An efficient method for eliminating varying predicates from a circumscription (Q1193478) (← links)
• Resolving ambiguity in nonmonotonic inheritance hierarchies (Q1193489) (← links)
• Linear resolution for consequence finding (Q1199916) (← links)
• On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
• First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment (Q1311412) (← links)
• An algorithm for determining database consistency under the closed world assumption (Q1337643) (← links)
• Tableau-based characterization and theorem proving for default logic (Q1344885) (← links)
• Note about cardinality-based circumscription (Q1575190) (← links)
• Prioritized logic programming and its application to commonsense reasoning (Q1589476) (← links)
• Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
• ECWA made easy (Q1924727) (← links)
• Negation as failure for disjunctive logic programming (Q1924818) (← links)
• Brave induction: a logical framework for learning from incomplete information (Q1959490) (← links)
• A theory of hierarchical consequence and conditionals (Q2268351) (← links)
• Redundancy in logic. III: Non-monotonic reasoning (Q2389660) (← links)
• Partition-based logical reasoning for first-order and propositional theories (Q2457688) (← links)
• REACTIVE PREFERENTIAL STRUCTURES AND NONMONOTONIC CONSEQUENCE (Q3395334) (← links)
• Answering atomic queries in indefinite deductive databases (Q3486861) (← links)
• CUMULATIVITY WITHOUT CLOSURE OF THE DOMAIN UNDER FINITE UNIONS (Q3580677) (← links)
• Modal logic based theory for non-monotonic reasoning (Q4275697) (← links)
• New techniques and completeness results for preferential structures (Q4508257) (← links)
• Embedding circumscriptive theories in general disjunctive programs (Q5101461) (← links)