Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The expressive rate of constraints

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. In the context of constraints, we prove a dichotomy theorem on constraint languages regarding this measure. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

The expressive rate of constraints

Download PDF
12 pages

Loading next page...
 
/lp/springer-journals/the-expressive-rate-of-constraints-ehVxAW0WVm

References (15)

Publisher
Springer Journals
Copyright
Copyright © 2005 by Springer
Subject
Computer Science; Artificial Intelligence (incl. Robotics); Mathematics, general; Computer Science, general; Complex Systems
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1007/s10472-005-7031-4
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Annals of Mathematics and Artificial Intelligence – Springer Journals

Published: May 10, 2005

There are no references for this article.