An algebraic approach to multi-sorted constraints
From MaRDI portal
Publication:5897196
DOI10.1007/B13743zbMATH Open1273.68337OpenAlexW2497660909MaRDI QIDQ5897196FDOQ5897196
Authors: Andrei A. Bulatov, P. Jeavons 
Publication date: 2 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13743
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Database theory (68P15)
Cited In (19)
- Soft constraints: complexity and multimorphisms
- Properties of tree convex constraints
- An interactive algorithm for multiple criteria constrained sorting problem
- Towards a dichotomy theorem for the counting constraint satisfaction problem
- Constraint satisfaction problems over semilattice block Mal'tsev algebras
- The power of propagation: when GAC is enough
- Algebraic properties of multilinear constraints
- Nonnegative weighted \#CSP: an effective complexity dichotomy
- A dichotomy for first-order reducts of unary structures
- Aggregation of votes with multiple positions on each issue
- Algebraic geometry in first-order logic
- The complexity of constraint satisfaction games and QCSP
- A combinatorial constraint satisfaction problem dichotomy classification conjecture
- A strong Mal'cev condition for locally finite varieties omitting the unary type
- Smooth approximations and CSPs over finitely bounded homogeneous structures
- Combinatorial problems raised from 2-semilattices
- On tree-preserving constraints
- The language of stratified sets is confluent and strongly normalising
- A Further Generalized Kettele Algorithm with Multiple Constraints
This page was built for publication: An algebraic approach to multi-sorted constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897196)
