On some tractable classes in deduction and abduction
- 31 January 2000
- journal article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 116 (1-2), 297-313
- https://doi.org/10.1016/s0004-3702(99)00088-0
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Hierarchies of polynomially solvable satisfiability problemsAnnals of Mathematics and Artificial Intelligence, 1996
- Support set selection for a bductive and default reasoningArtificial Intelligence, 1996
- Recognizing renamable generalized propositional Horn formulas is NP-completeDiscrete Applied Mathematics, 1995
- The complexity of logic-based abductionJournal of the ACM, 1995
- A hierarchy of tractable satisfiability problemsInformation Processing Letters, 1992
- Abduction versus closure in causal theoriesArtificial Intelligence, 1992
- On the Relationship Between Abduction and DeductionJournal of Logic and Computation, 1991
- Extended Horn sets in propositional logicJournal of the ACM, 1991
- Renaming a Set of Clauses as a Horn SetJournal of the ACM, 1978
- Unit Refutations and Horn SetsJournal of the ACM, 1974