Domain Dependence in Parallel Constraint Satisfaction

Cooper, Paul R.; Swain, Michael J.

Domain Dependence in Parallel Constraint Satisfaction

Download BibTeX Cite

Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Tools. Pages 54-58.

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.

Paul R. Cooper, and Michael J. Swain. 1989. Domain Dependence in Parallel Constraint Satisfaction. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89. IJCAI, 54–58. https://ijcai.org/proceedings/1989/9

@inproceedings{ijcai1989p9,
  title     = {Domain Dependence in Parallel Constraint Satisfaction},
  author    = {Cooper, Paul R. and Swain, Michael J.},
  booktitle = {Proceedings of the Eleventh International Joint Conference on
               Artificial Intelligence, {IJCAI-89}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {N. S. Sridharan},
  pages     = {54--58},
  year      = {1989},
  month     = {8},
  note      = {Tools},
  url       = {https://ijcai.org/proceedings/1989/9},
}

TY  - CPAPER
TI  - Domain Dependence in Parallel Constraint Satisfaction
AU  - Cooper, Paul R.
AU  - Swain, Michael J.
T2  - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1989
SP  - 54
EP  - 58
UR  - https://ijcai.org/proceedings/1989/9
ER  -