You Can't Always Forget What You Want: On the Limits of Forgetting in Answer Set Programming
From MaRDI portal
Publication:4576228
DOI10.3233/978-1-61499-672-9-957zbMath1403.68030OpenAlexW2577509016MaRDI QIDQ4576228
João Leite, Matthias Knorr, Ricardo Gonçalves
Publication date: 12 July 2018
Full work available at URL: https://doi.org/10.3233/978-1-61499-672-9-957
Related Items
A polynomial reduction of forks into logic programs ⋮ When you must forget: Beyond strong persistence when forgetting in answer set programming ⋮ Knowledge forgetting in propositional \(\mu\)-calculus ⋮ A Syntactic Operator for Forgetting that Satisfies Strong Persistence ⋮ Syntactic ASP forgetting with forks ⋮ On the limits of forgetting in answer set programming ⋮ Modular Answer Set Programming as a Formal Specification Language ⋮ Syntactic ASP forgetting with forks ⋮ On syntactic forgetting under uniform equivalence ⋮ Forgetting in ASP: The Forgotten Properties ⋮ Forgetting auxiliary atoms in forks