The expressive rate of constraints
From MaRDI portal
Publication:812391
DOI10.1007/s10472-005-7031-4zbMath1086.68127OpenAlexW2041890562MaRDI QIDQ812391
Publication date: 23 January 2006
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-005-7031-4
Related Items (4)
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property ⋮ Varieties with few subalgebras of powers ⋮ Quantified constraint satisfaction and the polynomially generated powers property ⋮ Recent Results on the Algebraic Approach to the CSP
Cites Work
- Constraints, consistency and closure
- On the algebraic structure of combinatorial problems
- Constraints and universal algebra
- Learnability of quantified formulas.
- Complexity Classifications of Boolean Constraint Satisfaction Problems
- Closure properties of constraints
- The complexity of satisfiability problems
- Algorithmic Learning Theory
This page was built for publication: The expressive rate of constraints
