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.

• Type: Conference
• Year: 2004
• Where: AMAI
• Authors: Hubie Chen
• Keywords: AMAI 2004, Artificial Intelligence, Logical Formulas, Semantic Equivalence, Simple Measure