A class of information logics with a decidable validity problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1996

A class of information logics with a decidable validity problem

Résumé

For a class of prepositional information logics defined from Pawlak's information systems, the validity problem is proved to be decidable using a significant variant of the standard filtration technique. Actually the decidability is proved by showing that each logic has the strong finite model property and by bounding the size of the models. The logics in the scope of this paper are characterized by classes of Kripke-style structures with interdependent equivalence relations and closed by the so-called restriction operation. They include Gargov's data analysis logic with local agreement and Nakamura's logic of graded modalities.

Dates et versions

hal-03202624 , version 1 (20-04-2021)

Identifiants

Citer

Stéphane Demri. A class of information logics with a decidable validity problem. Mathematical Foundations of Computer Science 1996 21st International Symposium, Wojciech Penczek; Andrzej Szałas, Sep 1996, Krakow, Poland. pp.291-302, ⟨10.1007/3-540-61550-4_156⟩. ⟨hal-03202624⟩

Collections

UGA IMAG CNRS
27 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More