Solving problems in the polynomial hierarchy with ASP(Q)

DOI10.1007/978-3-031-15707-3_29OpenAlexW4293180210MaRDI QIDQ2694590

Bernardo Cuteri, Mirek Truszczynski, Giovanni Amendola, Francesco Ricca

Publication date: 4 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-15707-3_29

zbMATH Keywords

quantifiersQBFanswer set programming

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Uses Software

• clasp
• WASP
• ASPTools

Cites Work

• Unnamed Item
• Unnamed Item
• Semi-equilibrium models for paracoherent answer set programs
• Answer set programming and plan generation
• Coherence in finite argument systems.
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• On the computational cost of disjunctive logic programming: Propositional case
• Paracoherent answer set computation
• New models for generating hard random Boolean formulas and disjunctive logic programs
• Advances in WASP
• Progress in clasp Series 3
• Stable-unstable semantics: Beyond NP with normal logic programs
• Paraconsistent Stable Semantics for Extended Disjunctive Programs
• ASP-Core-2 Input Language Format
• Planning with Incomplete Information in Quantified Answer Set Programming
• Beyond NP: Quantifying over Answer Sets
• The Sixth Answer Set Programming Competition

This page was built for publication: Solving problems in the polynomial hierarchy with ASP(Q)