Encoding action reversibility in planning using quantified ASP and Bule

DOI10.1007/978-3-032-04587-4_20MaRDI QIDQ6884737zbMATH OpenFDO

Authors Wolfgang Faber, Michael Morak

Publication date 15 December 2025

Full work available at URL https://doi.org/10.1007/978-3-032-04587-4_20

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites work

• \texttt{eclingo}: a solver for epistemic logic programs
• Agent planning programs
• Answer set programming
• ASP-Core-2 input language format
• Beyond NP: quantifying over answer sets
• DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
• Determining action reversibility in STRIPS using answer set and epistemic logic programming
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 2201583 (Why is no real title available?)
• Multi-shot ASP solving with clingo
• On the computational cost of disjunctive logic programming: Propositional case
• Planning with Incomplete Information in Quantified Answer Set Programming
• plasp 3: towards effective ASP planning
• QBF programming with the modeling language bule
• The computational complexity of propositional STRIPS planning
• Towards the evaluation of action reversibility in STRIPS using domain generators
• Undoing the effects of action sequences

This page was built for publication: Encoding action reversibility in planning using quantified ASP and Bule

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