메뉴 건너뛰기




Volumn 4741 LNCS, Issue , 2007, Pages 210-224

Encodings of the SEQUENCE constraint

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); PROBLEM SOLVING; SCHEDULING; TREES (MATHEMATICS);

EID: 38149034375     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74970-7_17     Document Type: Conference Paper
Times cited : (41)

References (11)
  • 1
    • 35048813100 scopus 로고    scopus 로고
    • A regular language membership constraint for finite sequences of variables
    • Wallace, M, ed, CP, Springer, Heidelberg
    • Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482-495. Springer, Heidelberg (2004)
    • (2004) LNCS , vol.3258 , pp. 482-495
    • Pesant, G.1
  • 4
    • 0002530563 scopus 로고    scopus 로고
    • Some practicable filtering techniques for the constraint satisfaction problem
    • Morgan Kaufmann, San Francisco
    • Debruyne, R., Bessière, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: 15th Int. Joint Conf. on Artificial Intelligence (IJCAI'97), pp. 412-417. Morgan Kaufmann, San Francisco (1997)
    • (1997) 15th Int. Joint Conf. on Artificial Intelligence (IJCAI'97) , pp. 412-417
    • Debruyne, R.1    Bessière, C.2
  • 7
    • 84948952354 scopus 로고    scopus 로고
    • A filtering algorithm for global sequencing constraints
    • Smolka, G, ed, Principles and Practice of Constraint Programming, CP97, Springer, Heidelberg
    • Régin, J.C., Puget, J.F.: A filtering algorithm for global sequencing constraints. In: Smolka, G. (ed.) Principles and Practice of Constraint Programming - CP97. LNCS, vol. 1330, pp. 32-46. Springer, Heidelberg (1997)
    • (1997) LNCS , vol.1330 , pp. 32-46
    • Régin, J.C.1    Puget, J.F.2
  • 8
    • 84937201543 scopus 로고    scopus 로고
    • Beldiceanu, N., Carlsson, M.: Revisiting the cardinality operator and introducing the cardinality-path constraint family. In: Codognet, P. (ed.) ICLP 2001. LNCS, 2237, pp. 59-73. Springer, Heidelberg (2001)
    • Beldiceanu, N., Carlsson, M.: Revisiting the cardinality operator and introducing the cardinality-path constraint family. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 59-73. Springer, Heidelberg (2001)
  • 9
    • 26444549895 scopus 로고    scopus 로고
    • Combination of Among and Cardinality constraints
    • Barták, R, Milano, M, eds, CPAIOR 2005, Springer, Heidelberg
    • Régin, J.C.: Combination of Among and Cardinality constraints. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 288-303. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3524 , pp. 288-303
    • Régin, J.C.1
  • 10
    • 33749549521 scopus 로고    scopus 로고
    • Cotton, S., Maler, O.: Fast and flexible difference constraint propagation for DPLL(T). In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, 4121, pp. 170-183. Springer, Heidelberg (2006)
    • Cotton, S., Maler, O.: Fast and flexible difference constraint propagation for DPLL(T). In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 170-183. Springer, Heidelberg (2006)
  • 11
    • 38149066221 scopus 로고    scopus 로고
    • Benhamou, F. (ed.): CP 2006. LNCS, 4204. Springer, Heidelberg (2006)
    • Benhamou, F. (ed.): CP 2006. LNCS, vol. 4204. Springer, Heidelberg (2006)


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