144 citations · 449 across the 18 of their papers we have counts for
18 papers
Online Search Cost Estimation for SAT Solvers
Shai Haim, Toby Walsh
We present two different methods for estimating the cost of solving SAT problems. The methods focus on the online behaviour of the backtracking solver, as well as the structure of…
Restart Strategy Selection using Machine Learning Techniques
Shai Haim, Toby Walsh
Restart strategies are an important factor in the performance of conflict-driven Davis Putnam style SAT solvers. Selecting a good restart strategy for a problem instance can enhanc…
Restricted Global Grammar Constraints
George Katsirelos, Sebastian Maneth, Nina Narodytska +1
We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disen…
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…
Scenario-based Stochastic Constraint Programming
Suresh Manandhar, Armagan Tarim, Toby Walsh
To model combinatorial decision problems involving uncertainty and probability, we extend the stochastic constraint programming framework proposed in [Walsh, 2002] along a number o…