The following pages link to Deduction in non-Horn databases (Q1819951):
Displaying 31 items.
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- Parsing as non-Horn deduction (Q688151) (← 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)
- On the relationship between circumscription and negation as failure (Q1115207) (← links)
- An algorithm to compute circumscription (Q1115208) (← links)
- Minimalism, justification and non-monotonicity in deductive databases (Q1123011) (← links)
- Argumentation in disjunctive logic programming (Q1129838) (← links)
- Semantics of Horn and disjunctive logic programs (Q1177928) (← links)
- Paraconsistent disjunctive deductive databases (Q1185011) (← 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)
- Interpreting disjunctive logic programs based on a strong sense of disjunction (Q1311401) (← links)
- First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment (Q1311412) (← links)
- The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
- Ordered model trees: A normal form for disjunctive deductive databases (Q1344891) (← links)
- Disjunctive \(LP+\) integrity constraints = stable model semantics. (Q1353944) (← links)
- Generalized disjunctive well-founded semantics for logic programs. (Q1354026) (← links)
- The least fixpoint transformation for disjunctive logic programs (Q1389092) (← links)
- On compact representations of propositional circumscription (Q1391128) (← links)
- Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← 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)
- Nonmonotonic inheritance in object-oriented deductive database languages (Q2761747) (← links)
- Answering atomic queries in indefinite deductive databases (Q3486861) (← links)
- Novelty in deductive databases (Q4716048) (← links)
- An abductive framework for negation in disjunctive logic programming (Q5236438) (← links)
- Logic programming (Q6602251) (← links)
