Boolean logics with relations

Authors:
Philippe Balbiani;Tinko Tinchev
Affiliations:
Institut de Recherche en Informatique de Toulouse, Toulouse University, France;Faculty of Mathematics and Computer Science, Sofia University, Bulgaria
Venue:
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Year:
2008

Citing 6
Cited 0

The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic

Artificial Intelligence
Boolean connection algebras: a new approach to the Region-Connection Calculus

Artificial Intelligence
A representation theorem for Boolean contact algebras

Theoretical Computer Science
Contact Algebras and Region-based Theory of Space: A Proximity Approach - I

Fundamenta Informaticae
Contact Algebras and Region-based Theory of Space: Proximity Approach - II

Fundamenta Informaticae
Modal Logics for Region-based Theories of Space

Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a fragment of propositional modal logics using the universal modality given by a restriction on the modal depth of modal formulas.