Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination

Pokaż inne wersje (2)

The Constraint Satisfaction Problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tractability in such problems, such as the property of being tree-structured. In this paper we introduce the broken-triangle p...

Szczegółowa specyfikacja

Opis bibliograficzny
Główni autorzy:	Cooper, M, Jeavons, P, Salamon, A
Format:	Journal article
Wydane:	2010

Podobne zapisy

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
od: Cooper, M, i wsp.
Wydane: (2010)

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
od: Cooper, M, i wsp.
Wydane: (2010)

Hybrid tractable CSPs which generalize tree structure
od: Cooper, M, i wsp.
Wydane: (2008)

Perfect Constraints Are Tractable
od: Salamon, A, i wsp.
Wydane: (2008)

Perfect Constraints Are Tractable
od: Salamon, A, i wsp.
Wydane: (2008)

A Survey of Tractable Constraint Satisfaction Problems
od: J.K.Pearson, i wsp.
Wydane: (1997)

Hybrid tractability of constraint satisfaction problems with global constraints
od: Thorstensen, E
Wydane: (2013)

Characterising Tractable Constraints
od: M.C.Cooper, i wsp.
Wydane: (1994)

Tractable Constraints on Ordered Domains
od: P.G.Jeavons, i wsp.
Wydane: (1995)

Tractable Valued Constraints
od: Jeavons, P, i wsp.
Wydane: (2013)

Tractable valued constraints
od: Jeavons, P, i wsp.
Wydane: (2012)

A unified theory of structural tractability for constraint satisfaction problems
od: Cohen, D, i wsp.
Wydane: (2008)

A unified theory of structural tractability for constraint satisfaction problems
od: Cohen, D, i wsp.
Wydane: (2008)

Tractable Disjunctive Constraints
od: D.A.Cohen, i wsp.
Wydane: (1997)

Hybrid tractability of soft constraint problems
od: Cooper, M, i wsp.
Wydane: (2010)

Hybrid tractability of soft constraint problems
od: Cooper, M, i wsp.
Wydane: (2010)

Hybrid tractability of valued constraint problems
od: Cooper, M, i wsp.
Wydane: (2011)

Tractable Benchmarks For Constraint Programming
od: Petke, J, i wsp.
Wydane: (2009)

A maximal tractable class of soft constraints
od: Cohen, D, i wsp.
Wydane: (2004)

A maximal tractable class of soft constraints
od: Cohen, D, i wsp.
Wydane: (2004)

Building tractable disjunctive constraints
od: Cohen, D, i wsp.
Wydane: (2000)

Building tractable disjunctive constraints
od: Cohen, D, i wsp.
Wydane: (2000)

Tractable Combinations of Global Constraints
od: Cohen, D, i wsp.
Wydane: (2013)

Tractable combinations of global constraints
od: Cohen, D, i wsp.
Wydane: (2013)

Finite semigroups imposing tractable constraints
od: Bulatov, A, i wsp.
Wydane: (2002)

A Unifying Framework for Tractable Constraints
od: P.G.Jeavons, i wsp.
Wydane: (1995)

Variable and value elimination in binary constraint satisfaction via forbidden patterns
od: Cohen, DA, i wsp.
Wydane: (2015)

Tractable constraints closed under a binary operation
od: Bulatov, A, i wsp.
Wydane: (2000)

A new hybrid tractable class of soft constraint problems
od: Cooper, M, i wsp.
Wydane: (2010)

Semantic width and the fixed-parameter tractability of constraint satisfaction problems
od: Chen, H, i wsp.
Wydane: (2020)

Constraint Tractability Theory And Its Application to the Product Development Process for a Constraint−Based Scheduler
od: Purvis, L, i wsp.
Wydane: (1999)

On Tractable Queries and Constraints
od: Gottlob, G, i wsp.
Wydane: (1999)

Probabilistic models over weighted orderings: fixed-parameter tractable variable elimination
od: Lukasiewicz, T, i wsp.
Wydane: (2016)

The order encoding: from tractable CSP to tractable SAT
od: Petke, J, i wsp.
Wydane: (2011)

The order encoding: From tractable CSP to tractable SAT
od: Petke, J, i wsp.
Wydane: (2011)

The complexity of soft constraint satisfaction
od: Cohen, D, i wsp.
Wydane: (2006)

The complexity of soft constraint satisfaction
od: Cohen, D, i wsp.
Wydane: (2006)

Transformations of representation in constraint satisfaction
od: Salamon, A
Wydane: (2013)

The order encoding: from tractable CSP to tractable SAT (extended abstract)
od: Petke, J, i wsp.
Wydane: (2011)

Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms
od: Gottlob, G, i wsp.
Wydane: (2017)