Deduction in non-Horn databases
From MaRDI portal
Publication:1819951
DOI10.1007/BF00244994zbMath0614.68072MaRDI QIDQ1819951
Lawrence J. Henschen, Adnan Yahya
Publication date: 1985
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Related Items
The complexity of propositional closed world reasoning and circumscription, Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete, Ordered model trees: A normal form for disjunctive deductive databases, Disjunctive \(LP+\) integrity constraints = stable model semantics., Generalized disjunctive well-founded semantics for logic programs., Inferring negative information from disjunctive databases, On the relationship between circumscription and negation as failure, An algorithm to compute circumscription, Answering atomic queries in indefinite deductive databases, On the computational cost of disjunctive logic programming: Propositional case, Logic programming and reasoning with incomplete information, Argumentation in disjunctive logic programming, The least fixpoint transformation for disjunctive logic programs, On compact representations of propositional circumscription, Is intractability of nonmonotonic reasoning a real drawback?, Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete, Disjunctive closures for knowledge compilation, Closed world assumptions having precedence in predicates, Semantics of Horn and disjunctive logic programs, Paraconsistent disjunctive deductive databases, An efficient method for eliminating varying predicates from a circumscription, On the complexity of propositional knowledge base revision, updates, and counterfactuals, Parsing as non-Horn deduction, An abductive framework for negation in disjunctive logic programming, Fuzzy information in extended fuzzy relational databases, Interpreting disjunctive logic programs based on a strong sense of disjunction, First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment
