Relative similarity logics are decidable: Reduction to FO^2 with equality

From MaRDI portal
Publication:4246974





This paper has applications to problems on the classification of objects in the presence of incomplete information. More specifically, the authors show the decidability of the satisfiability problem for relative similarity logics and obtain a finite model property for such logics. Further, the paper has applications to modal logics. For the entire collection see [Zbl 0898.00025].











This page was built for publication: Relative similarity logics are decidable: Reduction to \(\text{FO}^2\) with equality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246974)