메뉴 건너뛰기




Volumn , Issue , 2005, Pages 138-143

QCSP-solve: A solver for quantified constraint satisfaction problems

Author keywords

[No Author keywords available]

Indexed keywords

DIRECT APPROACH; ORDERS OF MAGNITUDE; QUANTIFIED CONSTRAINT SATISFACTION PROBLEMS; SPEED UP;

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

References (10)
  • 1
    • 84945926937 scopus 로고    scopus 로고
    • Universally Quantified Interval Constraints
    • F. Benhamou and F. Goualard. Universally Quantified Interval Constraints. In Proceedings of CP-2000, pages 67-82, 2000.
    • (2000) Proceedings of CP-2000 , pp. 67-82
    • Benhamou, F.1    Goualard, F.2
  • 3
    • 29344449905 scopus 로고    scopus 로고
    • Beyond NP: Arc-consistency for Quantified Constraints
    • L. Bordeaux and E. Monfroy. Beyond NP: Arc-consistency for Quantified Constraints. In Proceedings of CP-2002, 2002.
    • (2002) Proceedings of CP-2002
    • Bordeaux, L.1    Monfroy, E.2
  • 4
    • 0036476801 scopus 로고    scopus 로고
    • An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
    • DOI 10.1023/A:1015019416843
    • M. Cadoli, M. Schaerf, A. Giovanardi, and M. Giovanardi. An Algorithm to Evaluate Quantified Boolean Formulae and its Experimental Evaluation. Journal of Automated Reasoning, 28(2):101-142, 2002. (Pubitemid 34459695)
    • (2002) Journal of Automated Reasoning , vol.28 , Issue.2 , pp. 101-142
    • Cadoli, M.1    Schaerf, M.2    Giovanardi, A.3    Giovanardi, M.4
  • 5
    • 84958062112 scopus 로고
    • Eliminating Interchangeable Values in Constraint Satisfaction Problems
    • E. Freuder. Eliminating Interchangeable Values in Constraint Satisfaction Problems. In Proceedings of AAAI-91, pages 227-233, 1991.
    • (1991) Proceedings of AAAI-91 , pp. 227-233
    • Freuder, E.1
  • 6
    • 85017370675 scopus 로고    scopus 로고
    • Encoding Quantified CSPs as Quantified Boolean Formulae
    • I. Gent, P. Nightingale, and A. Rowley. Encoding Quantified CSPs as Quantified Boolean Formulae. In Proceedings of ECAI-2004, pages 176-180, 2004.
    • (2004) Proceedings of ECAI-2004 , pp. 176-180
    • Gent, I.1    Nightingale, P.2    Rowley, A.3
  • 8
    • 33750291991 scopus 로고    scopus 로고
    • Algorithms for Quantified Constraint Satisfaction Problems
    • N. Mamoulis and K. Stergiou. Algorithms for Quantified Constraint Satisfaction Problems. In Proceedings of CP-2004, pages 752-756, 2004.
    • (2004) Proceedings of CP-2004 , pp. 752-756
    • Mamoulis, N.1    Stergiou, K.2
  • 9
    • 0001372340 scopus 로고
    • Hybrid Algorithms for the Constraint Satisfaction Problem
    • P. Prosser. Hybrid Algorithms for the Constraint Satisfaction Problem. Computational Intelligence, 9(3):268-299, 1993.
    • (1993) Computational Intelligence , vol.9 , Issue.3 , pp. 268-299
    • Prosser, P.1
  • 10
    • 0036222301 scopus 로고    scopus 로고
    • Quantified Constraints under Perturbations
    • S. Ratschan. Quantified Constraints under Perturbations. Journal of Symbolic Computation, 33(4):493-505, 2002.
    • (2002) Journal of Symbolic Computation , vol.33 , Issue.4 , pp. 493-505
    • Ratschan, S.1


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