메뉴 건너뛰기




Volumn 1, Issue , 1999, Pages 284-289

Compiling knowledge into decomposable negation normal form

Author keywords

[No Author keywords available]

Indexed keywords

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

EID: 84880691247     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (82)

References (7)
  • 2
    • 0001294529 scopus 로고    scopus 로고
    • A linear time algorithm for finding tree-decompositions of small treewidth
    • Hans. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal of Computing, 25(6):1305-1317, 1996.
    • (1996) SIAM Journal of Computing , vol.25 , Issue.6 , pp. 1305-1317
    • Bodlaender, H.L.1
  • 3
    • 0343641963 scopus 로고    scopus 로고
    • Compiling devices: A structure-based approach
    • Adrian Darwiche. Compiling devices: A structure-based approach. In KR98, pages 156 166, 1998.
    • (1998) KR98 , pp. 156-166
    • Darwiche, A.1
  • 5
    • 0002538477 scopus 로고
    • Directional resolution: The davis-putnam procedure
    • revisited
    • Rina Dechter and Irina Rish. Directional resolution: The davis-putnam procedure, revisited. In KR94, pages 134-145, 1994.
    • (1994) KR94 , pp. 134-145
    • Dechter, R.1    Rish, I.2
  • 7
    • 0030102186 scopus 로고    scopus 로고
    • Knowledge compilation and theory approximation
    • March
    • Bart Selman and Henry Kautz. Knowledge compilation and theory approximation. Journal of the ACM, 43(2):193-224*, March, 1996.
    • (1996) Journal of the ACM , vol.43 , Issue.2 , pp. 193-224
    • Selman, B.1    Kautz, H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.