Modular Answer Set Programming as a Formal Specification Language

In this paper, we study the problem of formal verification for Answer Set Programming (ASP), namely, obtaining a formal proof showing that the answer sets of a given (non-ground) logic program P correctly correspond to the solutions to the problem encoded by P, regardless of the problem instance. To...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory and practice of logic programming 2020-09, Vol.20 (5), p.767-782
Hauptverfasser:	CABALAR, PEDRO, FANDINNO, JORGE, LIERLER, YULIYA
Format:	Artikel
Sprache:	eng
Schlagworte:	Atomic properties Declarative programming Formal specifications Logic programming Logic programs Mathematical programming Modules Original Article Specification and description languages
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!