The complexity of logic-based abduction
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- On the complexity of propositional knowledge base revision, updates, and counterfactualsArtificial Intelligence, 1992
- Complexity Results for Nonmonotonic LogicsJournal of Logic and Computation, 1992
- Abduction versus closure in causal theoriesArtificial Intelligence, 1992
- On the Relationship Between Abduction and DeductionJournal of Logic and Computation, 1991
- The computational complexity of abductionArtificial Intelligence, 1991
- Hypothesis classification, abductive diagnosis and therapyPublished by Springer Nature ,1990
- PNP[(log )] and sparse turing-complete sets for NPJournal of Computer and System Sciences, 1989
- A Mechanism for Forming Composite Explanatory HypothesesIEEE Transactions on Systems, Man, and Cybernetics, 1987
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- On the semantics of updates in databasesPublished by Association for Computing Machinery (ACM) ,1983