Tractable constraints closed under a binary operation

Tractable constraints closed under a binary operation

Bibliografski detalji
Glavni autori:	Bulatov, A, Jeavons, P
Format:	Report
Izdano:	Oxford University Computing Laboratory 2000

Slični predmeti

Finite semigroups imposing tractable constraints
od: Bulatov, A, i dr.
Izdano: (2002)

Perfect Constraints Are Tractable
od: Salamon, A, i dr.
Izdano: (2008)

Perfect Constraints Are Tractable
od: Salamon, A, i dr.
Izdano: (2008)

Tractable valued constraints
od: Jeavons, P, i dr.
Izdano: (2012)

Tractable Valued Constraints
od: Jeavons, P, i dr.
Izdano: (2013)

Tractable Disjunctive Constraints
od: D.A.Cohen, i dr.
Izdano: (1997)

Tractable Benchmarks For Constraint Programming
od: Petke, J, i dr.
Izdano: (2009)

Characterising Tractable Constraints
od: M.C.Cooper, i dr.
Izdano: (1994)

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

Tractable Combinations of Global Constraints
od: Cohen, D, i dr.
Izdano: (2013)

Tractable combinations of global constraints
od: Cohen, D, i dr.
Izdano: (2013)

Building tractable disjunctive constraints
od: Cohen, D, i dr.
Izdano: (2000)

Building tractable disjunctive constraints
od: Cohen, D, i dr.
Izdano: (2000)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Implementing a test for tractability
od: Gault, R, i dr.
Izdano: (2004)

Implementing a test for tractability
od: Gault, R, i dr.
Izdano: (2004)

A Test for Tractability
od: P.G.Jeavons, i dr.
Izdano: (1996)

On Tractable Queries and Constraints
od: Gottlob, G, i dr.
Izdano: (1999)

New tractable classes from old
od: Cohen, D, i dr.
Izdano: (2003)

New Tractable Classes From Old
od: Cohen, D, i dr.
Izdano: (2003)

Tractable query answering and rewriting under description logic constraints.
od: Pérez-Urbina, H, i dr.
Izdano: (2010)

Tractable Query Answering and Rewriting under Description Logic Constraints
od: Pérez−Urbina, H, i dr.
Izdano: (2009)

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

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

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

An algebraic approach to multi-sorted constraints
od: Bulatov, A, i dr.
Izdano: (2003)

An algebraic approach to multi−sorted constraints
od: Bulatov, A, i dr.
Izdano: (2003)