Decomposing constraint satisfaction problems using database techniques

Marc Gyssens; Peter Jeavons; David A. Cohen

doi:10.1016/0004-3702(94)90003-5

ScienceGate Book Chapters

JOURNAL ARTICLE

Decomposing constraint satisfaction problems using database techniques

Marc Gyssens Peter Jeavons David A. Cohen

Year: 1994 Journal: Artificial Intelligence Vol: 66 (1)Pages: 57-89 Publisher: Elsevier BV

DOI: 10.1016/0004-3702(94)90003-5

Get Full-Text PDF Get Analytical Report

Keywords:

Constraint satisfaction problem Hypergraph Constraint satisfaction Decomposition method (queueing theory) Constraint (computer-aided design) Relational database Constraint satisfaction dual problem Computer science Decomposition Constraint programming Hybrid algorithm (constraint satisfaction) Simple (philosophy) Backtracking Join (topology) Theoretical computer science Constraint logic programming Local consistency Mathematics Data mining Mathematical optimization Algorithm Artificial intelligence Discrete mathematics Combinatorics

Metrics

176

Cited By

7.48

FWCI (Field Weighted Citation Impact)

Refs

0.98

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Constraint Satisfaction and Optimization

Physical Sciences → Computer Science → Computer Networks and Communications

Advanced Database Systems and Queries

Physical Sciences → Computer Science → Computer Networks and Communications

Decomposing constraint satisfaction problems using database techniques

Metrics

Citation History

Topics

Related Documents

Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems

Uniform Constraint Satisfaction Problems and Database Theory

Constraint Satisfaction Techniques for Combinatorial Problems

Solution Techniques for Constraint Satisfaction Problems

Adaptation using constraint satisfaction techniques