Peter J. Stuckey

research

∙ 08/22/2023

Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding

Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics tha...

0 Zhe Chen, et al. ∙

research

∙ 08/11/2023

The divergence time of protein structures modelled by Markov matrices and its relation to the divergence of sequences

A complete time-parameterized statistical model quantifying the divergen...

0 Sandun Rajapaksa, et al. ∙

research

∙ 07/20/2023

Adaptively Weighted Audits of Instant-Runoff Voting Elections: AWAIRE

An election audit is risk-limiting if the audit limits (to a pre-specifi...

0 Alexander Ek, et al. ∙

research

∙ 07/17/2023

Lifted Sequential Planning with Lazy Constraint Generation Solvers

This paper studies the possibilities made open by the use of Lazy Clause...

0 Anubhav Singh, et al. ∙

research

∙ 07/07/2023

On Formal Feature Attribution and Its Approximation

Recent years have witnessed the widespread use of artificial intelligenc...

0 Jinqiang Yu, et al. ∙

research

∙ 06/28/2023

Reducing Redundant Work in Jump Point Search

JPS (Jump Point Search) is a state-of-the-art optimal algorithm for onli...

0 Shizhe Zhao, et al. ∙

research

∙ 06/10/2023

Scalable Rail Planning and Replanning with Soft Deadlines

The Flatland Challenge, which was first held in 2019 and reported in Neu...

0 Zhe Chen, et al. ∙

research

∙ 05/15/2023

Tracking Progress in Multi-Agent Path Finding

Multi-Agent Path Finding (MAPF) is an important core problem for many ne...

0 Bojie Shen, et al. ∙

research

∙ 03/18/2023

Risk-Limiting Audits for Condorcet Elections

Elections where electors rank the candidates (or a subset of the candida...

0 Michelle Blom, et al. ∙

research

∙ 03/17/2023

ChameleonIDE: Untangling Type Errors Through Interactive Visualization and Exploration

Dynamically typed programming languages are popular in education and the...

0 Shuai Fu, et al. ∙

research

∙ 09/08/2022

Ballot-Polling Audits of Instant-Runoff Voting Elections with a Dirichlet-Tree Model

Instant-runoff voting (IRV) is used in several countries around the worl...

0 Floyd Everest, et al. ∙

research

∙ 07/06/2022

Multi-Target Search in Euclidean Space with Ray Shooting (Full Version)

The Euclidean shortest path problem (ESPP) is a well studied problem wit...

0 Ryan Hechenberger, et al. ∙

research

∙ 06/29/2022

Auditing Ranked Voting Elections with Dirichlet-Tree Models: First Steps

Ranked voting systems, such as instant-runoff voting (IRV) and single tr...

0 Floyd Everest, et al. ∙

research

∙ 06/20/2022

Eliminating The Impossible, Whatever Remains Must Be True

The rise of AI methods to make predictions and decisions has led to a pr...

0 Jinqiang Yu, et al. ∙

research

∙ 05/29/2022

Assessing the accuracy of the Australian Senate count: Key steps for a rigorous and transparent audit

This paper explains the main principles and some of the technical detail...

0 Michelle Blom, et al. ∙

research

∙ 12/18/2021

A First Approach to Risk-Limiting Audits for Single Transferable Vote Elections

Risk-limiting audits (RLAs) are an increasingly important method for che...

0 Michelle Blom, et al. ∙

research

∙ 10/28/2021

Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery

Multi-agent Pickup and Delivery (MAPD) is a challenging industrial probl...

0 Zhe Chen, et al. ∙

research

∙ 08/06/2021

Transformation-Enabled Precondition Inference

Precondition inference is a non-trivial problem with important applicati...

0 Bishoksan Kafle, et al. ∙

research

∙ 08/02/2021

Planning with Learned Binarized Neural Networks Benchmarks for MaxSAT Evaluation 2021

This document provides a brief introduction to learned automated plannin...

0 Buser Say, et al. ∙

research

∙ 07/25/2021

Assertion-based Approaches to Auditing Complex Elections, with application to party-list proportional elections

Risk-limiting audits (RLAs), an ingredient in evidence-based elections, ...

0 Michelle Blom, et al. ∙

research

∙ 03/12/2021

Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search

Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem t...

20 Jiaoyang Li, et al. ∙

research

∙ 02/17/2021

Symmetry Breaking for k-Robust Multi-Agent Path Finding

During Multi-Agent Path Finding (MAPF) problems, agents can be delayed b...

8 Zhe Chen, et al. ∙

research

∙ 02/17/2021

Auditing Hamiltonian Elections

Presidential primaries are a critical part of the United States Presiden...

0 Michelle Blom, et al. ∙

research

∙ 02/03/2021

A Scalable Two Stage Approach to Computing Optimal Decision Sets

Machine learning (ML) is ubiquitous in modern life. Since it is being de...

0 Alexey Ignatiev, et al. ∙

research

∙ 12/04/2020

Divide and Learn: A Divide and Conquer Approach for Predict+Optimize

The predict+optimize problem combines machine learning ofproblem coeffic...

0 Ali Ugur Guler, et al. ∙

research

∙ 10/19/2020

Optimal Decision Lists using SAT

Decision lists are one of the most easily explainable machine learning m...

0 Jinqiang Yu, et al. ∙

research

∙ 09/15/2020

Optimal Decision Trees for Nonlinear Metrics

Nonlinear metrics, such as the F1-score, Matthews correlation coefficien...

0 Emir Demirović, et al. ∙

research

∙ 07/29/2020

Computing Optimal Decision Sets with SAT

As machine learning is increasingly used to help make decisions, there i...

0 Jinqiang Yu, et al. ∙

research

∙ 07/24/2020

MurTree: Optimal Classification Trees via Dynamic Programming and Search

Decision tree learning is a widely used approach in machine learning, fa...

0 Emir Demirović, et al. ∙

research

∙ 07/02/2020

Random errors are not politically neutral

Errors are inevitable in the implementation of any complex process. Here...

0 Michelle Blom, et al. ∙

research

∙ 04/01/2020

You can do RLAs for IRV

The City and County of San Francisco, CA, has used Instant Runoff Voting...

0 Michelle Blom, et al. ∙

research

∙ 11/22/2019

Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems

Combinatorial optimization assumes that all parameters of the optimizati...

0 Jaynta Mandi, et al. ∙

research

∙ 03/20/2019

Risk-Limiting Audits for IRV Elections

Risk-limiting post election audits guarantee a high probability of corre...

0 Michelle Blom, et al. ∙

research

∙ 12/21/2018

Solution Dominance over Constraint Satisfaction Problems

Constraint Satisfaction Problems (CSPs) typically have many solutions th...

0 Tias Guns, et al. ∙

research

∙ 12/15/2018

Searching with Consistent Prioritization for Multi-Agent Path Finding

We study prioritized planning for Multi-Agent Path Finding (MAPF). Exist...

6 Hang Ma, et al. ∙

research

∙ 11/16/2018

Precondition Inference via Partitioning of Initial States

Precondition inference is a non-trivial task with several applications i...

0 Bishoksan Kafle, et al. ∙

research

∙ 08/02/2018

Pre-proceedings of the 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018)

This volume constitutes the pre-proceedings of the 28th International Sy...

0 Fred Mesnard, et al. ∙

research

∙ 04/17/2018

An iterative approach to precondition inference using constrained Horn clauses

We present a method for automatic inference of conditions on the initial...

0 Bishoksan Kafle, et al. ∙

research

∙ 08/25/2015

Unsatisfiable Cores and Lower Bounding for Constraint Programming

Constraint Programming (CP) solvers typically tackle optimization proble...

0 Nicholas Downing, et al. ∙

research

∙ 08/20/2015

Efficient Computation of Exact IRV Margins

The margin of victory is easy to compute for many election schemes but d...

0 Michelle Blom, et al. ∙

research

∙ 06/19/2013

Structure Based Extended Resolution for Constraint Programming

Nogood learning is a powerful approach to reducing search in Constraint ...

0 Geoffrey Chu, et al. ∙

research

∙ 05/08/2013

Unsatisfiable Cores for Constraint Programming

Constraint Programming (CP) solvers typically tackle optimization proble...

0 Nicholas Downing, et al. ∙

research

∙ 08/15/2012

Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint

Cumulative resource constraints can model scarce resources in scheduling...

0 Andreas Schutt, et al. ∙

research

∙ 03/06/2012

Search Combinators

The ability to model search in a constraint solver can be an essential a...

0 Tom Schrijvers, et al. ∙

research

∙ 04/24/2011

Boolean Equi-propagation for Optimized SAT Encoding

We present an approach to propagation based solving, Boolean equi-propag...

0 Amit Metodi, et al. ∙

research

∙ 09/02/2010

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...

0 Andreas Schutt, et al. ∙

Peter J. Stuckey

Featured Co-authors