A Rewriting Logic Framework for Soft Constraints

  • Authors:

  • Martin Wirsing;Grit Denker;Carolyn Talcott;Andy Poggio;Linda Briesemeister

  • Affiliations:

  • Ludwig-Maximilians-Universität München, Institut für Informatik, 80538 München;SRI International, 333 Ravenswood Ave, Menlo Park, California 94025;SRI International, 333 Ravenswood Ave, Menlo Park, California 94025;SRI International, 333 Ravenswood Ave, Menlo Park, California 94025;SRI International, 333 Ravenswood Ave, Menlo Park, California 94025

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 a 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.