Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination

, &
Artificial Intelligence 174 (9-10):570-584 (2010)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2010.03.002

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

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

Hybrid tractability of valued constraint problems.Martin C. Cooper & Stanislav Živný - 2011 - Artificial Intelligence 175 (9-10):1555-1569.
The complexity of recursive constraint satisfaction problems.Victor W. Marek & Jeffrey B. Remmel - 2010 - Annals of Pure and Applied Logic 161 (3):447-457.
Variable-Centered Consistency in Model RB.Liang Li, Tian Liu & Ke Xu - 2013 - Minds and Machines 23 (1):95-103.
Simple cut elimination proof for hybrid logic.Andrezj Indrzejczak - 2016 - Logic and Logical Philosophy 25 (2):129-141.
The complexity of soft constraint satisfaction.David A. Cohen, Martin C. Cooper, Peter G. Jeavons & Andrei A. Krokhin - 2006 - Artificial Intelligence 170 (11):983-1016.
The Constraint Satisfaction Problem and Universal Algebra.Libor Barto - 2015 - Bulletin of Symbolic Logic 21 (3):319-337.
Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem.Norman Sadeh & Mark S. Fox - 1996 - Artificial Intelligence 86 (1):1-41.
The Missing-Desires Objection to Hybrid Theories of Well-Being.William Lauinger - 2013 - Southern Journal of Philosophy 51 (2):270-295.
Decomposing constraint satisfaction problems using database techniques.Marc Gyssens, Peter G. Jeavons & David A. Cohen - 1994 - Artificial Intelligence 66 (1):57-89.
Prototypes for definable subsets of algebraically closed valued fields.Jan E. Holly - 1997 - Journal of Symbolic Logic 62 (4):1093-1141.
Prototypes for Definable Subsets of Algebraically Closed Valued Fields.Jan Holly - 1997 - Journal of Symbolic Logic 62 (4):1093-1141.
A Compactness Theorem For Infinite Constraint Satisfaction.Robert Cowen - 1998 - Reports on Mathematical Logic:97-107.
The computational complexity of hybrid temporal logics.C. Areces, P. Blackburn & M. Marx - 2000 - Logic Journal of the IGPL 8 (5):653-679.
Bounded fixed-parameter tractability and reducibility.Rod Downey, Jörg Flum, Martin Grohe & Mark Weyer - 2007 - Annals of Pure and Applied Logic 148 (1):1-19.
Fundamental properties of neighbourhood substitution in constraint satisfaction problems.Martin C. Cooper - 1997 - Artificial Intelligence 90 (1-2):1-24.

Analytics

Added to PP
2020-12-22

Downloads
2 (#1,790,546)

6 months
1 (#1,506,218)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Hybrid tractability of valued constraint problems.Martin C. Cooper & Stanislav Živný - 2011 - Artificial Intelligence 175 (9-10):1555-1569.

Add more citations

References found in this work

Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.
Bucket elimination: A unifying framework for reasoning.Rina Dechter - 1999 - Artificial Intelligence 113 (1-2):41-85.
Tractable constraints on ordered domains.Peter G. Jeavons & Martin C. Cooper - 1995 - Artificial Intelligence 79 (2):327-339.

View all 6 references / Add more references