
Pairwise Symmetry Reasoning for MultiAgent Path Finding Search
MultiAgent Path Finding (MAPF) is a challenging combinatorial problem t...
read it

Symmetry Breaking for kRobust MultiAgent Path Finding
During MultiAgent Path Finding (MAPF) problems, agents can be delayed b...
read it

Auditing Hamiltonian Elections
Presidential primaries are a critical part of the United States Presiden...
read it

A Scalable Two Stage Approach to Computing Optimal Decision Sets
Machine learning (ML) is ubiquitous in modern life. Since it is being de...
read it

Divide and Learn: A Divide and Conquer Approach for Predict+Optimize
The predict+optimize problem combines machine learning ofproblem coeffic...
read it

Optimal Decision Lists using SAT
Decision lists are one of the most easily explainable machine learning m...
read it

Optimal Decision Trees for Nonlinear Metrics
Nonlinear metrics, such as the F1score, Matthews correlation coefficien...
read it

Computing Optimal Decision Sets with SAT
As machine learning is increasingly used to help make decisions, there i...
read it

MurTree: Optimal Classification Trees via Dynamic Programming and Search
Decision tree learning is a widely used approach in machine learning, fa...
read it

Random errors are not politically neutral
Errors are inevitable in the implementation of any complex process. Here...
read it

You can do RLAs for IRV
The City and County of San Francisco, CA, has used Instant Runoff Voting...
read it

Smart PredictandOptimize for Hard Combinatorial Optimization Problems
Combinatorial optimization assumes that all parameters of the optimizati...
read it

RiskLimiting Audits for IRV Elections
Risklimiting post election audits guarantee a high probability of corre...
read it

Solution Dominance over Constraint Satisfaction Problems
Constraint Satisfaction Problems (CSPs) typically have many solutions th...
read it

Searching with Consistent Prioritization for MultiAgent Path Finding
We study prioritized planning for MultiAgent Path Finding (MAPF). Exist...
read it

Precondition Inference via Partitioning of Initial States
Precondition inference is a nontrivial task with several applications i...
read it

Preproceedings of the 28th International Symposium on LogicBased Program Synthesis and Transformation (LOPSTR 2018)
This volume constitutes the preproceedings of the 28th International Sy...
read it

An iterative approach to precondition inference using constrained Horn clauses
We present a method for automatic inference of conditions on the initial...
read it

Unsatisfiable Cores and Lower Bounding for Constraint Programming
Constraint Programming (CP) solvers typically tackle optimization proble...
read it

Efficient Computation of Exact IRV Margins
The margin of victory is easy to compute for many election schemes but d...
read it

Structure Based Extended Resolution for Constraint Programming
Nogood learning is a powerful approach to reducing search in Constraint ...
read it

Unsatisfiable Cores for Constraint Programming
Constraint Programming (CP) solvers typically tackle optimization proble...
read it

Explaining TimeTableEdgeFinding Propagation for the Cumulative Resource Constraint
Cumulative resource constraints can model scarce resources in scheduling...
read it

Search Combinators
The ability to model search in a constraint solver can be an essential a...
read it

Boolean Equipropagation for Optimized SAT Encoding
We present an approach to propagation based solving, Boolean equipropag...
read it

Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
The technical report presents a generic exact solution approach for mini...
read it
Peter J. Stuckey
is this you? claim profile