Tractable Constraints on Ordered Domains

Tractable Constraints on Ordered Domains

Bibliographic Details
Main Authors:	P.G.Jeavons, M.C.Cooper
Format:	Journal article
Published:	1995

Similar Items

Characterising Tractable Constraints
by: M.C.Cooper, et al.
Published: (1994)

Tractable Disjunctive Constraints
by: D.A.Cohen, et al.
Published: (1997)

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

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

A Substitution Operation for Constraints
by: P.G.Jeavons, et al.
Published: (1995)

Tractable Valued Constraints
by: Jeavons, P, et al.
Published: (2013)

Tractable valued constraints
by: Jeavons, P, et al.
Published: (2012)

Perfect Constraints Are Tractable
by: Salamon, A, et al.
Published: (2008)

Perfect Constraints Are Tractable
by: Salamon, A, et al.
Published: (2008)

A Test for Tractability
by: P.G.Jeavons, et al.
Published: (1996)

Tractable Benchmarks For Constraint Programming
by: Petke, J, et al.
Published: (2009)

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

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

Building tractable disjunctive constraints
by: Cohen, D, et al.
Published: (2000)

Building tractable disjunctive constraints
by: Cohen, D, et al.
Published: (2000)

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

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

Tractable Combinations of Global Constraints
by: Cohen, D, et al.
Published: (2013)

Tractable combinations of global constraints
by: Cohen, D, et al.
Published: (2013)

Finite semigroups imposing tractable constraints
by: Bulatov, A, et al.
Published: (2002)

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

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

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

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

Constructing constraints
by: P.G.Jeavons
Published: (1998)

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

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

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

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

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

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

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

On Tractable Queries and Constraints
by: Gottlob, G, et al.
Published: (1999)

Constraints‚ Consistency and Closure
by: P.G.Jeavons, et al.
Published: (1998)

Why higher order constraints are necessary to model frequency assignment problems
by: P.G.Jeavons, et al.
Published: (1998)

Recovering a Relation from a Decomposition using Constraint Satisfaction Techniques
by: P.G.Jeavons
Published: (1994)

Towards High Order Constraint Representations for the Frequency Assignment Problem
by: N.W.Dunkin, et al.
Published: (1998)

Closure Properties of Constraints
by: P.G.Jeavons, et al.
Published: (1997)

Expressiveness of Binary Constraints for the Frequency Assignment Problem
by: N.W.Dunkin, et al.
Published: (1997)

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