Compiling knowledge into decomposable negation normal form

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1999, Pages 284-289

  Darwiche, Adnan ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATIONS BOUNDS; BOUNDED TREEWIDTH; GRAPH-THEORETIC; LINEAR TIME; NORMAL FORM; PROPOSITIONAL THEORIES; REASONING TASKS; SATISFIABILITY;

GRAPH THEORY; QUERY PROCESSING;

ARTIFICIAL INTELLIGENCE;

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

References (7)

1. Jon Barwise, editor. Handbook of Mathematical Logic. North-Holland, Amsterdam, 1977.
2. Hans. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal of Computing, 25(6):1305-1317, 1996.
3. Adrian Darwiche. Compiling devices: A structure-based approach. In KR98, pages 156 166, 1998.
4. Adnan Darwiche. Compiling knowledge into decomposable negation normal form. Technical Report R-262, Cognitive Systems Laboratory, UCLA, 1999.
5. Rina Dechter and Irina Rish. Directional resolution: The davis-putnam procedure, revisited. In KR94, pages 134-145, 1994.
6. Fangzhen Lin and Ray Reiter. Forget it! In Working notes: AAAI Fall Symposium on Relevance, 1994.
7. Bart Selman and Henry Kautz. Knowledge compilation and theory approximation. Journal of the ACM, 43(2):193-224*, March, 1996.