Tractable constraints closed under a binary operation

Tractable constraints closed under a binary operation

Dades bibliogràfiques
Autors principals:	Bulatov, A, Jeavons, P
Format:	Report
Publicat:	Oxford University Computing Laboratory 2000

Ítems similars

Finite semigroups imposing tractable constraints
per: Bulatov, A, et al.
Publicat: (2002)

Perfect Constraints Are Tractable
per: Salamon, A, et al.
Publicat: (2008)

Perfect Constraints Are Tractable
per: Salamon, A, et al.
Publicat: (2008)

Tractable valued constraints
per: Jeavons, P, et al.
Publicat: (2012)

Tractable Valued Constraints
per: Jeavons, P, et al.
Publicat: (2013)

Tractable Disjunctive Constraints
per: D.A.Cohen, et al.
Publicat: (1997)

Tractable Benchmarks For Constraint Programming
per: Petke, J, et al.
Publicat: (2009)

Characterising Tractable Constraints
per: M.C.Cooper, et al.
Publicat: (1994)

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

Tractable Combinations of Global Constraints
per: Cohen, D, et al.
Publicat: (2013)

Tractable combinations of global constraints
per: Cohen, D, et al.
Publicat: (2013)

Building tractable disjunctive constraints
per: Cohen, D, et al.
Publicat: (2000)

Building tractable disjunctive constraints
per: Cohen, D, et al.
Publicat: (2000)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Implementing a test for tractability
per: Gault, R, et al.
Publicat: (2004)

Implementing a test for tractability
per: Gault, R, et al.
Publicat: (2004)

A Test for Tractability
per: P.G.Jeavons, et al.
Publicat: (1996)

On Tractable Queries and Constraints
per: Gottlob, G, et al.
Publicat: (1999)

New tractable classes from old
per: Cohen, D, et al.
Publicat: (2003)

New Tractable Classes From Old
per: Cohen, D, et al.
Publicat: (2003)

Tractable query answering and rewriting under description logic constraints.
per: Pérez-Urbina, H, et al.
Publicat: (2010)

Tractable Query Answering and Rewriting under Description Logic Constraints
per: Pérez−Urbina, H, et al.
Publicat: (2009)

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

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

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

An algebraic approach to multi-sorted constraints
per: Bulatov, A, et al.
Publicat: (2003)

An algebraic approach to multi−sorted constraints
per: Bulatov, A, et al.
Publicat: (2003)