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

Artificial Intelligence 25 (1):65-74 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,854

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

分布推定アルゴリズムによる Memetic Algorithms を用いた制約充足問題解決.Handa Hisashi - 2004 - Transactions of the Japanese Society for Artificial Intelligence 19:405-412.

Analytics

Added to PP
2020-12-22

Downloads
14 (#1,287,610)

6 months
4 (#1,272,377)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Analyzing vision at the complexity level.John K. Tsotsos - 1990 - Behavioral and Brain Sciences 13 (3):423-445.
Qualitative simulation.Benjamin Kuipers - 1986 - Artificial Intelligence 29 (3):289-338.
Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.
Arc and path consistency revisited.Roger Mohr & Thomas C. Henderson - 1986 - Artificial Intelligence 28 (2):225-233.

View all 71 citations / Add more citations

References found in this work

Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.

Add more references