An algebraic approach to multi-sorted constraints

An algebraic approach to multi-sorted constraints

Taispeáin leaganacha eile (1)

Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have the same domain. We show here that this apparently minor simplification can in fact change the complexity of the problem, and hence...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Bulatov, A, Jeavons, P
Formáid:	Journal article
Teanga:	English
Foilsithe / Cruthaithe:	2003

Míreanna comhchosúla

An algebraic approach to multi−sorted constraints
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2003)

The Complexity of Constraint Satisfaction: An Algebraic Approach
de réir: Krokhin, A, et al.
Foilsithe / Cruthaithe: (2004)

Constraint satisfaction problems and finite algebras
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2000)

Constraint satisfaction problems and finite algebras
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2000)

Classifying the complexity of constraints using finite algebras
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2005)

Classifying the complexity of constraints using finite algebras
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2005)

Algebraic structures in combinatorial problems
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2001)

Constraints and Universal Algebra
de réir: P.G.Jeavons, et al.
Foilsithe / Cruthaithe: (1998)

Tractable constraints closed under a binary operation
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2000)

An algebraic characterisation of complexity for valued constraints
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2006)

Structural Theory of Automata‚ Semigroups‚ and Universal Algebra
de réir: Krokhin, A, et al.
Foilsithe / Cruthaithe: (2003)

An algebraic characterisation of complexity for valued constraints
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2006)

The complexity of maximal constraint languages
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2001)

The complexity of maximal constraint languages
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2001)

Finite semigroups imposing tractable constraints
de réir: Bulatov, A, et al.
Foilsithe / Cruthaithe: (2002)

Quantified constraints: Algorithms and complexity
de réir: Borner, F, et al.
Foilsithe / Cruthaithe: (2003)

Quantified constraints: algorithms and complexity
de réir: Börner, F, et al.
Foilsithe / Cruthaithe: (2003)

Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey
de réir: Krokhin, A, et al.
Foilsithe / Cruthaithe: (2003)

Functions of multiple−valued logic and the complexity of constraint satisfaction: A short survey
de réir: Krokhin, A, et al.
Foilsithe / Cruthaithe: (2003)

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection.
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2011)

An algebraic theory of complexity for valued constraints: Establishing a Galois connection
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2010)

An algebraic theory of complexity for valued constraints: Establishing a Galois connection
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2011)

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2010)

An algebraic theory of complexity for valued constraints: Establishing a Galois connection
de réir: Cohen, D, et al.
Foilsithe / Cruthaithe: (2011)

A Method to Translate Order-Sorted Algebras to Many-Sorted Algebras
de réir: Liyi Li, et al.
Foilsithe / Cruthaithe: (2018-02-01)

The complexity of constraint satisfaction games and QCSP
de réir: Boerner, F, et al.
Foilsithe / Cruthaithe: (2009)

The complexity of constraint satisfaction games and QCSP
de réir: Börner, F, et al.
Foilsithe / Cruthaithe: (2009)

Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving
de réir: Salvador Lucas
Foilsithe / Cruthaithe: (2015-12-01)

Presenting Constraints
de réir: Jeavons, P
Foilsithe / Cruthaithe: (2009)

Presenting Constraints
de réir: Jeavons, P
Foilsithe / Cruthaithe: (2009)

On The Algebraic Structure Of Combinatorial Problems
de réir: P.G.Jeavons
Foilsithe / Cruthaithe: (1998)

Constructing constraints
de réir: P.G.Jeavons
Foilsithe / Cruthaithe: (1998)

On the Directly and Subdirectly Irreducible Many-Sorted Algebras
de réir: Climent Vidal J., et al.
Foilsithe / Cruthaithe: (2015-03-01)

Injective hulls of many-sorted ordered algebras
de réir: Zhang Xia, et al.
Foilsithe / Cruthaithe: (2019-12-01)

On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
de réir: Barnaby Martin, et al.
Foilsithe / Cruthaithe: (2012-09-01)

Perfect Constraints Are Tractable
de réir: Salamon, A, et al.
Foilsithe / Cruthaithe: (2008)

Perfect Constraints Are Tractable
de réir: Salamon, A, et al.
Foilsithe / Cruthaithe: (2008)

Tractable valued constraints
de réir: Jeavons, P, et al.
Foilsithe / Cruthaithe: (2012)

Expressibility of valued constraints
de réir: Živný, S, et al.
Foilsithe / Cruthaithe: (2007)

Tractable Valued Constraints
de réir: Jeavons, P, et al.
Foilsithe / Cruthaithe: (2013)