200 citations · 450 across the 51 of their papers we have counts for
5 papers · 1 filter
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…
Efficient Computation of Exact IRV Margins
Michelle Blom, Peter J. Stuckey, Vanessa J. Teague +1
The margin of victory is easy to compute for many election schemes but difficult for Instant Runoff Voting (IRV). This is important because arguments about the correctness of an el…
Projected Model Counting
Rehan Abdul Aziz, Geoffrey Chu, Christian Muise +1
Model counting is the task of computing the number of assignments to variables V that satisfy a given propositional theory F. Model counting is an essential tool in probabilistic r…
Horn Clauses as an Intermediate Representation for Program Analysis and Transformation
Graeme Gange, Jorge A. Navas, Peter Schachte +2
Many recent analyses for conventional imperative programs begin by transforming programs into logic programs, capitalising on existing LP analyses and simple LP semantics. We propo…
Exploration of models for a cargo assembly planning problem
G. Belov, N. Boland, M. W. P. Savelsbergh +1
We consider a real-world cargo assembly planning problem arising in a coal supply chain. The cargoes are built on the stockyard at a port terminal from coal delivered by trains. Th…