Pages that link to "Item:Q1115207"
From MaRDI portal
The following pages link to On the relationship between circumscription and negation as failure (Q1115207):
Displayed 22 items.
- 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)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- Brave Induction (Q3543278) (← links)
- Embedding prioritized circumscription in disjunctive logic programs (Q4421251) (← links)
- Embedding Logics in the Local Computation Framework (Q4443007) (← links)
- On the equivalence of the static and disjunctive well-founded semantics and its computation (Q5941206) (← links)