Search Results for author:
Found 4 papers, 0 papers with code
Spatial Intelligence of a Self-driving Car and Rule-Based Decision Making
In this paper we show how rule-based decision making can be combined with traditional motion planning techniques to achieve human-like behavior of a self-driving vehicle in complex traffic situations.
A tetrachotomy of ontology-mediated queries with a covering axiom
In this article, aiming to understand the fundamental roots of this difficulty, we strip the problem to the bare bones and focus on Boolean conjunctive queries mediated by a simple covering axiom stating that one class is covered by the union of two other classes.
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity
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 rewritings of ontology-mediated queries (OMQs), and the complexity problem for OMQ answering.
Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results
Our first contribution is to clarify the worst-case size of positive existential (PE), non-recursive Datalog (NDL), and first-order (FO) rewritings for various classes of tree-like conjunctive queries, ranging from linear queries to bounded treewidth queries.
