Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions

DOI10.1016/j.artint.2023.104036arXiv2305.07233OpenAlexW4387873447MaRDI QIDQ6152662

Andrzej Szałas, Patrick Doherty

Publication date: 13 February 2024

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.07233

zbMATH Keywords

quantifier eliminationknowledge representationreasoningforgettingstrongest necessary conditionsweakest sufficient conditions

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Quantifier elimination, model completeness, and related topics (03C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• AGM 25 years. Twenty-five years of research in belief change
• Reasoning under inconsistency: a forgetting-based approach
• Introspective forgetting
• Computing circumscription revisited: A reduction algorithm
• Forgetting in multi-agent modal logics
• Solving logic program conflict through strong and weak forgettings
• Knowledge forgetting in propositional \(\mu\)-calculus
• On the strength and scope of DLS
• On the logic of theory change: Partial meet contraction and revision functions
• A Knowledge Level Account of Forgetting
• Logic and structure

This page was built for publication: Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions