A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation

Author

Janssen, P. ; Jegou, P. ; Nouguier, B. ; Vilarem, M.C.

Author_Institution

Centre de Recherche en Inf. de Montpellier, France

fYear

1989

fDate

23-25 Oct 1989

Firstpage

420

Lastpage

427

Abstract

Considers the use of a partial consistency, issuing from relational database theory, within the constraint-satisfaction problems (CSPs) framework, i.e., pairwise consistency. This partial consistency concerns general CSPs (i.e., CSPs the constraints of which may involve more than two variables). The authors provide a polynomial algorithm for achieving this consistency; then they extend the class of polynomially solvable CSPs. This algorithm is based on a minimal binary representation of a general CSP

Keywords

computability; constraint theory; database theory; filtering and prediction theory; relational databases; binary representation; filtering process; general constraint-satisfaction problems; pairwise-consistency; partial consistency; polynomial algorithm; relational database theory; Constraint theory; Filtering algorithms; NP-complete problem; Pattern matching; Polynomials; Production systems; Relational databases; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Tools for Artificial Intelligence, 1989. Architectures, Languages and Algorithms, IEEE International Workshop on

Conference_Location

Fairfax, VA

Print_ISBN

0-8186-1984-8

Type

conf

DOI

10.1109/TAI.1989.65349

Filename

65349