Ciaran McCreesh
YOU?
Author Swipe
View article: Certifying Bounds Propagation for Integer Multiplication Constraints
Certifying Bounds Propagation for Integer Multiplication Constraints Open
A constraint programming (CP) solver that implements proof logging will output a machine-checkable certificate of correctness alongside any result it obtains. This is useful for trusting claims of unsatisfiability or optimality, as well as…
View article: Sketch Decompositions for Classical Planning via Deep Reinforcement Learning
Sketch Decompositions for Classical Planning via Deep Reinforcement Learning Open
In planning and reinforcement learning, the identification of common subgoal structures across problems is important when goals are to be achieved over long horizons. Recently, it has been shown that such structures can be expressed as fea…
View article: End-to-End Verification for Subgraph Solving
End-to-End Verification for Subgraph Solving Open
Modern subgraph-finding algorithm implementations consist of thousands of lines of highly optimized code, and this complexity raises questions about their trustworthiness. Recently, some state-of-the-art subgraph solvers have been enhanced…
View article: Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms
Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms Open
Pseudo-Boolean proof logging has been used successfully to provide certificates of optimality from a variety of constraint- and satisifability-style solvers that combine reasoning with a backtracking or clause-learning search. Another para…
View article: Proof Logging for the Circuit Constraint
Proof Logging for the Circuit Constraint Open
Proof logging in constraint programming is an approach to certifying a conclusion reached by a solver. To allow for this, different propagators must be augmented to produce justifications for any inferences they make, so that an independen…
View article: Certified Dominance and Symmetry Breaking for Combinatorial Optimisation
Certified Dominance and Symmetry Breaking for Combinatorial Optimisation Open
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and optimisation problems, but the correctness of these techniques sometimes relies on subtle arguments. For this reason, it is desirable to produce effic…
View article: Certified Symmetry and Dominance Breaking for Combinatorial Optimisation
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation Open
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and optimisation problems, but the correctness of these techniques sometimes relies on subtle arguments. For this reason, it is desirable to produce effic…
View article: Certified Symmetry and Dominance Breaking for Combinatorial Optimisation
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation Open
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and optimisation problems, but the correctness of these techniques sometimes relies on subtle arguments. For this reason, it is desirable to produce effic…
View article: An Auditable Constraint Programming Solver
An Auditable Constraint Programming Solver Open
We describe the design and implementation of a new constraint programming solver that can produce an auditable record of what problem was solved and how the solution was reached. As well as a solution, this solver provides an independently…
View article: Analyzed Benchmarks on Experiments for a Complications for Computational Experiments from Modern Processors
Analyzed Benchmarks on Experiments for a Complications for Computational Experiments from Modern Processors Open
For details see: Johannes K. Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab: Complications for Computational Experiments from Modern Processors, Proceedings of the 27th International Conference on Principles and Practice of Constraint…
View article: Analyzed Benchmarks on Experiments for a Complications for Computational Experiments from Modern Processors
Analyzed Benchmarks on Experiments for a Complications for Computational Experiments from Modern Processors Open
For details see: Johannes K. Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab: Complications for Computational Experiments from Modern Processors, Proceedings of the 27th International Conference on Principles and Practice of Constraint…
View article: Analyzed Benchmarks on Experiments for a Complications for Computational Experiments from Modern Processors
Analyzed Benchmarks on Experiments for a Complications for Computational Experiments from Modern Processors Open
For details see: Johannes K. Fichte, Markus Hecher, Ciaran McCreesh, Anas Shahab: Complications for Computational Experiments from Modern Processors, Proceedings of the 27th International Conference on Principles and Practice of Constraint…
View article: Finding Maximum k-Cliques Faster Using Lazy Global Domination
Finding Maximum k-Cliques Faster Using Lazy Global Domination Open
A clique in a graph is a set of vertices, each of which is adjacent to every other vertex in this set. A k-clique relaxes this requirement, requiring vertices to be within a distance k of each other, rather than directly adjacent. In theor…
View article: Practical Bigraphs via Subgraph Isomorphism - Benchmark Instances
Practical Bigraphs via Subgraph Isomorphism - Benchmark Instances Open
A set of 11176 test instances for comparing the existing SAT solver found in BigraphER with the new Subgraph based solver using the Glasgow subgraph solver. See README for details. Also included in results.tar.xz are those presented in the…
View article: Practical Bigraphs via Subgraph Isomorphism - Benchmark Instances
Practical Bigraphs via Subgraph Isomorphism - Benchmark Instances Open
A set of 11176 test instances for comparing the existing SAT solver found in BigraphER with the new Subgraph based solver using the Glasgow subgraph solver. See README for details. Also included in results.tar.xz are those presented in the…
View article: Solving Graph Homomorphism and Subgraph Isomorphism Problems Faster Through Clique Neighbourhood Constraints
Solving Graph Homomorphism and Subgraph Isomorphism Problems Faster Through Clique Neighbourhood Constraints Open
Graph homomorphism problems involve finding adjacency-preserving mappings between two given graphs. Although theoretically hard, these problems can often be solved in practice using constraint programming algorithms. We show how techniques…
View article: Practical Bigraphs via Subgraph Isomorphism
Practical Bigraphs via Subgraph Isomorphism Open
Bigraphs simultaneously model the spatial and non-spatial relationships between entities, and have been used for systems modelling in areas including biology, networking, and sensors. Temporal evolution can be modelled through a rewriting …
View article: Complications for Computational Experiments from Modern Processors
Complications for Computational Experiments from Modern Processors Open
In this paper, we revisit the approach to empirical experiments for combinatorial solvers. We provide a brief survey on tools that can help to make empirical work easier. We illustrate origins of uncertainty in modern hardware and show how…
View article: Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions
Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions Open
Modern subgraph isomorphism solvers carry out sophisticated reasoning using graph invariants such as degree sequences and path counts. We show that all of this reasoning can be justified compactly using the cutting planes proofs studied in…
View article: Justifying All Differences Using Pseudo-Boolean Reasoning
Justifying All Differences Using Pseudo-Boolean Reasoning Open
Constraint programming solvers support rich global constraints and propagators, which make them both powerful and hard to debug. In the Boolean satisfiability community, proof-logging is the standard solution for generating trustworthy out…
View article: ciaranm/certified-constraint-solver: AAAI2020
ciaranm/certified-constraint-solver: AAAI2020 Open
This version of the code is associated with the AAAI 2020 paper "Justifying All Differences Using Pseudo-Boolean Reasoning".
View article: A review of literature on parallel constraint solving
A review of literature on parallel constraint solving Open
As multi-core computing is now standard, it seems irresponsible for constraints researchers to ignore the implications of it. Researchers need to address a number of issues to exploit parallelism, such as: investigating which constraint al…
View article: When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases
When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases Open
The subgraph isomorphism problem involves deciding whether a copy of a pattern graph occurs inside a larger target graph. The non-induced version allows extra edges in the target, whilst the induced version does not. Although both variants…
View article: A Partitioning Algorithm for Maximum Common Subgraph Problems
A Partitioning Algorithm for Maximum Common Subgraph Problems Open
We introduce a new branch and bound algorithm for the maximum common subgraph and maximum common connected subgraph problems which is based around vertex labelling and partitioning. Our method in some ways resembles a traditional constrain…
View article: Between Subgraph Isomorphism and Maximum Common Subgraph
Between Subgraph Isomorphism and Maximum Common Subgraph Open
When a small pattern graph does not occur inside a larger target graph, we can ask how to find "as much of the pattern as possible" inside the target graph. In general, this is known as the maximum common subgraph problem, which is much mo…
View article: Task Variant Allocation in Distributed Robotics
Task Variant Allocation in Distributed Robotics Open
This paper tackles the problem of allocating tasks to a distributed heterogeneous robotic system, where tasks---named *task variants* in the paper---can vary in terms of trade-off between resource requirements and quality of service provid…