A class of decidable information logics

DOI10.1016/S0304-3975(97)00157-6zbMath0902.68062OpenAlexW1986024218MaRDI QIDQ1128479

Stéphane P. Demri

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00157-6

zbMATH Keywords

decidabilityfinite model propertyinformation systemmultimodal logiclocal agreement condition

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Theory of data (68P99)

Related Items (1)

A polynomial space construction of tree-like models for logics with local chains of modal connectives

Cites Work

• A logic for reasoning about relative similarity
• Rough sets and fuzzy sets
• On standard models of fuzzy modal logics
• Information systems theoretical foundations
• Modal logics for knowledge representation systems
• A guide to completeness and complexity for modal logics of knowledge and belief
• Decidability by filtrations for graded normal logics. (Graded modalities. V)
• Corrigendum to: ``DAL -- a logic for data analysis
• Taming logic
• Coverings by classes of permutable equivalence relations
• Similarity relations and fuzzy orderings
• A general filtration method for modal logics
• Expressive power of knowledge representation systems
• Logic For Reasoning About Knowledge
• The equational theory of CA₃ is undecidable
• Rough sets
• On Some Completeness Theorems in Modal Logic
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Rough polyadic modal logics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of decidable information logics