Support set selection for abductive and default reasoning
From MaRDI portal
Recommendations
Cites work
- A logic for default reasoning
- A theory of diagnosis from first principles
- An incremental method for generating prime implicants/implicates
- Hard problems for simple default logics
- scientific article; zbMATH DE number 4174350 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 714922 (Why is no real title available?)
- scientific article; zbMATH DE number 194618 (Why is no real title available?)
- scientific article; zbMATH DE number 4185071 (Why is no real title available?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- NP is as easy as detecting unique solutions
- Parity, circuits, and the polynomial-time hierarchy
- Propositional truth maintenance systems: Classification and complexity analysis
Cited in
(8)- The approximation of implicates and explanations
- Horn approximations of empirical data
- Reasoning with ordered binary decision diagrams
- On some tractable classes in deduction and abduction
- First order LUB approximations: characterization and algorithms
- Unranking of small combinations from large sets
- Complexity results for explanations in the structural-model approach
- On the complexity of second-best abductive explanations
This page was built for publication: Support set selection for abductive and default reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674205)