Embedding constraint relationships into C-semirings

  • These notes provide technical details that are required to embed constraint relationships into the c-semiring framework presented in terms of category theory. It contains all steps required to map a dag to a partial order (Section 1), construct the free meet monoid from this partial order (Section 3) as well as the free c-semiring (Section 4). A constraint solving algorithm based on branch-and-bound search is presented in §34 for c-semirings and in §36 for meet monoids. A concrete instantiation for constraint relationships along with an example soft constraint problem concludes the report in Section 7.

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Alexander KnappORCiDGND, Alexander SchiendorferORCiDGND
URN:urn:nbn:de:bvb:384-opus4-26849
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/2684
Series (Serial Number):Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2014-03)
Publisher:Fakultät für Angewandte Informatik, Universität Augsburg
Place of publication:Augsburg
Type:Report
Language:English
Publishing Institution:Universität Augsburg
Release Date:2014/04/14
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Software & Systems Engineering
Fakultät für Angewandte Informatik / Institut für Informatik / Lehrstuhl für Softwaretechnik
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):Deutsches Urheberrecht mit Print on Demand