Stable-unstable semantics: Beyond NP with normal logic programs

Standard answer set programming (ASP) targets at solving search problems from the first level of the polynomial time hierarchy (PH). Tackling search problems beyond NP using ASP is less straightforward. The class of disjunctive logic programs offers the most prominent way of reaching the second leve...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory and practice of logic programming Jg. 16; H. 5-6; S. 570 - 586
Hauptverfasser:	BOGAERTS, BART, JANHUNEN, TOMI, TASHARROFI, SHAHAB
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cambridge, UK Cambridge University Press 01.09.2016
Schlagworte:	Encoding Logic Logic programming Mathematical models Modelling Regular Papers Searching Semantics polynomial hierarchy quantified Boolean formulas disjunctive logic programming
ISSN:	1471-0684, 1475-3081
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!