메뉴 건너뛰기




Volumn 3978 LNAI, Issue , 2006, Pages 29-43

Among, common and disjoint constraints

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; LOGIC PROGRAMMING; PROBLEM SOLVING; RESOURCE ALLOCATION; SET THEORY;

EID: 33746642045     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11754602_3     Document Type: Conference Paper
Times cited : (13)

References (11)
  • 1
    • 84947922824 scopus 로고    scopus 로고
    • Pruning for the minimum constraint family and for the number of distinct values constraint family
    • Springer
    • Beldiceanu, N. 2001. Pruning for the minimum constraint family and for the number of distinct values constraint family. In Proc. of CP 2001, 211-224. Springer.
    • (2001) Proc. of CP 2001 , pp. 211-224
    • Beldiceanu, N.1
  • 2
    • 26444589009 scopus 로고    scopus 로고
    • Global constraints as graph properties on a structured network of elementary constraints of the same type
    • Swedish Institute of Computer Science
    • Beldiceanu, N. 2000. Global constraints as graph properties on a structured network of elementary constraints of the same type. Technical report T2000/01, Swedish Institute of Computer Science.
    • (2000) Technical Report , vol.T2000-01
    • Beldiceanu, N.1
  • 4
    • 33746039773 scopus 로고    scopus 로고
    • Filtering algorithms for the same and usedby constraints
    • Beldiceanu, N., Katriel, I., and Thiel, S. 2004. Filtering algorithms for the same and usedby constraints. MPI Technical Report MPI-I-2004-1-001.
    • (2004) MPI Technical Report , vol.MPI-I-2004-1-001
    • Beldiceanu, N.1    Katriel, I.2    Thiel, S.3
  • 6
    • 84864838298 scopus 로고    scopus 로고
    • The range and roots constraints: Specifying counting and occurrence problems
    • Professional Book Center
    • Bessiere, C., Hebrard, E., Hnich, B., Kizilitan Z. and Walsh, T. 2005. The Range and Roots Constraints: Specifying Counting and Occurrence Problems. In Proc. of IJCAI 2005, 60-65. Professional Book Center.
    • (2005) Proc. of IJCAI 2005 , pp. 60-65
    • Bessiere, C.1    Hebrard, E.2    Hnich, B.3    Kizilitan, Z.4    Walsh, T.5
  • 7
    • 0000386002 scopus 로고    scopus 로고
    • Increasing constraint propagation by redundant modeling: An experience report
    • Cheng, B.M.W., Choi, K.M.F., Lee, J.H.M. and Wu, J.C.K. 1999. Increasing Constraint Propagation by Redundant Modeling: an Experience Report. Constraints 4(2): 167-192.
    • (1999) Constraints , vol.4 , Issue.2 , pp. 167-192
    • Cheng, B.M.W.1    Choi, K.M.F.2    Lee, J.H.M.3    Wu, J.C.K.4
  • 8
    • 0028567611 scopus 로고
    • A filtering algorithm for constraints of difference in CSPs
    • AAAI Press
    • Régin, J.-C. 1994. A filtering algorithm for constraints of difference in CSPs. In Proc. of AAAI 1994, 362-367. AAAI Press.
    • (1994) Proc. of AAAI 1994 , pp. 362-367
    • Régin, J.-C.1
  • 9
    • 0030354253 scopus 로고    scopus 로고
    • Generalized arc consistency for global cardinality constraints
    • AAAI Press / The MIT Press
    • Régin, J.-C. 1996. Generalized arc consistency for global cardinality constraints. In Proc. of AAAI 1996, 209-215. AAAI Press / The MIT Press.
    • (1996) Proc. of AAAI 1996 , pp. 209-215
    • Régin, J.-C.1
  • 11
    • 84941156191 scopus 로고    scopus 로고
    • Swedish Institue of Computer Science. 2004. SICStus Prolog User's Manual, Release 3.12.0. Available at http://www.sics.se/sicstus/docs/latest/pdf/sicstus.pdf.
    • (2004) SICStus Prolog User's Manual, Release 3.12.0


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