Grounding and Solving in Answer Set Programming

Grounding and Solving in Answer Set Programming

Answer set programming is a declarative problem‐solving paradigm that rests upon a work flow involving modeling, grounding, and solving. While the former is described by Gebser and Schaub (2016), we focus here on key issues in grounding, or how to systematically replace object variables by ground te...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The AI magazine 2016-09, Vol.37 (3), p.25-32
Hauptverfasser: Kaufmann, Benjamin, Leone, Nicola, Perri, Simona, Schaub, Torsten
Format: Artikel
Sprache:eng
Schlagworte:
Artificial intelligence
Computer programming
Language
Logic programming
Logic programs
Mathematical programming
Methods
Problem solving
Propagation
Variables
Workflow
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Answer set programming is a declarative problem‐solving paradigm that rests upon a work flow involving modeling, grounding, and solving. While the former is described by Gebser and Schaub (2016), we focus here on key issues in grounding, or how to systematically replace object variables by ground terms in an effective way, and solving, or how to compute the answer sets, of a propositional logic program obtained by grounding.
ISSN:0738-4602
2371-9621
DOI:10.1609/aimag.v37i3.2672