Efficient cross product representation of the constraint satisfaction problem search space

  • Paul D. Hubbe
  • , Eugene C. Freuder

Research output: Chapter in Book/Report/Conference proceedingsConference proceedingpeer-review

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.

Original languageEnglish
Title of host publicationProceedings Tenth National Conference on Artificial Intelligence
PublisherPubl by AAAI
Pages421-427
Number of pages7
ISBN (Print)0262510634
Publication statusPublished - 1992
EventProceedings Tenth National Conference on Artificial Intelligence - AAAI-92 - San Jose, CA, USA
Duration: 12 Jul 199216 Jul 1992

Publication series

NameProceedings Tenth National Conference on Artificial Intelligence

Conference

ConferenceProceedings Tenth National Conference on Artificial Intelligence - AAAI-92
CitySan Jose, CA, USA
Period12/07/9216/07/92

Fingerprint

Dive into the research topics of 'Efficient cross product representation of the constraint satisfaction problem search space'. Together they form a unique fingerprint.

Cite this