An efficient cross product representation of the constraint satisfaction problem search space

Authors:
Paul D. Hubbe;Eugene C. Freuder
Affiliations:
Computer Science Department, University of New Hampshire, Durham, NH;Computer Science Department, University of New Hampshire, Durham, NH
Venue:
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Year:
1992

Citing 4
Cited 3

Constraint satisfaction algorithms

Computational Intelligence
Backtrack Programming

Journal of the ACM (JACM)
Taking advantage of stable sets of variables in constraint satisfaction problems

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Ways of Maintaining Arc Consistency in Search Using the Cartesian Representation

Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Extracting constraint satisfaction subproblems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Asynchronous aggregation and consistency in distributed constraint satisfaction

Artificial Intelligence - Special issue: Distributed constraint satisfaction

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint satisfaction problems involve finding values for variables subject to constraints on which combinations of values are permitted. They arise in a wide variety of domains, ranging from scene analysis to temporal reasoning. We present a new representation for partial solutions as cross products of sets of values. This representation can be used to improve the performance of standard algorithms, especially when seeking all solutions or discovering that none exist.