Closure properties of constraints
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Constraints, consistency and closure
Artificial Intelligence
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Constraints and universal algebra
Annals of Mathematics and Artificial Intelligence
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Learnability of quantified formulas
Theoretical Computer Science
An Algebraic Approach to the Complexity of Propositional Circumscription
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
A survey on knowledge compilation
AI Communications
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
Tractability and Learnability Arising from Algebras with Few Subpowers
SIAM Journal on Computing
| Hi-index | 0.00 |
In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiveness: the number of formulas expressible by a language, up to semantic equivalence. In the context of constraints, we prove a dichotomy theorem on constraint languages regarding this measure.