Forgetting in multi-agent modal logics
From MaRDI portal
Publication:2321251
DOI10.1016/j.artint.2018.08.003zbMath1478.68351OpenAlexW2896342217WikidataQ129084399 ScholiaQ129084399MaRDI QIDQ2321251
Yong-Mei Liu, Liangda Fang, Hans P. van Ditmarsch
Publication date: 28 August 2019
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2018.08.003
Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Agent technology and artificial intelligence (68T42)
Related Items (3)
Knowledge forgetting in propositional \(\mu\)-calculus ⋮ Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions ⋮ Computing sufficient and necessary conditions in CTL: a forgetting approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forgetting for knowledge bases in DL-lite
- Results on the propositional \(\mu\)-calculus
- Uniform interpolation and propositional quantifiers in modal logics
- Common knowledge does not have the Beth property
- Reasoning under inconsistency: a forgetting-based approach
- Introspective forgetting
- Knowledge forgetting: properties and applications
- A guide to completeness and complexity for modal logics of knowledge and belief
- An algebraic theory of normal forms
- How to progress a database
- Undefinability of propositional quantifiers in the modal system S4
- Semantic forgetting in answer set programming
- Solving logic program conflict through strong and weak forgettings
- Knowledge updates: Semantics and complexity issues
- Finite models constructed from canonical formulas
- On modal \(\mu\)-calculus with explicit interpolants
- Normal forms in modal logic
- ELIMINATING CONCEPTS AND ROLES FROM ONTOLOGIES IN EXPRESSIVE DESCRIPTIVE LOGICS
- A Note on Bisimulation Quantifiers and Fixed Points over Transitive Frames
- Uniform Interpolation by Resolution in Modal Logic
- Automata for the modal μ-calculus and related results
- μ-programs, uniform interpolation and bisimulation quantifiers for modal logics ★
- Variable Forgetting in Reasoning about Knowledge
- Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
- The Logic of Exact Covers: Completeness and Uniform Interpolation
- Knowledge Forgetting in Answer Set Programming
- On strongest necessary and weakest sufficient conditions
This page was built for publication: Forgetting in multi-agent modal logics
