Pages that link to "Item:Q1115207"

The following pages link to On the relationship between circumscription and negation as failure (Q1115207):

Displaying 37 items.

• Preferences in artificial intelligence (Q314443) (← links)
• Disjunctive closures for knowledge compilation (Q460617) (← links)
• On the parameterized complexity of non-monotonic logics (Q494658) (← links)
• The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
• Trichotomies in the complexity of minimal inference (Q692908) (← links)
• The semantics of incomplete databases as an expression of preferences (Q753482) (← links)
• Logic-based subsumption architecture (Q814558) (← links)
• Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (Q910251) (← links)
• Closed world assumptions having precedence in predicates (Q922726) (← links)
• Inferring negative information from disjunctive databases (Q1114440) (← links)
• Three-valued nonmonotonic formalisms and semantics of logic programs (Q1182168) (← links)
• An efficient method for eliminating varying predicates from a circumscription (Q1193478) (← links)
• Linear resolution for consequence finding (Q1199916) (← links)
• On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
• Relating minimal models and pre-requisite-free normal defaults (Q1205716) (← links)
• Formalizing incomplete knowledge in incomplete databases (Q1337644) (← links)
• Autoepistemic logic of knowledge and beliefs (Q1389599) (← links)
• Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
• ECWA made easy (Q1924727) (← links)
• Static semantics for normal and disjunctive logic programs (Q1924728) (← links)
• Well-founded and stationary models of logic programs (Q1924748) (← links)
• On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
• Brave induction: a logical framework for learning from incomplete information (Q1959490) (← links)
• Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
• Combining answer set programming with description logics for the semantic web (Q2389666) (← links)
• Characterising equilibrium logic and nested logic programs: Reductions and complexity, (Q3181745) (← links)
• Brave Induction (Q3543278) (← links)
• CWA Extensions to Multi-Valued Logics (Q3647206) (← links)
• Embedding prioritized circumscription in disjunctive logic programs (Q4421251) (← links)
• Embedding Logics in the Local Computation Framework (Q4443007) (← links)
• Two simple characterizations of well-founded semantics (Q5096858) (← links)
• Update rules in datalog programs (Q5101442) (← links)
• Embedding circumscriptive theories in general disjunctive programs (Q5101461) (← links)
• Strong and explicit negation in non-monotonic reasoning and logic programming (Q5236430) (← links)
• An abductive framework for negation in disjunctive logic programming (Q5236438) (← links)
• On the equivalence of the static and disjunctive well-founded semantics and its computation (Q5941206) (← links)