Corpus ID: 6802808

Consistency Techniques for Numeric CSPs

@inproceedings{Lhomme1993ConsistencyTF,
  title={Consistency Techniques for Numeric CSPs},
  author={O. Lhomme},
  booktitle={IJCAI},
  year={1993}
}
  • O. Lhomme
  • Published in IJCAI 1993
  • Computer Science
  • Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP. [...] Key Result The semantics that have been elaborated, plus the complexity analysis and good experimental results, confirm that these techniques can be used in real applications.Expand Abstract

    Topics from this paper.

    Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms
    4
    Accelerating filtering techniques for numeric CSPs
    33
    Dynamic Domain Splitting for Numeric CSPs
    39
    A new local consistency for weighted CSP dedicated to long domains
    14
    A Note on Partial Consistencies over Continuous Domains
    37
    Declarative Modelling of Constraint Propagation Strategies
    8
    Comparing Partial Consistencies *
    Propagation Properties of Min-closed CSPs
    1
    Automated reasoning on monotonic constraints
    Bound Consistencies for the discrete CSP
    3

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 20 REFERENCES
    Extending Prolog with Constraint Arithmetic on Real Intervals
    80
    Constraint Reasoning Based on Interval Arithmetic
    81
    Synthesizing constraint expressions
    491
    The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems
    526
    Arc consistency for factorable relations
    28
    Arc and Path Consistency Revisited
    672
    Networks of constraints: Fundamental properties and applications to picture processing
    1198
    Introduction to interval computations
    1022
    Generating Semantic Descriptions From Drawings of Scenes With Shadows
    391