Search Results for author:
Found 8 papers, 3 papers with code
Bridging the Gap between Structural and Semantic Similarity in Diverse Planning
In this work, we propose two new domain-independent metrics which are able to capture relevant information on the difference between two given plans from a domain-dependent viewpoint.
Towards a Model of Puzznic
We report on progress in modelling and solving Puzznic, a video game requiring the player to plan sequences of moves to clear a grid by matching blocks.
Automatic Tabulation in Constraint Models
The performance of a constraint model can often be improved by converting a subproblem into a single table constraint.
Towards Reformulating Essence Specifications for Robustness
The Essence language allows a user to specify a constraint problem at a level of abstraction above that at which constraint modelling decisions are made.
Using Small MUSes to Explain How to Solve Pen and Paper Puzzles
In this paper, we present Demystify, a general tool for creating human-interpretable step-by-step explanations of how to solve a wide range of pen and paper puzzles from a high-level logical description.
The Winnability of Klondike Solitaire and Many Other Patience Games
Our ignorance of the winnability percentage of the game in the Windows Solitaire program, more properly called 'Klondike', has been described as "one of the embarrassments of applied mathematics".
A Review of Literature on Parallel Constraint Solving
As multicore computing is now standard, it seems irresponsible for constraints researchers to ignore the implications of it.
Generalized Support and Formal Development of Constraint Propagators
One key concept in constraint programming is propagation: reasoning on a constraint or set of constraints to derive new facts, typically to remove values from the domains of decision variables.
