Generalizing Parikh’s Criterion for Relevance-Sensitive Belief Revision

DOI10.1145/3572907OpenAlexW4309940924MaRDI QIDQ5886525

Theofanis Aravanis

Publication date: 5 April 2023

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3572907

zbMATH Keywords

relevanceknowledge representationbelief changelocal revisionDalal's revision operatorParikh's splittability

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

Deductive belief change

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Beth definability, interpolation and language splitting
• Propositional relevance through letter-sharing
• Relevance in belief revision
• Propositional knowledge base revision and minimal change
• Relevance sensitive belief structures
• An investigation of parametrized difference revision operators
• On the logic of theory change: Partial meet contraction and revision functions
• Relevance Sensitive Non-Monotonic Inference on Belief Sequences
• A study of possible-worlds semantics of relevance-sensitive belief revision
• An ASP-based solver for parametrized-difference revision
• Full Characterization of Parikh's Relevance-Sensitive Axiom for Belief Revision
• Belief Change
• Parallel interpolation, splitting, and relevance in belief change
• Sets, logic and maths for computing

This page was built for publication: Generalizing Parikh’s Criterion for Relevance-Sensitive Belief Revision