Constraint-based Reasoning

Many interesting problems can be modeled as sets of constraints that must be satisfied and/or of preferences that should be optimized. Constraint-based reasoning studies both formalisms for representing constraints and preferences, and algorithms for efficiently finding solutions to problems encoded in these formalisms. Research on constraint-based reasoning at Michigan has focused on a variety of topics, including temporal reasoning, Boolean satisfiability, and Satisfaction Modulo Theory (SMT) solving, as well as on applications to varied domains such scheduling, interface design, and the verification of integrated circuits.

CSE Faculty

Durfee, Edmund H