200 citations · 450 across the 51 of their papers we have counts for
59 papers
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…
Multi-Target Search in Euclidean Space with Ray Shooting (Full Version)
Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema +2
The Euclidean shortest path problem (ESPP) is a well studied problem with many practical applications. Recently a new efficient online approach to this problem, RayScan, has been d…
Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery
Zhe Chen, Javier Alonso-Mora, Xiaoshan Bai +2
Multi-agent Pickup and Delivery (MAPD) is a challenging industrial problem where a team of robots is tasked with transporting a set of tasks, each from an initial location and each…
Transformation-Enabled Precondition Inference
Bishoksan Kafle, Graeme Gange, Peter J. Stuckey +2
Precondition inference is a non-trivial problem with important applications in program analysis and verification. We present a novel iterative method for automatically deriving pre…
Planning with Learned Binarized Neural Networks Benchmarks for MaxSAT Evaluation 2021
Buser Say, Scott Sanner, Jo Devriendt +2
This document provides a brief introduction to learned automated planning problem where the state transition function is in the form of a binarized neural network (BNN), presents a…
Assertion-Based Approaches to Auditing Complex Elections, with Application to Party-List Proportional Elections
Michelle Blom, Jurlind Budurushi, Ronald L. Rivest +4
Risk-limiting audits (RLAs), an ingredient in evidence-based elections, are increasingly common. They are a rigorous statistical means of ensuring that electoral results are correc…