Evaluation-based semiring meta-constraints

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be restrictive in situations where uncertainty, fuzziness, probability or optimisation are intrinsic. Soft constraints alleviate many of the restrictions which classical constraint satisfaction impose; in particular, soft constraints provide a basis for capturing notions such as vagueness, uncertainty and cost into the CSP model. We focus on the semiring-based approach to soft constraints. In this paper we present a new evaluation-based scheme for implementing meta-constraints, which can be applied to any existing implementation to improve its run-time performance.

Cite

CITATION STYLE

APA

Kelleher, J., & O’Sullivan, B. (2004). Evaluation-based semiring meta-constraints. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2972, pp. 179–189). Springer Verlag. https://doi.org/10.1007/978-3-540-24694-7_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free