메뉴 건너뛰기




Volumn 154, Issue 1-2, 2004, Pages 199-227

Arc consistency for soft constraints

Author keywords

Arc consistency; Constraint satisfaction; Soft constraints

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; FUZZY SETS; POLYNOMIALS;

EID: 1242309999     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2003.09.002     Document Type: Article
Times cited : (120)

References (25)
  • 1
    • 0013401045 scopus 로고    scopus 로고
    • A weighted arc consistency technique for Max-CSP
    • Brighton, UK
    • Affane M.S., Bennaceur H. A weighted arc consistency technique for Max-CSP. Proc. 13th ECAI, Brighton, UK. 1998;209-213.
    • (1998) Proc. 13th ECAI , pp. 209-213
    • Affane, M.S.1    Bennaceur, H.2
  • 2
    • 0037284793 scopus 로고    scopus 로고
    • General properties and termination conditions for soft constraint propagation
    • Bistarelli S., Gennari R., Rossi F. General properties and termination conditions for soft constraint propagation. Constraints. 8:(1):2003;79-97.
    • (2003) Constraints , vol.8 , Issue.1 , pp. 79-97
    • Bistarelli, S.1    Gennari, R.2    Rossi, F.3
  • 5
    • 0037448850 scopus 로고    scopus 로고
    • Reduction operations in fuzzy or valued constraint satisfaction
    • Cooper M.C. Reduction operations in fuzzy or valued constraint satisfaction. Fuzzy Sets and Systems. 134:(3):2003;311-342.
    • (2003) Fuzzy Sets and Systems , vol.134 , Issue.3 , pp. 311-342
    • Cooper, M.C.1
  • 8
    • 84880665054 scopus 로고    scopus 로고
    • Mini-buckets: A general scheme for generating approximations in automated reasoning
    • Nagoya, Japan
    • Dechter R. Mini-buckets: A general scheme for generating approximations in automated reasoning. Proc. IJCAI-97, Nagoya, Japan. 1997;1297-1303.
    • (1997) Proc. IJCAI-97 , pp. 1297-1303
    • Dechter, R.1
  • 13
    • 0003771106 scopus 로고    scopus 로고
    • PhD Thesis, University of Maastricht, The Netherlands, November
    • A.M. Koster, Frequency assignment: Models and algorithms, PhD Thesis, University of Maastricht, The Netherlands, available at http://www.zib.de/koster/thesis.html, November 1999.
    • (1999) Frequency Assignment: Models and Algorithms
    • Koster, A.M.1
  • 14
    • 0036931798 scopus 로고    scopus 로고
    • On arc and node consistency in weighted CSP
    • Edmondton, AB
    • Larrosa J. On arc and node consistency in weighted CSP. Proc. AAAI-02, Edmondton, AB. 2002;48-53.
    • (2002) Proc. AAAI-02 , pp. 48-53
    • Larrosa, J.1
  • 16
    • 0031630985 scopus 로고    scopus 로고
    • Reversible DAC and other improvements for solving Max-CSP
    • Madison, WI
    • Larrosa J., Meseguer P., Schiex T., Verfaillie G. Reversible DAC and other improvements for solving Max-CSP. Proc. AAAI-98, Madison, WI. 1998;347-352.
    • (1998) Proc. AAAI-98 , pp. 347-352
    • Larrosa, J.1    Meseguer, P.2    Schiex, T.3    Verfaillie, G.4
  • 17
    • 84880845488 scopus 로고    scopus 로고
    • In the quest of the best form of local consistency for weighted CSP
    • Acapulco, Mexico
    • Larrosa J., Schiex T. In the quest of the best form of local consistency for weighted CSP. Proc. IJCAI-03, Acapulco, Mexico. 2003;239-244.
    • (2003) Proc. IJCAI-03 , pp. 239-244
    • Larrosa, J.1    Schiex, T.2
  • 18
    • 0002581730 scopus 로고
    • Good old discrete relaxation
    • Munchen, Germany
    • Mohr R., Masini G. Good old discrete relaxation. Proc. ECAI-88, Munchen, Germany. 1988;651-656.
    • (1988) Proc. ECAI-88 , pp. 651-656
    • Mohr, R.1    Masini, G.2
  • 20
    • 0011784681 scopus 로고    scopus 로고
    • Maximizing the reversible DAC lower bound in Max-CSP is NP-hard
    • INRA, July
    • T. Schiex, Maximizing the reversible DAC lower bound in Max-CSP is NP -hard, Techical Report 1998/02, INRA, July 1998.
    • (1998) Techical Report , vol.1998 , Issue.2
    • Schiex, T.1
  • 21
    • 0001553684 scopus 로고
    • Possibilistic constraint satisfaction problems or "How to handle soft constraints?"
    • Stanford, CA
    • Schiex T. Possibilistic constraint satisfaction problems or "How to handle soft constraints?" Proc. 8th Internat. Conf. on Uncertainty in Artificial Intelligence, Stanford, CA. 1992;268-275.
    • (1992) Proc. 8th Internat. Conf. on Uncertainty in Artificial Intelligence , pp. 268-275
    • Schiex, T.1
  • 22
    • 84945968658 scopus 로고    scopus 로고
    • Arc consistency for soft constraints
    • Singapore, Lecture Notes in Computer Science, Berlin: Springer
    • Schiex T. Arc consistency for soft constraints. Principles and Practice of Constraint Programming - CP 2000, Singapore. Lecture Notes in Computer Science. vol. 1894:2000;411-424 Springer, Berlin.
    • (2000) Principles and Practice of Constraint Programming - CP 2000 , vol.1894 , pp. 411-424
    • Schiex, T.1
  • 23
    • 0002582645 scopus 로고
    • Valued constraint satisfaction problems: Hard and easy problems
    • Montreal, QB
    • Schiex T., Fargier H., Verfaillie G. Valued constraint satisfaction problems: Hard and easy problems. Proc. 14th IJCAI, Montreal, QB. 1995;631-637.
    • (1995) Proc. 14th IJCAI , pp. 631-637
    • Schiex, T.1    Fargier, H.2    Verfaillie, G.3
  • 25
    • 84959038410 scopus 로고
    • Directed arc consistency preprocessing
    • M. Meyer. Lecture Notes in Computer Science, Berlin: Springer
    • Wallace R. Directed arc consistency preprocessing. Meyer M. Selected papers from the ECAI-94 Workshop on Constraint Processing. Lecture Notes in Computer Science. vol. 923:1995;121-137 Springer, Berlin.
    • (1995) Selected Papers from the ECAI-94 Workshop on Constraint Processing , vol.923 , pp. 121-137
    • Wallace, R.1


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