Functional treewidth: Bounding complexity in the presence of functional dependencies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4121 LNCS, Issue , 2006, Pages 116-129

  Zabiyaka, Yuliya ^a   Darwiche, Adnan ^a  

^a Department of Civil and Environmental Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FORMAL LOGIC; GRAPH THEORY; PROBLEM SOLVING;

COMPLEXITY PARAMETERS; FUNCTIONAL TREEWIDTH; NONSTRUCTURAL ASPECTS;

TREES (MATHEMATICS);

EID: 33749567939     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814948_14     Document Type: Conference Paper

References (13)

1. Stefan Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a fc-tree. SIAM J. Algebraic and Discrete Methods, 8:277-284, 1987.
2. H. L. Bodlaender. A tourist guide through treewidth. ACTA CYBERNETICA, 11(1-2):1-22, 1993.
3. Adnan Darwiche. Decomposable negation normal form. Journal of the ACM, 48(4):608-647, 2001.
4. Adnan Darwiche. On the tractability of covinting theory models and its application to belief revision and truth maintenance. Journal of Applied Non-Classical Logics. 11(1-2):11-34, 2001.
5. Adnan Darwiche. A logical approach to factoring belief networks. In Proceedings of KR, pages 409-420, 2002.
6. Adnan Darwiche and Mark Hopkins. Using recursive decomposition to construct elimination orders, jointrees and dtrees. In Trends in Artificial Intelligence, Lecture notes in AI, 2143, pages 180-191. Springer-Verlag, 2001.
7. Adnan Darwiche and Pierre Marquis. A knowledge compilation map. Journal of Artificial Intelligence Research, 17:229-264, 2002.
8. Rina Dechter. Constraint Processing. Morgan Kaufmann Publishers, Inc., San Mateo, California, 2003.
9. F. V. Jensen, S.L. Lauritzen, and K.G. Olesen. Bayesian updating in recursive graphical models by local computation. Computational Statistics Quarterly, 4:269-282, 1990.
10. Claudio L. Lucchesi and Sylvia L. Osborn. Candidate keys for relations. Journal of Computer and System Sciences, 17:270-279, 1978.
11. David Maier. The Theory of Relational Databases. Computer Science Press, Rockville, MD, 1983.
12. N. Robertson and P. D. Seymour. Graph minors II: Algorithmic aspects of tree-width. J. Algorithms, 7:309-322, 1986.
13. T. Sang, P. Beam, and H. Kautz. Solving bayesian networks by weighted model counting. In Proceedings of AAAI. AAAI, 2005.