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

Full description

Bibliographic Details

Published in:	Theory and practice of logic programming Vol. 19; no. 5-6; pp. 705 - 721
Main Authors:	AMENDOLA, GIOVANNI, RICCA, FRANCESCO, TRUSZCZYNSKI, MIROSLAW
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.09.2019
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!