Lost in translation: Language independence in propositional logic - application to belief change

Authors:
Pierre Marquis;Nicolas Schwind
Affiliations:
CRIL CNRS UMR8188, Université dArtois, rue Jean Souvraz, F-62307 Lens, France;National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, 101-8430 Tokyo, Japan
Venue:
Artificial Intelligence
Year:
2014

Citing 11
Cited 0

Propositional knowledge base revision and minimal change

Artificial Intelligence
On the complexity of Boolean unification

Information Processing Letters
Conditional independence in propositional logic

Artificial Intelligence
DA2 merging operators

Artificial Intelligence - Special issue on nonmonotonic reasoning
Boolean Functions as Models for Quantified Boolean Formulas

Journal of Automated Reasoning
On propositional definability

Artificial Intelligence
Propositional independence: formula-variable independence and forgetting

Journal of Artificial Intelligence Research
Introducing actions into qualitative simulation

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Qualitative relevance and independence: a roadmap

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Belief base rationalization for propositional merging

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Lost in translation: language independence in propositional logic-application to belief revision and belief merging

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two

Quantified Score

Hi-index	0.00

Visualization

Abstract

While propositional logic is widely used as a representation framework for many AI applications, the concept of language independence in the propositional setting has not received much attention so far. In this paper, we define language independence for a propositional operator as robustness w.r.t. symbol translation. We motivate the need to focus on symbol translations of restricted types, introduce and study several families of translations of interest, and provide a number of characterization results. We also identify the computational complexity of recognizing symbol translations from those families. Then we investigate the robustness of belief merging, belief revision and belief update operators w.r.t. translations of different types. It turns out that some rational merging/revision/update operators are not guaranteed to offer the most basic (yet non-trivial) form of language independence.