Computational Complexity of Disjunctive Answer Set Programming with Quantifiers
- 11 October 2026
- book chapter
- Published by Springer Nature
- p. 298-314
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Solving Problems in the Polynomial Hierarchy with ASP(Q)2022
- Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers2022
- Modelling the Outlier Detection Problem in ASP(Q)2022
- Beyond NP: Quantifying over Answer SetsTheory and Practice of Logic Programming, 2019
- Industrial Applications of Answer Set ProgrammingKI - Künstliche Intelligenz, 2018
- Stable-unstable semantics: Beyond NP with normal logic programsTheory and Practice of Logic Programming, 2016
- Allotment Problem in Travel Industry: A Solution Based on ASP2015
- On the computational cost of disjunctive logic programming: Propositional caseAnnals of Mathematics and Artificial Intelligence, 1995
- Classical negation in logic programs and disjunctive databasesNew Generation Computing, 1991
- The polynomial-time hierarchyTheoretical Computer Science, 1976