15 citations · 18 across the 3 of their papers we have counts for
3 papers
cs.LO2014
The P-Box CDF-Intervals: Reliable Constraint Reasoning with Quantifiable Information
Aya Saad, Thom Fruehwirth, Carmen Gervet
This paper introduces a new constraint domain for reasoning about data with uncertainty. It extends convex modeling with the notion of p-box to gain additional quantifiable informa…
cs.AI2011★ 3 cited
A Visual Entity-Relationship Model for Constraint-Based University Timetabling
Islam Abdelraouf, Slim Abdennadher, Carmen Gervet
University timetabling (UTT) is a complex problem due to its combinatorial nature but also the type of constraints involved. The holy grail of (constraint) programming: "the user s…
cs.AI2006★ 15 cited
Certainty Closure: Reliable Constraint Reasoning with Incomplete or Erroneous Data
Neil Yorke-Smith, Carmen Gervet
Constraint Programming (CP) has proved an effective paradigm to model and solve difficult combinatorial satisfaction and optimisation problems from disparate domains. Many such pro…