Solving problems in the polynomial hierarchy with ASP(Q)

DOI10.1007/978-3-031-15707-3_29MaRDI QIDQ2694590zbMATH OpenOpenAlexFDO

Authors Giovanni Amendola, Bernardo Cuteri, F. Ricca, Mirek Truszczynski

Publication date 4 April 2023

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

zbMATH Keywords

answer set programmingQBFquantifiers

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites work

• Advances in WASP
• Answer set programming and plan generation
• ASP-Core-2 input language format
• Beyond NP: quantifying over answer sets
• Coherence in finite argument systems.
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 895371 (Why is no real title available?)
• New models for generating hard random Boolean formulas and disjunctive logic programs
• 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
• Paraconsistent Stable Semantics for Extended Disjunctive Programs
• Planning with Incomplete Information in Quantified Answer Set Programming
• Progress in clasp series 3
• Semi-equilibrium models for paracoherent answer set programs
• Stable-unstable semantics: Beyond NP with normal logic programs
• The Sixth Answer Set Programming Competition

Cited in

(2)

• Quantified constraint handling rules
• An efficient solver for ASP(Q)

Describes a project that uses

Uses Software

• clasp
• WASP
• ASPTools

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2694590)