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...

Celý popis

Podrobná bibliografia

Vydané v:	Theory and practice of logic programming Ročník 16; číslo 5-6; s. 570 - 586
Hlavní autori:	BOGAERTS, BART, JANHUNEN, TOMI, TASHARROFI, SHAHAB
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cambridge, UK Cambridge University Press 01.09.2016
Predmet:	Encoding Logic Logic programming Mathematical models Modelling Regular Papers Searching Semantics polynomial hierarchy quantified Boolean formulas disjunctive logic programming
ISSN:	1471-0684, 1475-3081
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!