More download options

On the power of structural decompositions of graph-based representations of constraint problems

Gianluigi Greco & Francesco Scarcello

Artificial Intelligence 174 (5-6):382-409 (2010) Copy BIBT_EX

Abstract

This article has no associated abstract. (fix it)

Cite

Plain text

BibTeX

Formatted text

Reference Manager

RefWorks

Options

Mark as duplicate

Find it on Scholar

Request removal from index

Revision history

Categories

Science, Logic, and Mathematics

Keywords

Reprint years

DOI

10.1016/j.artint.2009.12.004

Other Versions

No versions found

Links

PhilArchive

Upload a copy of this work Papers currently archived: 100,154

External links

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

Through your library

Sign in / register and customize your OpenURL resolver
Configure custom resolver

My notes

Sign in to use this feature

Similar books and articles

Skypattern mining: From pattern condensed representations to dynamic constraint satisfaction problems.Willy Ugarte, Patrice Boizumault, Bruno Crémilleux, Alban Lepailleur, Samir Loudni, Marc Plantevit, Chedy Raïssi & Arnaud Soulet - 2017 - Artificial Intelligence 244 (C):48-69.

Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP.Minh Binh Do & Subbarao Kambhampati - 2001 - Artificial Intelligence 132 (2):151-182.

Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.

Backjump-based backtracking for constraint satisfaction problems.Rina Dechter & Daniel Frost - 2002 - Artificial Intelligence 136 (2):147-188.

Approximating problems in abstract argumentation with graph convolutional networks.Lars Malmqvist, Tangming Yuan & Peter Nightingale - 2024 - Artificial Intelligence 336 (C):104209.

Graph-based construction of minimal models.Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Fabio Fassetti & Luigi Palopoli - 2022 - Artificial Intelligence 313 (C):103754.

Compiling constraint satisfaction problems.Rainer Weigel & Boi Faltings - 1999 - Artificial Intelligence 115 (2):257-287.

EVEXED and MEET for mechanical design: testing structural decomposition and constraint propagation.L. Steinberg & N. Langrana - 1996 - Artificial Intelligence 84 (1-2):37-56.

Solving quantified constraint satisfaction problems.Ian P. Gent, Peter Nightingale, Andrew Rowley & Kostas Stergiou - 2008 - Artificial Intelligence 172 (6-7):738-771.

Exploiting the deep structure of constraint problems.Colin P. Williams & Tad Hogg - 1994 - Artificial Intelligence 70 (1-2):73-117.

Analytics

Added to PP
2020-12-22

Downloads
10 (#1,459,644)

6 months
4 (#1,232,709)

Historical graph of downloads

How can I increase my downloads?

Citations of this work

On the complexity of core, kernel, and bargaining set.Gianluigi Greco, Enrico Malizia, Luigi Palopoli & Francesco Scarcello - 2011 - Artificial Intelligence 175 (12-13):1877-1910.

Characteristic function games with restricted agent interactions: Core-stability and coalition structures.Georgios Chalkiadakis, Gianluigi Greco & Evangelos Markakis - 2016 - Artificial Intelligence 232 (C):76-113.

Add more citations

References found in this work

A comparison of structural CSP decomposition methods.Georg Gottlob, Nicola Leone & Francesco Scarcello - 2000 - Artificial Intelligence 124 (2):243-282.

Decomposing constraint satisfaction problems using database techniques.Marc Gyssens, Peter G. Jeavons & David A. Cohen - 1994 - Artificial Intelligence 66 (1):57-89.

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. [REVIEW]Fahiem Bacchus, Xinguang Chen, Peter van Beek & Toby Walsh - 2002 - Artificial Intelligence 140 (1-2):1-37.

Add more references