Tractable constraints closed under a binary operation

Tractable constraints closed under a binary operation

Détails bibliographiques
Auteurs principaux:	Bulatov, A, Jeavons, P
Format:	Report
Publié:	Oxford University Computing Laboratory 2000

Documents similaires

Finite semigroups imposing tractable constraints
par: Bulatov, A, et autres
Publié: (2002)

Perfect Constraints Are Tractable
par: Salamon, A, et autres
Publié: (2008)

Perfect Constraints Are Tractable
par: Salamon, A, et autres
Publié: (2008)

Tractable valued constraints
par: Jeavons, P, et autres
Publié: (2012)

Tractable Valued Constraints
par: Jeavons, P, et autres
Publié: (2013)

Tractable Disjunctive Constraints
par: D.A.Cohen, et autres
Publié: (1997)

Tractable Benchmarks For Constraint Programming
par: Petke, J, et autres
Publié: (2009)

Characterising Tractable Constraints
par: M.C.Cooper, et autres
Publié: (1994)

Tractable Constraints on Ordered Domains
par: P.G.Jeavons, et autres
Publié: (1995)

Tractable Combinations of Global Constraints
par: Cohen, D, et autres
Publié: (2013)

Tractable combinations of global constraints
par: Cohen, D, et autres
Publié: (2013)

Building tractable disjunctive constraints
par: Cohen, D, et autres
Publié: (2000)

Building tractable disjunctive constraints
par: Cohen, D, et autres
Publié: (2000)

A Unifying Framework for Tractable Constraints
par: P.G.Jeavons, et autres
Publié: (1995)

A Survey of Tractable Constraint Satisfaction Problems
par: J.K.Pearson, et autres
Publié: (1997)

A maximal tractable class of soft constraints
par: Cohen, D, et autres
Publié: (2004)

A maximal tractable class of soft constraints
par: Cohen, D, et autres
Publié: (2004)

A unified theory of structural tractability for constraint satisfaction problems
par: Cohen, D, et autres
Publié: (2008)

A unified theory of structural tractability for constraint satisfaction problems
par: Cohen, D, et autres
Publié: (2008)

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
par: Cooper, M, et autres
Publié: (2010)

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
par: Cooper, M, et autres
Publié: (2010)

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
par: Cooper, M, et autres
Publié: (2010)

Tractable classes of binary CSPs defined by excluded topological minors
par: Cohen, D, et autres
Publié: (2015)

Constraint Tractability Theory And Its Application to the Product Development Process for a Constraint−Based Scheduler
par: Purvis, L, et autres
Publié: (1999)

The order encoding: from tractable CSP to tractable SAT
par: Petke, J, et autres
Publié: (2011)

The order encoding: From tractable CSP to tractable SAT
par: Petke, J, et autres
Publié: (2011)

The order encoding: from tractable CSP to tractable SAT (extended abstract)
par: Petke, J, et autres
Publié: (2011)

Implementing a test for tractability
par: Gault, R, et autres
Publié: (2004)

Implementing a test for tractability
par: Gault, R, et autres
Publié: (2004)

A Test for Tractability
par: P.G.Jeavons, et autres
Publié: (1996)

On Tractable Queries and Constraints
par: Gottlob, G, et autres
Publié: (1999)

New tractable classes from old
par: Cohen, D, et autres
Publié: (2003)

New Tractable Classes From Old
par: Cohen, D, et autres
Publié: (2003)

Tractable query answering and rewriting under description logic constraints.
par: Pérez-Urbina, H, et autres
Publié: (2010)

Tractable Query Answering and Rewriting under Description Logic Constraints
par: Pérez−Urbina, H, et autres
Publié: (2009)

Hybrid tractability of soft constraint problems
par: Cooper, M, et autres
Publié: (2010)

Hybrid tractability of valued constraint problems
par: Cooper, M, et autres
Publié: (2011)

Hybrid tractability of soft constraint problems
par: Cooper, M, et autres
Publié: (2010)

An algebraic approach to multi-sorted constraints
par: Bulatov, A, et autres
Publié: (2003)

An algebraic approach to multi−sorted constraints
par: Bulatov, A, et autres
Publié: (2003)