Solving connected row convex constraints by variable elimination

Artificial Intelligence 173 (12-13):1204-1219 (2009)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,169

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

Properties of tree convex constraints.Yuanlin Zhang & Eugene C. Freuder - 2008 - Artificial Intelligence 172 (12-13):1605-1612.
Realizing RCC8 networks using convex regions.Steven Schockaert & Sanjiang Li - 2015 - Artificial Intelligence 218 (C):74-105.

Analytics

Added to PP
2020-12-22

Downloads
16 (#1,292,631)

6 months
7 (#614,157)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
Bucket elimination: A unifying framework for reasoning.Rina Dechter - 1999 - Artificial Intelligence 113 (1-2):41-85.

Add more references