activity
20162021
most citedDeciding boundedness of monadic sirups

2 citations · 3 across the 2 of their papers we have counts for

collaborators
Showing cs.DBShow all

1 paper · 1 filter

cs.DB2016

Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity

Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov +2

We give solutions to two fundamental computational problems in ontology-based data access with the W3C standard ontology language OWL 2 QL: the succinctness problem for first-order…