Binary vs. non-binary constraints☆☆This paper includes results that first appeared in [1,4,23]. This research has been supported in part by the Canadian Government through their NSERC and IRIS programs, and by the EPSRC Advanced Research Fellowship program [Book Review]

, , &
Artificial Intelligence 140 (1-2):1-37 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(02)00210-2

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 97,006

External links

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

Through your library

My notes

Similar books and articles

Decomposable constraints☆☆Supported by EPSRC award GR/L/24014. The authors wish to thank other members of the APES research group.Ian Gent, Kostas Stergiou & Toby Walsh - 2000 - Artificial Intelligence 123 (1-2):133-156.
Domain filtering consistencies for non-binary constraints.Christian Bessiere, Kostas Stergiou & Toby Walsh - 2008 - Artificial Intelligence 172 (6-7):800-822.
From binary temporal relations to non-binary ones and back☆☆Parts of this paper have been published in [36] and in [39]. [REVIEW]Steffen Staab - 2001 - Artificial Intelligence 128 (1-2):1-29.
Lifting integrity constraints in binary aggregation.Umberto Grandi & Ulle Endriss - 2013 - Artificial Intelligence 199-200 (C):45-66.
Cyclic consistency: A local reduction operation for binary valued constraints.Martin C. Cooper - 2004 - Artificial Intelligence 155 (1-2):69-92.
Nonmonotonic reasoning by inhibition nets☆☆This paper has been supported by the Austrian Research Fund FWF (SFB F012).Hannes Leitgeb - 2001 - Artificial Intelligence 128 (1-2):161-201.
On forward checking for non-binary constraint satisfaction.Christian Bessière, Pedro Meseguer, Eugene C. Freuder & Javier Larrosa - 2002 - Artificial Intelligence 141 (1-2):205-224.
A note on incorrect inferences in non-binary qualitative probabilistic networks.Jack Storror Carter - 2024 - Artificial Intelligence 335 (C):104180.
Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy.Daniel Fernández-González & Carlos Gómez-Rodríguez - 2019 - Artificial Intelligence 275 (C):559-574.
Generalitation of the function N in Computational Analysis (12th edition).Rosanna Festa - 2024 - International Journal of Science, Engeneering and Technology 12 (2):1-4.

Analytics

Added to PP
2020-12-22

Downloads
17 (#1,006,927)

6 months
9 (#717,820)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.

Add more references