Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition

Artificial Intelligence 41 (3):273-312 (1990)
  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: 102,546

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

Analytics

Added to PP
2020-12-22

Downloads
22 (#998,686)

6 months
6 (#757,679)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.
Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.
Reasoning about qualitative temporal information.Peter van Beek - 1992 - Artificial Intelligence 58 (1-3):297-326.

View all 36 citations / Add more citations

References found in this work

A truth maintenance system.Jon Doyle - 1979 - Artificial Intelligence 12 (3):231-272.
Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
An assumption-based TMS.Johan de Kleer - 1986 - Artificial Intelligence 28 (2):127-162.

View all 12 references / Add more references