Karen E. Petrie
University of Dundee
30 Papers
291 Citations
Karen E. Petrie is an academic researcher from University of Dundee. The author has contributed to research in topics: Constraint programming & Constraint satisfaction problem. The author has an hindex of 10, co-authored 30 publications. Previous affiliations of Karen E. Petrie include University of Oxford & University of Huddersfield.
Chat about Author
Papers
Symmetry Definitions for Constraint Satisfaction Problems
TL;DR: The many different definitions of symmetry for constraint satisfaction problems (CSPs) are reviewed, and it is shown that a symmetry can be defined in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or else as anoperation preserving the constraints.
Symmetry definitions for constraint satisfaction problems
David Cohen,Peter Jeavons,Christopher Jefferson,Karen E. Petrie,Barbara M. Smith +4 more
- 01 Oct 2005
TL;DR: The many different definitions of symmetry for constraint satisfaction problems (CSPs) are reviewed, and it is shown that a symmetry can be defined in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or else as anoperation preserving the constraints.
Symmetry breaking in Graceful Graphs
Karen E. Petrie,Barbara M. Smith +1 more
- 29 Sep 2003
TL;DR: Symmetry occurs frequently in Constraint Satisfaction Problems (CSPs) and can cause wasted search, because the search for solutions may repeatedly visit partial assignments symmetric to ones already considered.
74
Learning When to Use Lazy Learning in Constraint Solving
Ian P. Gent,Christopher Jefferson,Lars Kotthoff,Ian Miguel,Neil C. A. Moore,Peter Nightingale,Karen E. Petrie +6 more
- 04 Aug 2010
TL;DR: This work shows that, in the context of a large benchmark set, standard ML approaches can be used to learn a simple, cheap classifier which performs well in identifying instances on which lazy learning should or should not be used.
53
Implementing logical connectives in constraint programming
TL;DR: A fast generic algorithm for reification using satisfying sets and movable triggers is presented, and it is proved that the Or algorithm enforces generalised arc consistency (GAC) when all its child constraints have a GAC propagator, and no variables are shared between children.
40