An efficient solver for ASP(Q)

DOI10.1017/S1471068423000121MaRDI QIDQ7027185zbMATH OpenFDO

Authors Wolfgang Faber, Giuseppe Mazzotta, F. Ricca

Publication date 14 February 2025

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S1471068423000121

zbMATH Keywords

ASP with quantifiersquantified Boolean formulaswell-founded semantics

Mathematics Subject Classification ID

Logic programming (68N17)

Cites work

• Answer set programming and plan generation
• Beyond NP: quantifying over answer sets
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• New models for generating hard random Boolean formulas and disjunctive logic programs
• On the computational cost of disjunctive logic programming: Propositional case
• Paracoherent answer set computation
• Planning with Incomplete Information in Quantified Answer Set Programming
• Solving problems in the polynomial hierarchy with ASP(Q)
• Stable-unstable semantics: Beyond NP with normal logic programs
• Technical note. Efficiently coupling the \(\mathscr{I}\)-DLV grounder with ASP solvers
• The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
• The Sixth Answer Set Programming Competition
• The well-founded semantics for general logic programs

Cited in

(1)

• Quantified constraint handling rules

This page was built for publication: An efficient solver for ASP(Q)

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