The expressive rate of constraints

Chen, Hubie (2005) The expressive rate of constraints. Annals of Mathematics and Artificial Intelligence 44 (4), pp. 341-352. ISSN 1012-2443.

Full text not available from this repository.

Official URL: https://doi.org/10.1007/s10472-005-7031-4

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.

Metadata

Item Type:	Article
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	09 Mar 2021 14:46
Last Modified:	09 Aug 2023 12:50
URI:	https://eprints.bbk.ac.uk/id/eprint/43339

Statistics

Archive Staff Only (login required)

Edit/View Item