Constraint Processing

@inproceedings{Dechter1995ConstraintP,
  title={Constraint Processing},
  author={R. Dechter},
  booktitle={Lecture Notes in Computer Science},
  year={1995}
}
  • R. Dechter
  • Published in
    Lecture Notes in Computer…
    1995
  • Computer Science
  • Constraint satisfaction is a simple but powerful tool. Constraints identify the impossible and reduce the realm of possibilities to effectively focus on the possible, allowing for a natural declarative formulation of what must be satisfied, without expressing how. The field of constraint reasoning has matured over the last three decades with contributions from a diverse community of researchers in artificial intelligence, databases and programming languages, operations research, management… CONTINUE READING
    1,328 Citations
    Constraint Satisfaction: An Emerging Paradigm
    • 71
    A Logical Approach to Constraint Satisfaction
    • 37
    Modern constraint answer set solving
    • 2
    • PDF
    Constraint Satisfaction, Complexity, and Logic
    • 1
    • PDF
    Handbook of Constraint Programming
    • 1,381
    • PDF
    Consistency and the Quantified Constraint Satisfaction Problem
    • 12
    Learning to Solve Constraint Problems
    • 13
    • PDF
    Algorithms for Simple Temporal Reasoning
    • 36

    References

    SHOWING 1-10 OF 204 REFERENCES
    Efficient Algorithms for Qualitative Reasoning about Time
    • 85
    • PDF
    Constraint logic programming
    • 1,483
    Consistency in Networks of Relations
    • 2,857
    • PDF
    On the Minimality and Decomposability of Constraint Networks
    • 50
    • PDF
    Constraint satisfaction in logic programming
    • 1,471
    Integrating Metric and Qualitative Temporal Reasoning
    • 241
    The Satisfiability of Temporal Constraint Networks
    • 43