메뉴 건너뛰기




Volumn 2237, Issue , 2001, Pages 90-104

Building constraint solvers with HAL

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; CONSTRAINT THEORY; PROBLEM ORIENTED LANGUAGES;

EID: 69749125380     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45635-x_14     Document Type: Conference Paper
Times cited : (4)

References (17)
  • 2
    • 0042229754 scopus 로고
    • Boolean constraint solving using clp(FD)
    • MIT Press
    • P. Codognet and D. Diaz. Boolean constraint solving using clp(FD). In Procs. of ILPS’1993, pages 525–539. MIT Press, 1993.
    • (1993) Procs. Of ILPS’1993 , pp. 525-539
    • Codognet, P.1    Diaz, D.2
  • 6
    • 0032186691 scopus 로고    scopus 로고
    • Theory and practice of constraint handling rules
    • T. Fruhwirth. Theory and practice of constraint handling rules. Journal of Logic Programming, 37:95–138, 1998.
    • (1998) Journal of Logic Programming , vol.37 , pp. 95-138
    • Fruhwirth, T.1
  • 7
    • 84957369621 scopus 로고    scopus 로고
    • Constraint representation for propagation
    • Springer-Verlag
    • W. Harvey and P.J. Stuckey. Constraint representation for propagation. In Procs. of PPCP’98, LNCS, pages 235–249. Springer-Verlag, 1998.
    • (1998) Procs. Of PPCP’98, LNCS , pp. 235-249
    • Harvey, W.1    Stuckey, P.J.2
  • 10
    • 84937228859 scopus 로고    scopus 로고
    • ILOG
    • ILOG. CPLEX product page. http://www.ilog.com/products/cplex/.
    • CPLEX Product Page
  • 11
  • 15
    • 0030262017 scopus 로고    scopus 로고
    • The execution algorithm of Mercury: An efficient purely declarative logic programming language
    • Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury: an efficient purely declarative logic programming language. JLP, 29:17–64, 1996.
    • (1996) JLP , vol.29 , pp. 17-64
    • Somogyi, Z.1    Henderson, F.2    Conway, T.3
  • 16
    • 84937228860 scopus 로고    scopus 로고
    • M. Trick. mat.gsia.cmu.edu/COLOR/color.html.
    • Trick, M.1
  • 17
    • 0024864871 scopus 로고
    • How to make ad-hoc polymorphism less ad-hoc
    • P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In Proc. 16th ACM POPL, pages 60–76, 1989.
    • (1989) Proc. 16Th ACM POPL , pp. 60-76
    • Wadler, P.1    Blott, S.2


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