메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 3709 LNCS, Issue , 2005, Pages 241-255
Assumption-based pruning in conditional CSP
Author keywords

[No Author keywords available]
Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; MATHEMATICAL MODELS; PROBLEM SOLVING;
EID: 33646198795     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_20     Document Type: Conference Paper
Times cited : (14)
References (11)
  • 1
    • 35248818217 scopus 로고    scopus 로고
    • Greater efficiency for conditional constraint satisfaction
    • Rossi, F., ed.: CP. Springer
    • Sabin, M., Freuder, E.C., Wallace, R.J.: Greater efficiency for conditional constraint satisfaction. In Rossi, F., ed.: CP. Volume 2833 of Lecture Notes in Computer Science., Springer (2003) 649-663
    • (2003) Lecture Notes in Computer Science , vol.2833 , pp. 649-663
    • Sabin, M.1    Freuder, E.C.2    Wallace, R.J.3
  • 2
    • 0037380563 scopus 로고    scopus 로고
    • Solving mixed and conditional constraint satisfaction problems
    • Gelle, E., Faltings, B.: Solving mixed and conditional constraint satisfaction problems. Constraints 8 (2003) 107-141
    • (2003) Constraints , vol.8 , pp. 107-141
    • Gelle, E.1    Faltings, B.2
  • 3
    • 85135997562 scopus 로고
    • Dynamic constraint satisfaction problems
    • Boston, MA
    • Mittal, S., Falkenhainer, B.: Dynamic constraint satisfaction problems. In: Proc. of AAAI-90, Boston, MA (1990) 25-32
    • (1990) Proc. of AAAI-90 , pp. 25-32
    • Mittal, S.1    Falkenhainer, B.2
  • 4
    • 0036991699 scopus 로고    scopus 로고
    • Using a constraint satisfaction formulation and solution techniques for random test program generation
    • Bin, E., Emek, R., Shurek, G., Ziv, A.: Using a constraint satisfaction formulation and solution techniques for random test program generation. IBM Systems. Journal 41 (2002) 386-402
    • (2002) IBM Systems. Journal , vol.41 , pp. 386-402
    • Bin, E.1    Emek, R.2    Shurek, G.3    Ziv, A.4
  • 5
    • 0022680851 scopus 로고
    • An assumption-based tms
    • de Kleer, J.: An assumption-based tms. Artif. Intell. 28 (1986) 127-162
    • (1986) Artif. Intell. , vol.28 , pp. 127-162
    • De Kleer, J.1
  • 6
    • 84957360996 scopus 로고    scopus 로고
    • A fixpoint definition of dynamic constraint satisfaction
    • Jaffar, J., ed.: CP. Springer
    • Soininen, T., Gelle, E., Niernelä, I.: A fixpoint definition of dynamic constraint satisfaction. In Jaffar, J., ed.: CP. Volume 1713 of Lecture Notes in Computer Science., Springer (1999) 419-433
    • (1999) Lecture Notes in Computer Science , vol.1713 , pp. 419-433
    • Soininen, T.1    Gelle, E.2    Niernelä, I.3
  • 7
    • 49449120803 scopus 로고
    • Consistency in networks of relations
    • Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 8 (1977) 99-118
    • (1977) Artificial Intelligence , vol.8 , pp. 99-118
    • Mackworth, A.K.1
  • 8
    • 0003018469 scopus 로고
    • A comparison of atms and csp techniques
    • de Kleer, J.: A comparison of atms and csp techniques. In: IJCAI. (1989) 290-296
    • (1989) IJCAI. , pp. 290-296
    • De Kleer, J.1
  • 9
    • 0002690102 scopus 로고
    • Truth maintenance
    • McAllester, D.A.: Truth maintenance. In: AAAI. (1990) 1109-1116
    • (1990) AAAI. , pp. 1109-1116
    • McAllester, D.A.1
  • 10
    • 0034140167 scopus 로고    scopus 로고
    • Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
    • Gomes, C.P., Selman, B., Crato, N., Kautz, H.A.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24 (2000) 67-100
    • (2000) Journal of Automated Reasoning , vol.24 , pp. 67-100
    • Gomes, C.P.1    Selman, B.2    Crato, N.3    Kautz, H.A.4

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