Tableaux for Reasoning About Atomic Updates

Authors:
Christian G. Fermüller;Georg Moser;Richard Zach
Affiliations:
-;-;-
Venue:
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Year:
2001

Citing 12
Cited 0

On the complexity of propositional knowledge base revision, updates, and counterfactuals

Artificial Intelligence
Automated deduction in multiple-valued logics

Automated deduction in multiple-valued logics
The value of the four values

Artificial Intelligence
Modal change logic (MCL): specifying the reasoning of knowledge-based systems

Data & Knowledge Engineering
Single Step Tableaux for Modal Logics

Journal of Automated Reasoning
Counterfactuals and Updates as Inverse Modalities

Journal of Logic, Language and Information
A Modal Logic for Data Analysis

MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Tableaux for Finite-Valued Logics with Arbitrary Distribution Modalities

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Modality and Databases

TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Optimal Axiomatizations for Multiple-Valued Operators and Quantifiers Based on Semi-lattices

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
The Logical Role of the Four-Valued Bilattice

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Modeling belief in dynamic systems part II: revision and update

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple model of dynamic databases is studied from a modal logic perspecitve. A state α of a database is an atomic update of a state β if at most one atomic statement is evaluated differently in α compared to β. The corresponding restriction on Kripke-like structures yields so-called update logics. These logics are studied also in a many-valued context. Adequate tableau calculi are given.