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

Celý popis

Podrobná bibliografie

Vydáno v:	Theory and practice of logic programming Ročník 19; číslo 5-6; s. 705 - 721
Hlavní autoři:	AMENDOLA, GIOVANNI, RICCA, FRANCESCO, TRUSZCZYNSKI, MIROSLAW
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cambridge, UK Cambridge University Press 01.09.2019
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!