Knowledge forgetting in propositional \(\mu\)-calculus
From MaRDI portal
Publication:2679422
DOI10.1007/s10472-022-09803-4OpenAlexW4297360109MaRDI QIDQ2679422
Publication date: 20 January 2023
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-022-09803-4
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forgetting for knowledge bases in DL-lite
- Results on the propositional \(\mu\)-calculus
- Efficient weakest preconditions
- Knowledge forgetting: properties and applications
- Instrumenting a weakest precondition calculus for counterexample generation
- On the limits of forgetting in answer set programming
- Forgetting in multi-agent modal logics
- Semantic forgetting in answer set programming
- Solving logic program conflict through strong and weak forgettings
- Knowledge updates: Semantics and complexity issues
- On modal \(\mu\)-calculus with explicit interpolants
- The Logical Difference for the Lightweight Description Logic EL
- The mu-calculus and Model Checking
- Temporal logic can be more expressive
- Automata for the modal μ-calculus and related results
- Variable Forgetting in Reasoning about Knowledge
- Guarded commands, nondeterminacy and formal derivation of programs
- Temporal logics of “the next” do not have the beth property
- You Can't Always Forget What You Want: On the Limits of Forgetting in Answer Set Programming
- A Knowledge Level Account of Forgetting
- Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
- Knowledge Forgetting in Answer Set Programming
- An axiomatic basis for computer programming
- On strongest necessary and weakest sufficient conditions
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
This page was built for publication: Knowledge forgetting in propositional \(\mu\)-calculus
