A Rewriting Logic Framework for Soft Constraints

Soft constraints extend classical constraints to deal with non-functional requirements, over-constrained problems and preferences. Bistarelli, Montanari and Rossi have developed a very elegant and abstract semiring based theory of soft constraints where many different kinds of soft constraints can b...

Full description

Saved in:
Bibliographic Details
Published in:Electronic notes in theoretical computer science 2007-07, Vol.176 (4), p.181-197
Main Authors: Wirsing, Martin, Denker, Grit, Talcott, Carolyn, Poggio, Andy, Briesemeister, Linda
Format: Article
Language:English
Subjects:
Rewriting logic
soft constraint
software-defined radio
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Soft constraints extend classical constraints to deal with non-functional requirements, over-constrained problems and preferences. Bistarelli, Montanari and Rossi have developed a very elegant and abstract semiring based theory of soft constraints where many different kinds of soft constraints can be represented and combined in a uniform way over so-called constraint semirings. In this paper we present a framework for prototyping of soft constraints à la Bistarelli, Montanari and Rossi in Rewriting Logic. As a case study we present an application of soft constraints to the new area of software-defined radio networks. We model the problem of “optimal” parameter assignments for software-defined radios as a soft constraint solving problem, prove the correctness of the constraint solving algorithm, implement the solution in our prototypical Rewriting Logic framework for soft constraints, and embed our soft constraint solver in SRI's Policy-Aware, Goal-Oriented Distributed Architecture (PAGODA) for modelling radio networks.
ISSN:1571-0661
1571-0661
DOI:10.1016/j.entcs.2007.06.015