Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination

Show other versions (2)

Bibliografske podrobnosti
Main Authors:	Cooper, M, Jeavons, P, Salamon, A
Format:	Journal article
Izdano:	2010

Podobne knjige/članki

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
od: Cooper, M, et al.
Izdano: (2010)

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
od: Cooper, M, et al.
Izdano: (2010)

Hybrid tractable CSPs which generalize tree structure
od: Cooper, M, et al.
Izdano: (2008)

Perfect Constraints Are Tractable
od: Salamon, A, et al.
Izdano: (2008)

Perfect Constraints Are Tractable
od: Salamon, A, et al.
Izdano: (2008)

Characterising Tractable Constraints
od: M.C.Cooper, et al.
Izdano: (1994)

A Survey of Tractable Constraint Satisfaction Problems
od: J.K.Pearson, et al.
Izdano: (1997)

Tractable Constraints on Ordered Domains
od: P.G.Jeavons, et al.
Izdano: (1995)

Tractable valued constraints
od: Jeavons, P, et al.
Izdano: (2012)

Tractable Valued Constraints
od: Jeavons, P, et al.
Izdano: (2013)

A unified theory of structural tractability for constraint satisfaction problems
od: Cohen, D, et al.
Izdano: (2008)

A unified theory of structural tractability for constraint satisfaction problems
od: Cohen, D, et al.
Izdano: (2008)

Tractable Disjunctive Constraints
od: D.A.Cohen, et al.
Izdano: (1997)

Tractable Benchmarks For Constraint Programming
od: Petke, J, et al.
Izdano: (2009)

A maximal tractable class of soft constraints
od: Cohen, D, et al.
Izdano: (2004)

A maximal tractable class of soft constraints
od: Cohen, D, et al.
Izdano: (2004)

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

Building tractable disjunctive constraints
od: Cohen, D, et al.
Izdano: (2000)

Building tractable disjunctive constraints
od: Cohen, D, et al.
Izdano: (2000)

Finite semigroups imposing tractable constraints
od: Bulatov, A, et al.
Izdano: (2002)

Tractable Combinations of Global Constraints
od: Cohen, D, et al.
Izdano: (2013)

Tractable combinations of global constraints
od: Cohen, D, et al.
Izdano: (2013)

Hybrid tractability of soft constraint problems
od: Cooper, M, et al.
Izdano: (2010)

Hybrid tractability of soft constraint problems
od: Cooper, M, et al.
Izdano: (2010)

Hybrid tractability of valued constraint problems
od: Cooper, M, et al.
Izdano: (2011)

A Unifying Framework for Tractable Constraints
od: P.G.Jeavons, et al.
Izdano: (1995)

Tractable constraints closed under a binary operation
od: Bulatov, A, et al.
Izdano: (2000)

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

A new hybrid tractable class of soft constraint problems
od: Cooper, M, et al.
Izdano: (2010)

The order encoding: from tractable CSP to tractable SAT
od: Petke, J, et al.
Izdano: (2011)

The order encoding: From tractable CSP to tractable SAT
od: Petke, J, et al.
Izdano: (2011)

The order encoding: from tractable CSP to tractable SAT (extended abstract)
od: Petke, J, et al.
Izdano: (2011)

Semantic width and the fixed-parameter tractability of constraint satisfaction problems
od: Chen, H, et al.
Izdano: (2020)

A Test for Tractability
od: P.G.Jeavons, et al.
Izdano: (1996)

On Tractable Queries and Constraints
od: Gottlob, G, et al.
Izdano: (1999)

Implementing a test for tractability
od: Gault, R, et al.
Izdano: (2004)

Implementing a test for tractability
od: Gault, R, et al.
Izdano: (2004)

Tractable classes of binary CSPs defined by excluded topological minors
od: Cohen, D, et al.
Izdano: (2015)

Variable and value elimination in binary constraint satisfaction via forbidden patterns
od: Cohen, DA, et al.
Izdano: (2015)

New tractable classes from old
od: Cohen, D, et al.
Izdano: (2003)