메뉴 건너뛰기




Volumn 4204 LNCS, Issue , 2006, Pages 635-649

BlockSolve: A bottom-up approach for solving quantified CSPs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; TREES (MATHEMATICS);

EID: 33750329935     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_45     Document Type: Conference Paper
Times cited : (19)

References (10)
  • 1
    • 26444467152 scopus 로고    scopus 로고
    • Resolve and expand
    • Vancouver BC
    • Biere, A.: Resolve and expand. In: Proceedings SAT'04, Vancouver BC (2004)
    • (2004) Proceedings SAT'04
    • Biere, A.1
  • 2
    • 29344461242 scopus 로고    scopus 로고
    • Symbolic decision procedures for QBF
    • Toronto, Canada
    • Pan, G., Vardi, M.: Symbolic decision procedures for QBF. In: Proceedings CP'04, Toronto, Canada (2004) 453-467
    • (2004) Proceedings CP'04 , pp. 453-467
    • Pan, G.1    Vardi, M.2
  • 3
    • 84880758665 scopus 로고    scopus 로고
    • QCSP-solve: A solver for quantified constraint satisfaction problems
    • Edinburgh, Scotland
    • Gent, I., Nightingale, P., Stergiou, K.: QCSP-solve: A solver for quantified constraint satisfaction problems. In: Proceedings IJCAI'05. Edinburgh, Scotland (2005) 138-143
    • (2005) Proceedings IJCAI'05 , pp. 138-143
    • Gent, I.1    Nightingale, P.2    Stergiou, K.3
  • 4
    • 84957036580 scopus 로고    scopus 로고
    • Beyond NP: Arc-consistency for quantified constraints
    • Ithaca NY
    • Bordeaux, L., Montfroy, E.: Beyond NP: Arc-consistency for quantified constraints. In: Proceedings CP'02, Ithaca NY (2002) 371-386
    • (2002) Proceedings CP'02 , pp. 371-386
    • Bordeaux, L.1    Montfroy, E.2
  • 5
    • 33750291991 scopus 로고    scopus 로고
    • Algorithms for quantified constraint satisfaction problems
    • Toronto, Canada
    • Mamoulis, N., Stergiou, K.: Algorithms for quantified constraint satisfaction problems. In: Proceedings CP'04, Toronto, Canada (2004) 752-756
    • (2004) Proceedings CP'04 , pp. 752-756
    • Mamoulis, N.1    Stergiou, K.2
  • 6
    • 33646200727 scopus 로고    scopus 로고
    • Repair-based methods for quantified csps
    • Sitges, Spain
    • Stergiou, K.: Repair-based methods for quantified csps. In: Proceedings CP'05, Sitges, Spain (2005) 652-666
    • (2005) Proceedings CP'05 , pp. 652-666
    • Stergiou, K.1
  • 7
    • 0019067870 scopus 로고
    • Increasing tree seach efficiency for constraint satisfaction problems
    • Haralick, R., Elliott, G.: Increasing tree seach efficiency for constraint satisfaction problems. Artificial Intelligence 14 (1980) 263-313
    • (1980) Artificial Intelligence , vol.14 , pp. 263-313
    • Haralick, R.1    Elliott, G.2
  • 8
    • 0030360003 scopus 로고    scopus 로고
    • Mixed constraint satisfaction: A framework for decision problems under incomplete knowledge
    • Portland OR
    • Fargier, H., Lang, J., Schiex, T.: Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge. In: Proceedings AAAI'96, Portland OR (1996) 175-180
    • (1996) Proceedings AAAI'96 , pp. 175-180
    • Fargier, H.1    Lang, J.2    Schiex, T.3
  • 9
    • 0002548421 scopus 로고
    • Extracting constraint satisfaction subproblems
    • Montréal, Canada
    • Freuder, E., Hubbe, P.: Extracting constraint satisfaction subproblems. In: Proceedings IJCAF95, Montréal, Canada (1995) 548-557
    • (1995) Proceedings IJCAF95 , pp. 548-557
    • Freuder, E.1    Hubbe, P.2


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