Tractable constraints closed under a binary operation

Tractable constraints closed under a binary operation

Bibliografiska uppgifter
Huvudupphovsmän:	Bulatov, A, Jeavons, P
Materialtyp:	Report
Publicerad:	Oxford University Computing Laboratory 2000

Liknande verk

Finite semigroups imposing tractable constraints
av: Bulatov, A, et al.
Publicerad: (2002)

Perfect Constraints Are Tractable
av: Salamon, A, et al.
Publicerad: (2008)

Perfect Constraints Are Tractable
av: Salamon, A, et al.
Publicerad: (2008)

Tractable valued constraints
av: Jeavons, P, et al.
Publicerad: (2012)

Tractable Valued Constraints
av: Jeavons, P, et al.
Publicerad: (2013)

Tractable Disjunctive Constraints
av: D.A.Cohen, et al.
Publicerad: (1997)

Tractable Benchmarks For Constraint Programming
av: Petke, J, et al.
Publicerad: (2009)

Characterising Tractable Constraints
av: M.C.Cooper, et al.
Publicerad: (1994)

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

Tractable Combinations of Global Constraints
av: Cohen, D, et al.
Publicerad: (2013)

Tractable combinations of global constraints
av: Cohen, D, et al.
Publicerad: (2013)

Building tractable disjunctive constraints
av: Cohen, D, et al.
Publicerad: (2000)

Building tractable disjunctive constraints
av: Cohen, D, et al.
Publicerad: (2000)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Implementing a test for tractability
av: Gault, R, et al.
Publicerad: (2004)

Implementing a test for tractability
av: Gault, R, et al.
Publicerad: (2004)

A Test for Tractability
av: P.G.Jeavons, et al.
Publicerad: (1996)

On Tractable Queries and Constraints
av: Gottlob, G, et al.
Publicerad: (1999)

New tractable classes from old
av: Cohen, D, et al.
Publicerad: (2003)

New Tractable Classes From Old
av: Cohen, D, et al.
Publicerad: (2003)

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

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

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

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

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

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

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