메뉴 건너뛰기




Volumn 4, Issue 1, 1999, Pages 5-42

Constraint Retraction in CLP(FD): Formal Framework and Performance Results

Author keywords

Constraint programming; Constraint retraction; Constraint satisfaction; Finite domains; Non monotonicity

Indexed keywords


EID: 0001874929     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009893626769     Document Type: Article
Times cited : (16)

References (32)
  • 2
    • 0028336331 scopus 로고
    • Arc-consistency and Arc-consistency again
    • C. Bessière (1994). Arc-consistency and Arc-consistency again. Artificial Intelligence, 65(1).
    • (1994) Artificial Intelligence , vol.65 , Issue.1
    • Bessière, C.1
  • 7
    • 0005825947 scopus 로고
    • A meta-level compiler for CLP(FD) and its combination with intelligent backtracking
    • A. Colmerauer, F. Benhamou (Eds.). MIT Press
    • P. Codognet, F. Pages and T. Sola (1993). A meta-level compiler for CLP(FD) and its combination with intelligent backtracking. In Constraint Logic Programming : Selected Research, A. Colmerauer, F. Benhamou (Eds.). MIT Press.
    • (1993) Constraint Logic Programming : Selected Research
    • Codognet, P.1    Pages, F.2    Sola, T.3
  • 8
    • 0041404669 scopus 로고
    • Enhancing the constraint-solving power of clp(FD) by means of path-consistency methods
    • A. Podelski (Ed.). LNCS 910, Springer Verlag
    • P. Codognet and G. Nardiello (1995). Enhancing the constraint-solving power of clp(FD) by means of path-consistency methods. In Constraint Programming : Basics and Trends, A. Podelski (Ed.). LNCS 910, Springer Verlag.
    • (1995) Constraint Programming : Basics and Trends
    • Codognet, P.1    Nardiello, G.2
  • 13
    • 0041905787 scopus 로고    scopus 로고
    • Implementing Constraint Retraction for Finite Domains
    • Katmandu, Nepal, Springer-Verlag
    • Y. Georget, P. Codognet and F. Rossi (1997). Implementing Constraint Retraction for Finite Domains. In Proc. ASIAN'97. Katmandu, Nepal, Springer-Verlag.
    • (1997) Proc. ASIAN'97
    • Georget, Y.1    Codognet, P.2    Rossi, F.3
  • 19
    • 0000573434 scopus 로고
    • An assumption-based truth maintenance system
    • J. de Kleer (1986). An assumption-based truth maintenance system. Artificial Intelligence 28.
    • (1986) Artificial Intelligence , vol.28
    • De Kleer, J.1
  • 20
    • 49449120803 scopus 로고
    • Consistency in networks of relations
    • A.K. Mackworth (1977). Consistency in networks of relations. Artificial Intelligence, vol.8 (1).
    • (1977) Artificial Intelligence , vol.8 , Issue.1
    • Mackworth, A.K.1
  • 21
    • 0021828305 scopus 로고
    • The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
    • A. K. Macworth and E. C. Freuder (1985). The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25.
    • (1985) Artificial Intelligence , vol.25
    • Macworth, A.K.1    Freuder, E.C.2
  • 23
    • 84990623071 scopus 로고
    • Constraint Satisfaction Algorithms
    • B. A. Nadel (1989). Constraint Satisfaction Algorithms. Computational Intelligence, 5:188-224.
    • (1989) Computational Intelligence , vol.5 , pp. 188-224
    • Nadel, B.A.1
  • 27
    • 0041905780 scopus 로고    scopus 로고
    • The SICSTUS v3 User's Manual
    • The SICSTUS v3 User's Manual. Available at http://www.sics.se/ps/sicstus.html
  • 31
  • 32
    • 0042407027 scopus 로고
    • Constraint processing in cc(FD)
    • A. Podelski (Ed.), LNCS 910, Springer Verlag 1995. First version: Research Report, Brown University
    • P. Van Hentenryck, V. Saraswat and Y. Deville (1992). Constraint processing in cc(FD). In Constraint Programming : Basics and Trends, A. Podelski (Ed.), LNCS 910, Springer Verlag 1995. First version: Research Report, Brown University.
    • (1992) Constraint Programming : Basics and Trends
    • Van Hentenryck, P.1    Saraswat, V.2    Deville, Y.3


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