Domain dependence in parallel constraint satisfaction

Authors:
Paul R. Cooper;Michael J. Swain
Affiliations:
Department of Computer Science, University of Rochester, Rochester, New York;Department of Computer Science, University of Rochester, Rochester, New York
Venue:
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Year:
1989

Citing 5
Cited 0

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
Arc and path consistence revisited

Artificial Intelligence
Synthesizing constraint expressions

Communications of the ACM
Logic for Artificial Intelligence

Logic for Artificial Intelligence
Logic Minimization Algorithms for VLSI Synthesis

Logic Minimization Algorithms for VLSI Synthesis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the solution of problems in the domain. The technique is applied to reduce the space complexity of the the massively parallel AC Chip algorithm. Results of the optimizations are shown for an object recognition domain in which they reduce the complexity of the chip by many orders of magnitude. The technique can be applied analogously to reduce the time complexity of the uniprocessor arc consistency algorithm AC-4.