2-ASP(Q) programs with weak constraints: complexity and efficient implementation

DOI10.1017/S1471068426100477MaRDI QIDQ7406151zbMATH OpenFDO

Authors Andrea Cuteri, Giuseppe Mazzotta, F. Ricca

Publication date 2026

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/S1471068426100477

zbMATH Keywords

ASPcombinatorial optimization problemsquantified ASP

Mathematics Subject Classification ID

Logic programming (68N17)

Cites work

• A general framework for preferences in answer set programming
• Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
• An efficient solver for ASP(Q)
• Answer set planning: a survey
• Beyond NP: quantifying over answer sets
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 895371 (Why is no real title available?)
• Optimum stable model search: algorithms and implementation
• Planning with Incomplete Information in Quantified Answer Set Programming
• Solving problems in the polynomial hierarchy with ASP(Q)
• Solving QBF with counterexample guided refinement
• Stable-unstable semantics: Beyond NP with normal logic programs
• The complexity of logic-based abduction

This page was built for publication: 2-ASP(Q) programs with weak constraints: complexity and efficient implementation

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