A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs

Author

Jegou, Philippe ; Ndiaye, Samba Ndojh ; Terrioux, Cyril

Author_Institution

LSIS-UMRCNRS6168, Univ. Paul Cezanne (Aix-Marseille 3), Marseille

Volume

1

fYear

2008

fDate

3-5 Nov. 2008

Firstpage

486

Lastpage

490

Abstract

In this paper, a new evaluation of the complexity of forward checking for solving non-binary CSPs with finite domains is proposed. Unlike what is done usually, it does not consider the size of domains, but the size of the relations associated to the constraints. It may lead sometimes to define better complexity bounds. By using this first result, we show that the tractability hierarchy proposed in [6] which compares different methods based on a decomposition of constraint networks can be seen from a new viewpoint.

Keywords

backtracking; constraint theory; formal verification; CSP formalism; constraint networks; constraint satisfaction problems; forward checking; tractability hierarchy; Algorithm design and analysis; Artificial intelligence; Bayesian methods; Clustering algorithms; Constraint optimization; Filtering algorithms; Filters; Large scale integration; Relational databases; Structural engineering; Constraint satisfaction; structural methods;

fLanguage

English

Publisher

ieee

Conference_Titel

Tools with Artificial Intelligence, 2008. ICTAI '08. 20th IEEE International Conference on

Conference_Location

Dayton, OH

ISSN

1082-3409

Print_ISBN

978-0-7695-3440-4

Type

conf

DOI

10.1109/ICTAI.2008.116

Filename

4669727