An essay in combinatory dynamic logic
Information and Computation
Modal logics for knowledge representation systems
Theoretical Computer Science
Incomplete Information: Rough Set Analysis
Incomplete Information: Rough Set Analysis
A Logic with Relative Knowledge Operators
Journal of Logic, Language and Information
Complexity of Two-Variable Logic with Counting
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A universally defined undecidable unimodal logic
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Relative Nondeterministic Information Logic is EXPTIME-complete
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Automata-Theoretic Decision Procedures for Information Logics
Fundamenta Informaticae
The Nondeterministic Information Logic NIL is PSPACE-complete
Fundamenta Informaticae
| Hi-index | 0.00 |
We show the decidability of the satisfiability problem for relative similarity logics that allow classification of objects in presence of incomplete information. As a side-effect, we obtain a finite model property for such similarity logics. The proof technique consists of reductions into the satisfiability problem for the decidable fragment FO2 with equality from classical logic. Although the reductions stem from the standard translation from modal logic into classical logic, our original approach (for instance handling nominals for atomic properties and decomposition in terms of components encoded in the reduction) can be generalized to a larger class of relative logics, opening ground for further investigations.