메뉴 건너뛰기




Volumn 58, Issue 1-3, 1992, Pages 71-112

Constraint reasoning based on interval arithmetic: the tolerance propagation approach

Author keywords

[No Author keywords available]

Indexed keywords


EID: 44049111346     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(92)90005-I     Document Type: Article
Times cited : (135)

References (52)
  • 2
    • 0022241276 scopus 로고
    • On interval arithmetic range approximation methods of polynomials and rational functions
    • (1985) Comput. Graph. , vol.9 , Issue.4 , pp. 365-372
    • Alander1
  • 4
    • 0020849266 scopus 로고
    • Maintaining knowledge about temporal intervals
    • (1983) Commun. ACM , vol.26 , pp. 832-843
    • Allen1
  • 7
    • 0023397302 scopus 로고
    • Opening the Prolog III universe
    • (1987) Byte , pp. 177-182
    • Colmerauer1
  • 8
    • 0023386175 scopus 로고
    • Constraint propagation with interval labels
    • (1987) Artif. Intell. , vol.32 , pp. 281-331
    • Davis1
  • 14
    • 0019899621 scopus 로고
    • A sufficient condition for backtrack-free search
    • (1982) J. ACM , vol.29 , Issue.1 , pp. 24-32
    • Freuder1
  • 15
    • 0041527596 scopus 로고
    • Algebraic constraints
    • Carnegie-Mellon University, Department of Computer Science, Pittsburgh, PA
    • (1983) Ph.D. Thesis
    • Gosling1
  • 16
    • 84915362506 scopus 로고
    • An overview of global optimization using interval analysis
    • R. Moore, Academic Press, New York
    • (1988) Reliability in Computing , pp. 289-307
    • Hansen1
  • 21
    • 25044438030 scopus 로고
    • Constraint reasoning with incomplete knowledge: the tolerance propagation approach
    • VTT Publications 72, Technical Research Centre of Finland, Espoo., Finland
    • (1991) Doctoral Dissertation
    • Hyvönen1
  • 26
    • 0003903607 scopus 로고
    • Constraint logic programming
    • Monash University, Department of Computer Science, Clayton, Victoria, Australia
    • (1986) Tech. Rept.
    • Jaffar1    Lassez2
  • 29
    • 0023396559 scopus 로고
    • Constraint logic programming
    • (1987) Byte , pp. 171-176
    • Lassez1
  • 33
    • 0021828305 scopus 로고
    • The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
    • (1985) Artif. Intell. , vol.25 , pp. 65-74
    • Mackworth1    Freuder2
  • 34
    • 84962760644 scopus 로고
    • Constraint satisfaction problems: an overview
    • (1989) AI Commun. , vol.2 , Issue.1 , pp. 3-17
    • Meseguer1
  • 38
    • 1242285891 scopus 로고
    • Interval arithmetic specification
    • Bell-Northern Research, Computing Research Laboratory, Ottawa, Ont
    • (1989) Working Paper
    • Older1
  • 40
    • 84915927896 scopus 로고    scopus 로고
    • Constraint arithmetic on real intervals, in: F. Benhamou and A. Colmerauer, eds., Constraint Logic Programming, Collected Papers, (MIT Press, Cambridge, MA, to appear).
    • W. Older and A. Vellino, Constraint arithmetic on real intervals, in: F. Benhamou and A. Colmerauer, eds., Constraint Logic Programming, Collected Papers (MIT Press, Cambridge, MA, to appear).
    • Older1    Vellino2
  • 41
    • 0020798546 scopus 로고
    • Inferno: a cautious approach to uncertain inference
    • (1983) Comput. J. , vol.26 , Issue.3 , pp. 255-269
    • Quinlan1
  • 46
    • 0003131450 scopus 로고
    • Computation of rational interval functions
    • (1974) BIT , vol.14 , Issue.1 , pp. 87-95
    • Skelboe1
  • 48
    • 0342746529 scopus 로고
    • The definition and implementation of a computer programming language based on constraints
    • MIT, Department of Electrical Engineering and Computer Science, Cambridge, MA
    • (1980) Ph.D. Thesis
    • Steele1


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