메뉴 건너뛰기




Volumn 1, Issue , 2007, Pages 215-222

Strong inverse consistencies for non-binary CSPs

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; CONSTRAINT THEORY; CYBERNETICS;

EID: 48649110328     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2007.9     Document Type: Conference Paper
Times cited : (8)

References (12)
  • 1
    • 18944390206 scopus 로고    scopus 로고
    • An Optimal Coarse-grained Arc Consistency Algorithm
    • C. Bessière, J. Régin, R. Yap, and Y. Zhang. An Optimal Coarse-grained Arc Consistency Algorithm. Artificial Intelligence, 165(2):165-185, 2005.
    • (2005) Artificial Intelligence , vol.165 , Issue.2 , pp. 165-185
    • Bessière, C.1    Régin, J.2    Yap, R.3    Zhang, Y.4
  • 3
    • 0036375784 scopus 로고    scopus 로고
    • Domain Filtering Consistencies
    • R. Debruyne and C. Bessière. Domain Filtering Consistencies. JAIR, 14:205-230, 2001.
    • (2001) JAIR , vol.14 , pp. 205-230
    • Debruyne, R.1    Bessière, C.2
  • 4
    • 0022144787 scopus 로고
    • A Sufficient Condition for Backtrack-bounded Search
    • E. Freuder. A Sufficient Condition for Backtrack-bounded Search. JACM, 32(4):755-761, 1985.
    • (1985) JACM , vol.32 , Issue.4 , pp. 755-761
    • Freuder, E.1
  • 5
    • 0030370729 scopus 로고    scopus 로고
    • Neighborhood Inverse Consistency Preprocessing
    • E. Freuder and C. Elfe. Neighborhood Inverse Consistency Preprocessing. In AAAI'96, pages 202-208, 1996.
    • (1996) AAAI'96 , pp. 202-208
    • Freuder, E.1    Elfe, C.2
  • 6
    • 0022679733 scopus 로고
    • On the complexity of join dependencies
    • M. Gyssens. On the complexity of join dependencies. ACM Trans. Database Syst., 11(1):81-108, 1986.
    • (1986) ACM Trans. Database Syst , vol.11 , Issue.1 , pp. 81-108
    • Gyssens, M.1
  • 7
    • 0024914621 scopus 로고
    • A filtering process for general constraint satisfaction problems: Achieving pairwise consistency using an associated binary representation
    • P. Janssen, P. Jégou, B. Nouguier, and M. Vilarem. A filtering process for general constraint satisfaction problems: Achieving pairwise consistency using an associated binary representation. In Proceedings of IEEE Workshop on Tools for Artificial Intelligence, pages 420-427, 1989.
    • (1989) Proceedings of IEEE Workshop on Tools for Artificial Intelligence , pp. 420-427
    • Janssen, P.1    Jégou, P.2    Nouguier, B.3    Vilarem, M.4
  • 8
    • 35248845828 scopus 로고
    • On the Consistency of General Constraint Satisfaction Problems
    • P. Jégou. On the Consistency of General Constraint Satisfaction Problems. In AAAI'93, pages 114-119, 1993.
    • (1993) AAAI'93 , pp. 114-119
    • Jégou, P.1
  • 10
    • 84886048339 scopus 로고    scopus 로고
    • Inverse Consistencies for Non-binary Constraints
    • K. Stergiou and T. Walsh. Inverse Consistencies for Non-binary Constraints. In ECAI-2006, pages 153-157, 2006.
    • (2006) ECAI-2006 , pp. 153-157
    • Stergiou, K.1    Walsh, T.2
  • 11
    • 84976827271 scopus 로고
    • On the Minimality and Global Consistency of Row-convex Constraint Networks
    • P. van Beek and R. Dechter. On the Minimality and Global Consistency of Row-convex Constraint Networks. JACM, 42(3):543-561, 1995.
    • (1995) JACM , vol.42 , Issue.3 , pp. 543-561
    • van Beek, P.1    Dechter, R.2
  • 12
    • 0032596624 scopus 로고    scopus 로고
    • A Generic Customizable Framework for Inverse Local Consistency
    • G. Verfaillie, D. Martinez, and C. Bessière. A Generic Customizable Framework for Inverse Local Consistency. In Proceedings of AAAI'99, pages 169-174, 1999.
    • (1999) Proceedings of AAAI'99 , pp. 169-174
    • Verfaillie, G.1    Martinez, D.2    Bessière, C.3


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