Abduction with bounded treewidth: From theoretical tractability to practically efficient computation

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2008, Pages 1541-1546

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^c UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIONICS;

ABDUCTIVE DIAGNOSES; ALGORITHMIC PROBLEMS; BOUNDED TREEWIDTH; EFFICIENT ALGORITHMS; EFFICIENT COMPUTATIONS;

ARTIFICIAL INTELLIGENCE;

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

References (12)

1. Bodlaender, H. L. 1996. A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput. 25(6):1305-1317.
2. Courcelle, B. 1990. Graph Rewriting: An Algebraic and Logic Approach. In Handbook of Theoretical Computer Science, Volume B. Elsevier Science Publishers. 193-242.
3. de Kleer, J.; Mackworth, A. K.; and Reiter, R. 1992. Characterizing diagnoses and systems. Artif. Intell. 56(2-3): 197-222.
4. Downey, R. G., and Fellows, M. R. 1999. Parameterized Complexity. New York: Springer.
5. Eiter, T., and Gottlob, G. 1995. The complexity of logic-based abduction. J. ACM 42(1):3-42.
6. Flum, J.; Frick, M.; and Grohe, M. 2002. Query evaluation via tree-decompositions. J. ACM 49(6):716-752.
7. Gottlob, G.; Pichler, R.; and Wei, F. 2006. Bounded treewidth as a key to tractability of knowledge representation and reasoning. In Proc. AAAI'06, 250-256.
8. Gottlob, G.; Pichler, R.; and Wei, F. 2007. Monadic Datalog over Finite Structures with Bounded Treewidth. In Proc. PODS'07, 165-174.
9. Grohe, M. 1999. Descriptive and Parameterized Complexity. In Proc. CSL'99, volume 1683 of LNCS, 14-31.
10. Klarlund, N.; M0ller, A.; and Schwartzbach, M. I. 2002. MONA Implementation Secrets. International Journal of Foundations of Computer Science 13(4):571-586.
11. Maryns, H. 2006. On the Implementation of Tree Automata: Limitations of the Naive Approach. In Proc. 5th Int. Treebanks and Linguistic Theories Conference (TLT 2006), 235-246.
12. Szeider, S. 2004. On Fixed-Parameter Tractable Parameterizations of SAT. In Proc. 6th Int. Conf. SAT 2003, Selected Revised Papers, volume 2919 of LNCS, 188-202. Springer.