9 citations · 52 across the 16 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.LO2017★ 9 cited
Kripke Completeness of Strictly Positive Modal Logics over Meet-semilattices with Operators
Stanislav Kikot, Agi Kurucz, Yoshihito Tanaka +2
Our concern is the completeness problem for spi-logics, that is, sets of implications between strictly positive formulas built from propositional variables, conjunction and modal d…
cs.DB2017★ 3 cited
The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov +3
Our concern is the overhead of answering OWL 2 QL ontology-mediated queries (OMQs) in ontology-based data access compared to evaluating their underlying tree-shaped and bounded tre…