Pages that link to "Item:Q1097727"

The following pages link to Negation as failure: careful closure procedure (Q1097727):

Displaying 24 items.

• Disjunctive closures for knowledge compilation (Q460617) (← links)
• Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (Q910251) (← links)
• The Prolog not-predicate and negation as failure rule (Q918193) (← links)
• Closed world assumptions having precedence in predicates (Q922726) (← links)
• Conditional entailment: bridging two approaches to default reasoning. (Q989161) (← links)
• On the relationship between circumscription and negation as failure (Q1115207) (← links)
• An algorithm to compute circumscription (Q1115208) (← links)
• Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
• An efficient method for eliminating varying predicates from a circumscription (Q1193478) (← links)
• On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
• Fuzzy information in extended fuzzy relational databases (Q1296884) (← links)
• The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
• Evaluation of queries under closed-world assumption (Q1367075) (← links)
• Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
• Weak generalized closed world assumption (Q1825049) (← links)
• ECWA made easy (Q1924727) (← links)
• On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
• Logic programming and reasoning with incomplete information (Q1924820) (← links)
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
• Answering atomic queries in indefinite deductive databases (Q3486861) (← links)
• CWA Extensions to Multi-Valued Logics (Q3647206) (← links)
• Negation as failure. II (Q3740275) (← links)
• Negation as failure in the head (Q4208854) (← links)
• (Q4356434) (← links)