Beyond NP: Quantifying over Answer Sets
From MaRDI portal
Publication:5108497
DOI10.1017/S1471068419000140zbMath1434.68068arXiv1907.09559OpenAlexW3098293022WikidataQ127174382 ScholiaQ127174382MaRDI QIDQ5108497
Miroslaw Truszczynski, Francesco Ricca, Giovanni Amendola
Publication date: 4 May 2020
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.09559
Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (2)
Solving problems in the polynomial hierarchy with ASP(Q) ⋮ Planning with Incomplete Information in Quantified Answer Set Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The polynomial-time hierarchy
- Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete
- On computing minimal models
- Answer set programming and plan generation
- On the computational cost of disjunctive logic programming: Propositional case
- Semantics and expressiveness of disjunctive ordered logic
- Evaluation of disjunctive programs in WASP
- Combining answer set programming with description logics for the semantic web
- Explaining inconsistency in answer set programs and extensions
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Manifold Answer-Set Programs and Their Applications
- Complex optimization in answer set programming
- Pebbling in Hypercubes
- Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications
- Advances in WASP
- Progress in clasp Series 3
- Learnability and the Vapnik-Chervonenkis dimension
- Stable-unstable semantics: Beyond NP with normal logic programs
- Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
- The DLV system for knowledge representation and reasoning
- The Sixth Answer Set Programming Competition
- A Tarskian Informal Semantics for Answer Set Programming
- Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
- The Complexity of Graph Pebbling
This page was built for publication: Beyond NP: Quantifying over Answer Sets
