Sciweavers

Share
AMAI
2004
Springer

The Expressive Rate of Constraints

10 years 1 months ago
The Expressive Rate of Constraints
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. We prove a dichotomy theorem on constraint languages regarding this measure.
Hubie Chen
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where AMAI
Authors Hubie Chen
Comments (0)
books