Beyond NP: Quantifying over Answer Sets

Answer Set Programming (ASP) is a logic programming paradigm featuring a purely declarative language with comparatively high modeling capabilities. Indeed, ASP can model problems in NP in a compact and elegant way. However, modeling problems beyond NP with ASP is known to be complicated, on the one...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory and practice of logic programming Jg. 19; H. 5-6; S. 705 - 721
Hauptverfasser:	AMENDOLA, GIOVANNI, RICCA, FRANCESCO, TRUSZCZYNSKI, MIROSLAW
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cambridge, UK Cambridge University Press 01.09.2019
Schlagworte:	35th International Conference on Logic Programming Artificial intelligence Boolean algebra Declarative programming Logic programming Mathematical programming Number theory Original Article Polynomials Quantified Logics Polynomial Hierarchy ASP
ISSN:	1471-0684, 1475-3081
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!