• Publications
  • Influence
A First Practical Algorithm for High Levels of Relational Consistency
TLDR
We study the relational consistency property R(∗,m)C, present an algorithm for enforcing it, and compare the impact of our approach on the performance of problem solving with other consistency properties. Expand
  • 39
  • 2
  • PDF
An Interactive Constraint-Based Approach to Sudoku
TLDR
SOLVER is built to maximize the interactions between the human users and CP techniques. Expand
  • 5
  • PDF
USING CONSTRAINT PROCESSING TO MODEL, SOLVE, AND SUPPORT INTERACTIVE SOLVING OF SUDOKU PUZZLES
In this thesis, we model the Sudoku puzzle, a known NP-complete problem [ Yato, 2003 ] , as a Constraint Satisfaction Problem (CSP) and investigate solving it using Constraint Processing (CP)Expand
On Path Consistency for Binary Constraint Satisfaction Problems
TLDR
Constraint satisfaction problems (CSPs) provide a flexible and powerful framework for modeling and solving many decision problems of practical importance. Expand