From Constraints to Resolution Rules, Part II: chains, braids, confluence and T&E

04/11/2013
by   Denis Berthier, et al.
0

In this Part II, we apply the general theory developed in Part I to a detailed analysis of the Constraint Satisfaction Problem (CSP). We show how specific types of resolution rules can be defined. In particular, we introduce the general notions of a chain and a braid. As in Part I, these notions are illustrated in detail with the Sudoku example - a problem known to be NP-complete and which is therefore typical of a broad class of hard problems. For Sudoku, we also show how far one can go in 'approximating' a CSP with a resolution theory and we give an empirical statistical analysis of how the various puzzles, corresponding to different sets of entries, can be classified along a natural scale of complexity. For any CSP, we also prove the confluence property of some Resolution Theories based on braids and we show how it can be used to define different resolution strategies. Finally, we prove that, in any CSP, braids have the same solving capacity as Trial-and-Error (T&E) with no guessing and we comment this result in the Sudoku case.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/11/2013

From Constraints to Resolution Rules, Part I: Conceptual Framework

Many real world problems naturally appear as constraints satisfaction pr...
09/27/2017

Surjective H-Colouring over Reflexive Digraphs

The Surjective H-Colouring problem is to test if a given graph allows a ...
04/05/2013

Pattern-Based Constraint Satisfaction and Logic Puzzles

Pattern-Based Constraint Satisfaction and Logic Puzzles develops a pure ...
03/29/2020

A combinatorial MA-complete problem

Despite the interest in the complexity class MA, the randomized analog o...
06/25/2021

Complexity of Deciding Syntactic Equivalence up to Renaming for Term Rewriting Systems (Extended Version)

Inspired by questions from program transformations, eight notions of iso...
07/05/2021

Quantaloidal approach to constraint satisfaction

The constraint satisfaction problem (CSP) is a computational problem tha...
03/29/2020

On amenability of constraint satisfaction problems

Recent results show that a constraint satisfaction problem (CSP) defined...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.