Efficient datalog abduction through bounded treewidth

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1626-1631

  Gottlob, Georg ^a   Pichler, Reinhard ^b   Wei, Fang ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; FORMAL LOGIC; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

ABDUCTIVE DIAGNOSIS; ALGORITHMIC PROBLEMS; BOUNDED TREEWIDTHS; DATALOG ABDUCTION;

IDENTIFICATION (CONTROL SYSTEMS);

EID: 36349031108     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Armstrong, W. 1974. Dependency structures of data base relationships. In IFIP Congress, 580-583.
2. Balsa, J.; Dahl, V.; and Lopes, J. P. 1995. Datalog grammars for abductive syntactic error diagnosis and repair. In Proc. NLULP'95.
3. Bodlaender, H. L. 1993. A tourist guide through treewidth. Acta Cybern. 11(1-2):1-22.
4. Bonatti, P., and Samarati, P. 2000. Regulating service access and information release on the web. In Proc. CCS'00, 134-143.
5. Ceri, S.; Gottlob, G.; and Tanca, L. 1990. Logic programming and databases. Springer-Verlag New York, Inc.
6. Courcelle, B. 1990. Graph Rewriting: An Algebraic and Logic Approach. In Handbook of Theoretical Computer Science, Volume B. Elsevier Science Publishers. 193-242.
7. de Kleer, J.; Mackworth, A. K.; and Reiter, R. 1992. Characterizing diagnoses and systems. Artif. Intell. 56(2-3):197-222.
8. Dowling, W. F., and Gallier, J. H. 1984. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. Log. Program. 1(3):267-284.
9. Eiter, T., and Gottlob, G. 1995. The complexity of logic-based abduction. J. ACM 42(1):3-42.
10. Fischer, P. C.; Jou, J. H.; and Tsou, D.-M. 1983. Succinctness in dependency systems. Theor. Comput. Sci. 24:323-329.
11. Friedrich, G.; Gottlob, G.; and Nejdl, W. 1990. Hypothesis classification, abductive diagnosis and therapy. In Proc. Expert Systems in Engineering, 69-78.
12. Gottlob, G.; Gradei, E.; and Veith, H. 2002. Datalog lite: a deductive query language with linear time model checking. ACM Trans. Comput. Logic 3(1):42-79.
13. Gottlob, G.; Leone, N.; and Scarcello, F. 2002. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64(3):579-627.
14. Gottlob, G.; Pichler, R.; and Wei, F. 2006a. Bounded treewidth as a key to tractability of knowledge representation and reasoning. In Proc. AAAI'06, 250-256.
15. Gottlob, G.; Pichler, R.; and Wei, F. 2006b. Tractable database design through bounded treewidth. In Proc. PODS'06, 124-133.
16. Grohe, M. 1999. Descriptive and Parameterized Complexity. In Proc. CSL'99, volume 1683 of LNCS, 14-31.
17. Hermann, M., and Pichler, R. 2007. Counting complexity of propositional abduction. In Proc. IJCAI-07, 417-422.
18. Johnson, D. S. 1990. A catalog of complexity classes. In Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A). Elsevier Science Publishers B.V. (North-Holland). 67-161.
19. Koshutanski, H., and Massacci, F. 2003. An access control framework for business processes for web services. In Proc. XMLSEC '03, 15-24.
20. Lucchesi, C. L., and Osborn, S. L. 1978. Candidate keys for relations. J. Comput. Syst. Sci. 17(2):270-279.
21. Mannila, H., and Räihä;, K.-J. 1992. The design of relational databases. Addison-Wesley.
22. Minoux, M. 1988. LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation. Inf. Process. Lett. 29(1):1-12.