Local consistency in parallel constraint satisfaction networks

Simon Kasif, Arthur L. Delcher

Research output: Contribution to journalArticle


In this paper we present several basic techniques for achieving parallel execution of constraint networks. The major result supported by our investigations is that the parallel complexity of constraint networks is critically dependent on subtle properties of the network that do not influence its sequential complexity.

Original languageEnglish (US)
Pages (from-to)307-327
Number of pages21
JournalArtificial Intelligence
Issue number1-2
Publication statusPublished - 1994
Externally publishedYes


ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics

Cite this