Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
Type constraints express subtype-relationships between the types of program expressions that are required for type-correctness, and were originally proposed as a convenient framewo...
We propose a convex optimization method for maximum likelihood estimation of autoregressive models, subject to conditional independence constraints. This problem is an extension t...
Jitkomut Songsiri, Joachim Dahl, Lieven Vandenberg...
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...