Advertisement

6. Soft CLP

  • Stefano Bistarelli
Chapter
  • 282 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2962)

Abstract

The framework presented in the previous chapters shows how the soft constraint idea can give us an easy way to model non-crisp problems. To program applications we need, nevertheless, a language where we can use soft constraints. This is why we extend the Constraint Logic Programming (CLP) formalism in order to handle semiring-based constraints.

This allows us to perform in the same language both constraint solving and optimization. In fact, constraints based on semirings are able to model both classical constraint solving and more sophisticated features like uncertainty, probability, fuzziness, and optimization. We then provide this class of languages with three equivalent semantics: model-theoretic, fix-point, and proof-theoretic, in the style of classical CLP programs.

Keywords

Logic Programming Operational Semantic Transition Rule Soft Constraint Classical Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Stefano Bistarelli

    There are no affiliations available

    Personalised recommendations