Forgetting under the well-founded semantics
From MaRDI portal
Publication:2851229
Recommendations
Cited in
(17)- When you must forget: Beyond strong persistence when forgetting in answer set programming
- A polynomial reduction of forks into logic programs
- Forgetting in multi-agent modal logics
- Variable Forgetting in Reasoning about Knowledge
- Naturalizing logic
- scientific article; zbMATH DE number 1302067 (Why is no real title available?)
- Forgetting in ASP: the forgotten properties
- On a general concept of forgetting
- Semantic forgetting in expressive description logics
- Preserving strong equivalence while forgetting
- A syntactic operator for forgetting that satisfies strong persistence
- From forgetting signature elements to forgetting formulas in epistemic states
- Solving logic program conflict through strong and weak forgettings
- On the limits of forgetting in answer set programming
- Forgetting Literals with Varying Propositional Symbols
- Forgetting for defeasible logic
- Semantic forgetting in answer set programming
This page was built for publication: Forgetting under the well-founded semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851229)