Hybrid backtracking bounded by tree-decomposition of constraint networks

&
Artificial Intelligence 146 (1):43-75 (2003)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(02)00400-9

Other Versions

No versions found

Links

PhilArchive



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

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

Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.
Maximum likelihood bounded tree-width Markov networks.Nathan Srebro - 2003 - Artificial Intelligence 143 (1):123-138.
Backjump-based backtracking for constraint satisfaction problems.Rina Dechter & Daniel Frost - 2002 - Artificial Intelligence 136 (2):147-188.
Backtracking techniques for the job shop scheduling constraint satisfaction problem.Norman Sadeh, Katia Sycara & Yalin Xiong - 1995 - Artificial Intelligence 76 (1-2):455-480.
Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems.Younes Mechqrane, Mohamed Wahbi, Christian Bessiere & Kenneth N. Brown - 2020 - Artificial Intelligence 278 (C):103169.
On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning.Subbarao Kambhampati - 1998 - Artificial Intelligence 105 (1-2):161-208.
Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition.Rina Dechter - 1990 - Artificial Intelligence 41 (3):273-312.
Hybrid artificial intelligence system in constraint based scheduling of integrated manufacturing ERP systems.Izabela Rojek & Mieczysław Jagodziński - 2012 - In Emilio Corchado, Vaclav Snasel, Ajith Abraham, Michał Woźniak, Manuel Grana & Sung-Bae Cho (eds.), Hybrid Artificial Intelligent Systems. Springer. pp. 229--240.
EVEXED and MEET for mechanical design: testing structural decomposition and constraint propagation.L. Steinberg & N. Langrana - 1996 - Artificial Intelligence 84 (1-2):37-56.
Hybrid tractability of valued constraint problems.Martin C. Cooper & Stanislav Živný - 2011 - Artificial Intelligence 175 (9-10):1555-1569.

Analytics

Added to PP
2020-12-22

Downloads
11 (#1,423,075)

6 months
5 (#1,053,842)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

AND/OR search spaces for graphical models.Rina Dechter & Robert Mateescu - 2007 - Artificial Intelligence 171 (2-3):73-106.

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.

View all 10 references / Add more references