200 citations · 450 across the 51 of their papers we have counts for
9 papers · 1 filter
Compact Partial Symmetry Breaking for Graph Search Problems
Michael Codish, Mikoláš Janota, Peter J. Stuckey
Symmetry breaking in graph search problems remains challenging: complete symmetry breaking constraints are typically exponential in size, while partial approaches trade precision f…
Encoding Linear Constraints into SAT
Ignasi Abío, Valentin Mayer-Eichberger, Peter Stuckey
Linear integer constraints are one of the most important constraints in combinatorial problems since they are commonly found in many practical applications. Typically, encodings to…
Precondition Inference via Partitioning of Initial States
Bishoksan Kafle, Graeme Gange, Peter Schachte +2
Precondition inference is a non-trivial task with several applications in program analysis and verification. We present a novel iterative method for automatically deriving sufficie…
Pre-proceedings of the 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018)
Fred Mesnard, Peter J. Stuckey
This volume constitutes the pre-proceedings of the 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018), held on 4-6th September 2018 in F…
An iterative approach to precondition inference using constrained Horn clauses
Bishoksan Kafle, John P. Gallagher, Graeme Gange +3
We present a method for automatic inference of conditions on the initial states of a program that guarantee that the safety assertions in the program are not violated. Constrained…
Unsatisfiable Cores and Lower Bounding for Constraint Programming
Nicholas Downing, Thibaut Feydy, Peter J. Stuckey
Constraint Programming (CP) solvers typically tackle optimization problems by repeatedly finding solutions to a problem while placing tighter and tighter bounds on the solution cos…
Lazy Model Expansion: Interleaving Grounding with Search
Broes De Cat, Marc Denecker, Peter Stuckey +1
Finding satisfying assignments for the variables involved in a set of constraints can be cast as a (bounded) model generation problem: search for (bounded) models of a theory in so…
Unsatisfiable Cores for Constraint Programming
Nicholas Downing, Thibaut Feydy, Peter J. Stuckey
Constraint Programming (CP) solvers typically tackle optimization problems by repeatedly finding solutions to a problem while placing tighter and tighter bounds on the solution cos…
Removing Propagation Redundant Constraints in Redundant Modeling
Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with various degrees of constraint propagation for pruning the search space. O…