Information Processing Letters
Logic programming and databases
Logic programming and databases
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
The design of relational databases
The design of relational databases
Characterizing diagnoses and systems
Artificial Intelligence
The complexity of logic-based abduction
Journal of the ACM (JACM)
Regulating service access and information release on the Web
Proceedings of the 7th ACM conference on Computer and communications security
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Hypothesis Classification, Abductive Diagnosis and Therapy
Proceedings of the International Workshop on Expert Systems in Engineering, Principles and Applications
An access control framework for business processes for web services
Proceedings of the 2003 ACM workshop on XML security
Tractable database design through bounded treewidth
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Bounded treewidth as a key to tractability of knowledge representation and reasoning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Counting complexity of propositional abduction
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Size and treewidth bounds for conjunctive queries
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tractable database design and datalog abduction through bounded treewidth
Information Systems
Size and Treewidth Bounds for Conjunctive Queries
Journal of the ACM (JACM)
| Hi-index | 0.00 |
Abductive diagnosis is an important method for identifying possible causes which explain a given set of observations. Unfortunately, abduction suffers from the fact that most of the algorithmic problems in this area are intractable. We have recently obtained very promising results for a strongly related problem in the database area. Specifically, the PRIMALITY problem becomes efficiently solvable and highly parallelizable if the underlying functional dependencies have bounded treewidth (Gottlob, Pichler, & Wei 2006b). In the current paper, we show that these favorable results can be carried over to logic-based abduction. In fact, we even show a further generalization of these results.