메뉴 건너뛰기
IJCAI International Joint Conference on Artificial Intelligence
Volumn , Issue , 2007, Pages 180-185
Backtracking procedures for hypertree, HyperSpread and connected hypertree decomposition of CSPs
Author keywords

[No Author keywords available]
Indexed keywords

COMPONENT DETECTION; DECOMPOSITION METHODS; EXACT METHODS; HYPERTREE DECOMPOSITION; OPTIMAL DECOMPOSITION;
EID: 49049094657     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (15)
References (11)
  • 1
    • 84880743076 scopus 로고    scopus 로고
    • A unified theory of structural tractability for constraint satisfaction and spread cut decomposition
    • D. Cohen, P. Jeavons, and M. Gyssens. A unified theory of structural tractability for constraint satisfaction and spread cut decomposition. In IJCAI, pages 72-77, 2005.
    • (2005) IJCAI , pp. 72-77
    • Cohen, D.1    Jeavons, P.2    Gyssens, M.3
  • 3
    • 0022144787 scopus 로고
    • A sufficient condition for backtrack-bounded search
    • E. C. Freuder. A sufficient condition for backtrack-bounded search. Journal of ACM, 32(4):755-761, 1985.
    • (1985) Journal of ACM , vol.32 , Issue.4 , pp. 755-761
    • Freuder, E.C.1
  • 4
    • 27144446304 scopus 로고    scopus 로고
    • A complete anytime algorithm for treewidth
    • V. Gogate and R. Dechter. A complete anytime algorithm for treewidth. In UAI, pages 201-208, 2004.
    • (2004) UAI , pp. 201-208
    • Gogate, V.1    Dechter, R.2
  • 5
    • 84880907837 scopus 로고    scopus 로고
    • On tractable queries and constraints
    • G. Gottlob, N. Leone, and F. Scarcello. On tractable queries and constraints. In DEXA, pages 1-15, 1999.
    • (1999) DEXA , pp. 1-15
    • Gottlob, G.1    Leone, N.2    Scarcello, F.3
  • 6
    • 0034515087 scopus 로고    scopus 로고
    • Comparison of structural CSP decomposition methods
    • DOI 10.1016/S0004-3702(00)00078-3
    • G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. AIJ, 124(2):243-282, 2000. (Pubitemid 32029459)
    • (2000) Artificial Intelligence , vol.124 , Issue.2 , pp. 243-282
    • Gottlob, G.1    Leone, N.2    Scarcello, F.3
  • 7
    • 0038166188 scopus 로고    scopus 로고
    • Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width
    • G. Gottlob, N. Leone, and F. Scarcello. Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. Journal of computer and system sciences, 66(4):775-808, 2003.
    • (2003) Journal of Computer and System Sciences , vol.66 , Issue.4 , pp. 775-808
    • Gottlob, G.1    Leone, N.2    Scarcello, F.3
  • 8
    • 0028400405 scopus 로고
    • Decomposing constraint satisfaction problems using database techniques
    • M. Gyssens, P. G. Jeavons, and D. A. Cohen. Decomposing constraint satisfaction problems using database techniques. AIJ, 66(1):57-89, 1994.
    • (1994) AIJ , vol.66 , Issue.1 , pp. 57-89
    • Gyssens, M.1    Jeavons, P.G.2    Cohen, D.A.3
  • 9
    • 0344235427 scopus 로고    scopus 로고
    • Reducing redundancy in the hypertree decomposition scheme
    • P. Harvey and A. Ghose. Reducing redundancy in the hypertree decomposition scheme. In ICTAI, pages 474-481, 2003.
    • (2003) ICTAI , pp. 474-481
    • Harvey, P.1    Ghose, A.2
  • 11
    • 0000673493 scopus 로고
    • Graph minors. II: Algorithmic aspects of tree-width
    • N. Robertson and PD Seymour. Graph minors. II: Algorithmic aspects of tree-width. Journal of algorithms, 7(3):309-322, 1986.
    • (1986) Journal of Algorithms , vol.7 , Issue.3 , pp. 309-322
    • Robertson, N.1    Seymour, P.D.2

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