메뉴 건너뛰기




Volumn , Issue , 2007, Pages 74-79

Quantified constraint satisfaction problems: From relaxations to explanations

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION; GENERALISATION; QUANTIFIED CONSTRAINT SATISFACTION PROBLEMS;

EID: 58549107101     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (12)

References (11)
  • 1
    • 84945926937 scopus 로고    scopus 로고
    • Universally quantified interval constraints
    • F. Benhamou and F. Goualard. Universally quantified interval constraints. In CP, pages 67-82, 2000.
    • (2000) CP , pp. 67-82
    • Benhamou, F.1    Goualard, F.2
  • 2
    • 84957036580 scopus 로고    scopus 로고
    • Beyond NP: Arc-consistency for quantified constraints
    • L. Bordeaux and E. Monfroy. Beyond NP: Arc-consistency for quantified constraints. In CP, pages 371-386, 2002.
    • (2002) CP , pp. 371-386
    • Bordeaux, L.1    Monfroy, E.2
  • 3
    • 29344462252 scopus 로고    scopus 로고
    • CSP properties for quantified constraints: Definitions and complexity
    • L. Bordeaux, M. Cadoli, and T. Mancini. CSP properties for quantified constraints: Definitions and complexity. In AAAI, pages 360-365, 2005.
    • (2005) AAAI , pp. 360-365
    • Bordeaux, L.1    Cadoli, M.2    Mancini, T.3
  • 5
    • 44049114350 scopus 로고
    • Partial constraint satisfaction
    • E.C. Freuder and R.J. Wallace. Partial constraint satisfaction. Artif. Intell., 58(1-3):21-70, 1992.
    • (1992) Artif. Intell. , vol.58 , Issue.1-3 , pp. 21-70
    • Freuder, E.C.1    Wallace, R.J.2
  • 6
    • 85017370675 scopus 로고    scopus 로고
    • Encoding quantified CSPs as quantified boolean formulae
    • I.P. Gent, P. Nightingale, and A. Rowley. Encoding quantified CSPs as quantified boolean formulae. In ECAI, pages 176-180, 2004.
    • (2004) ECAI , pp. 176-180
    • Gent, I.P.1    Nightingale, P.2    Rowley, A.3
  • 7
    • 84880758665 scopus 로고    scopus 로고
    • QCSP-solve: A solver for quantified constraint satisfaction problems
    • I.P. Gent, P. Nightingale, and K. Stergiou. QCSP-solve: A solver for quantified constraint satisfaction problems. In IJCAI, pages 138-143, 2005.
    • (2005) IJCAI , pp. 138-143
    • Gent, I.P.1    Nightingale, P.2    Stergiou, K.3
  • 9
    • 9444247521 scopus 로고    scopus 로고
    • QUICKXPLAIN: Preferred explanations and relaxations for over-constrained problems
    • U. Junker. QUICKXPLAIN : Preferred explanations and relaxations for over-constrained problems. In AAAI, pages 167-172, 2004.
    • (2004) AAAI , pp. 167-172
    • Junker, U.1
  • 10
    • 49449120803 scopus 로고
    • Consistency in networks of relations
    • A.K. Mackworth. Consistency in networks of relations. Artif. Intell., 8(1):99-118, 1977.
    • (1977) Artif. Intell. , vol.8 , Issue.1 , pp. 99-118
    • Mackworth, A.K.1
  • 11
    • 33646200727 scopus 로고    scopus 로고
    • Repair-based methods for quantified CSPs
    • K. Stergiou. Repair-based methods for quantified CSPs. In CP, pages 652-666, 2005.
    • (2005) CP , pp. 652-666
    • Stergiou, K.1


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