171 citations
- Data61AU3 papers
- İzmir University of EconomicsTR3 papers
- Laboratoire d'Informatique, de Robotique et de Microélectronique de MontpellierFR3 papers
- UNSW SydneyAU3 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Jagiellonian UniversityPL2 papers
- Max Planck Institute for Gravitational PhysicsDE2 papers
- University of BolognaIT2 papers
- University of YorkGB2 papers
- Aarhus UniversityDK1 paper
- Bowdoin CollegeUS1 paper
- Cornell UniversityUS1 paper
8 papers · 2 filters
On Improving Local Search for Unsatisfiability
David Pereira, Inês Lynce, Steven Prestwich
Stochastic local search (SLS) has been an active field of research in the last few years, with new techniques and procedures being developed at an astonishing rate. SLS has been tr…
Multiset Ordering Constraints
Alan M. Frisch, Ian Miguel, Zeynep Kiziltan +2
We identify a new and important global (or non-binary) constraint. This constraint ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered.…
Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Carmel Domshlak, Francesca Rossi, Kristen Brent Venable +1
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all th…
Stochastic Constraint Programming
Toby Walsh
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision…
Stochastic Constraint Programming: A Scenario-Based Approach
S. Armagan Tarim, Suresh Manandhar, Toby Walsh
To model combinatorial decision problems involving uncertainty and probability, we introduce scenario based stochastic constraint programming. Stochastic constraint programs contai…
The Complexity of Reasoning with Global Constraints
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich +1
Constraint propagation is one of the techniques central to the success of constraint programming. To reduce search, fast algorithms associated with each constraint prune the domain…