On some tractable classes in deduction and abduction
From MaRDI portal
Publication:1978251
Recommendations
Cites work
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 1256705 (Why is no real title available?)
- A hierarchy of tractable satisfiability problems
- Abduction versus closure in causal theories.
- Extended Horn sets in propositional logic
- Hierarchies of polynomially solvable satisfiability problems
- On the Relationship Between Abduction and Deduction
- Polynomial-time inference of all valid implications for Horn and related formulae
- Recognizing renamable generalized propositional Horn formulas is NP- complete
- Renaming a Set of Clauses as a Horn Set
- Support set selection for abductive and default reasoning
- The complexity of logic-based abduction
- Unit Refutations and Horn Sets
Cited in
(4)
This page was built for publication: On some tractable classes in deduction and abduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978251)