Dependence in Propositional Logic: Formula-Formula Dependence and Formula Forgetting - Application to Belief Update and Conservative Extension
Abstract
Dependence is an important concept for many tasks in artificial intelligence. A task can be executed more efficiently by discarding something independent from the task. In this paper, we propose two novel notions of dependence in propositional logic: formula-formula dependence and formula forgetting. The first is a relation between formulas capturing whether a formula depends on another one, while the second is an operation that returns the strongest consequence independent of a formula. We also apply these two notions in two well-known issues: belief update and conservative extension. Firstly, we define a new update operator based on formula-formula dependence. Furthermore, we reduce conservative extension to formula forgetting.
Cite
Text
Fang et al. "Dependence in Propositional Logic: Formula-Formula Dependence and Formula Forgetting - Application to Belief Update and Conservative Extension." AAAI Conference on Artificial Intelligence, 2018. doi:10.1609/AAAI.V32I1.11542Markdown
[Fang et al. "Dependence in Propositional Logic: Formula-Formula Dependence and Formula Forgetting - Application to Belief Update and Conservative Extension." AAAI Conference on Artificial Intelligence, 2018.](https://mlanthology.org/aaai/2018/fang2018aaai-dependence/) doi:10.1609/AAAI.V32I1.11542BibTeX
@inproceedings{fang2018aaai-dependence,
title = {{Dependence in Propositional Logic: Formula-Formula Dependence and Formula Forgetting - Application to Belief Update and Conservative Extension}},
author = {Fang, Liangda and Wan, Hai and Liu, Xianqiao and Fang, Biqing and Lai, Zhao-Rong},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2018},
pages = {1835-1844},
doi = {10.1609/AAAI.V32I1.11542},
url = {https://mlanthology.org/aaai/2018/fang2018aaai-dependence/}
}