Modern constraint answer set solving
Dissertation, Universität Potsdam, 2017
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Körperschaft: | |
| Weitere Verfasser: | |
| Format: | UnknownFormat |
| Sprache: | eng |
| Veröffentlicht: |
Potsdam
2018
|
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Tag hinzufügen | Zusammenfassung: | Dissertation, Universität Potsdam, 2017 Answer Set Programming (ASP) is a declarative problem solving approach, combining a rich yet simple modeling language with high-performance solving capabilities. Although this has already resulted in various applications, certain aspects of such applications are more naturally modeled using variables over finite domains, for accounting for resources, fine timings, coordinates, or functions. Our goal is thus to extend ASP with constraints over integers while preserving its declarative nature. This allows for fast prototyping and elaboration tolerant problem descriptions of resource related applications. The resulting paradigm is called Constraint Answer Set Programming (CASP). We present three different approaches for solving CASP problems. The first one, a lazy, modular approach combines an ASP solver with an external system for handling constraints. This approach has the advantage that two state of the art technologies work hand in hand to solve the problem, each concentrating on its part of the problem. The drawback is that ... |
|---|---|
| Beschreibung: | 135 Seiten |