Some results concerning the computational complexity of abduction
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Artificial Intelligence - Special volume on natural language processing
The complexity of logic-based abduction
Journal of the ACM (JACM)
Artificial Intelligence
The Inverse Satisfiability Problem
SIAM Journal on Computing
Diagnosing tree-structured systems
Artificial Intelligence
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
Conditional independence in propositional logic
Artificial Intelligence
The Complexity of Restricted Consequence Finding and Abduction
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
On computing all abductive explanations
Eighteenth national conference on Artificial intelligence
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Transformations between Signed and Classical Clause Logic
ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
Compilability of propositional abduction
ACM Transactions on Computational Logic (TOCL)
On computing all abductive explanations from a propositional Horn theory
Journal of the ACM (JACM)
Compact preference representation and Boolean games
Autonomous Agents and Multi-Agent Systems
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Propositional abduction is almost always hard
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Counting complexity of propositional abduction
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given propositional knowledge base. We give a general algorithm, based on the notion of projection; then we study restrictions over the representations of the knowledge base and of the query, and find new polynomial classes of abduction problems.