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

Full description

Bibliographic Details

Published in:	Theory and practice of logic programming Vol. 16; no. 5-6; pp. 570 - 586
Main Authors:	BOGAERTS, BART, JANHUNEN, TOMI, TASHARROFI, SHAHAB
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.09.2016
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!