13 citations · 33 across the 11 of their papers we have counts for
11 papers
Combining Proofs for Description Logic and Concrete Domain Reasoning (Technical Report)
Christian Alrabbaa, Franz Baader, Stefan Borgwardt +2
Logic-based approaches to AI have the advantage that their behavior can in principle be explained with the help of proofs of the computed consequences. For ontologies based on Desc…
Explaining Ontology-Mediated Query Answers using Proofs over Universal Models (Technical Report)
Christian Alrabbaa, Stefan Borgwardt, Patrick Koopmann +1
In ontology-mediated query answering, access to incomplete data sources is mediated by a conceptual layer constituted by an ontology, which can be formulated in a description logic…
Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies (Technical Report)
Christian Alrabbaa, Stefan Borgwardt, Patrick Koopmann +1
In ontology-mediated query answering, access to incomplete data sources is mediated by a conceptual layer constituted by an ontology. To correctly compute answers to queries, it is…
Expressivity of Planning with Horn Description Logic Ontologies (Technical Report)
Stefan Borgwardt, Jörg Hoffmann, Alisa Kovtunova +3
State constraints in AI Planning globally restrict the legal environment states. Standard planning languages make closed-domain and closed-world assumptions. Here we address open-w…
First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
Alessandro Artale, Roman Kontchakov, Alisa Kovtunova +3
Aiming at ontology-based data access to temporal data, we design two-dimensional temporal ontology and query languages by combining logics from the (extended) DL-Lite family with l…
Temporal Minimal-World Semantics for Sparse ABoxes
Stefan Borgwardt, Walter Forkel, Alisa Kovtunova
Ontology-mediated query answering is a popular paradigm for enriching answers to user queries with background knowledge. For querying the absence of information, however, there exi…
Finding Good Proofs for Description Logic Entailments Using Recursive Quality Measures (Extended Technical Report)
Christian Alrabbaa, Franz Baader, Stefan Borgwardt +2
Logic-based approaches to AI have the advantage that their behavior can in principle be explained to a user. If, for instance, a Description Logic reasoner derives a consequence th…
Safe Handover in Mixed-Initiative Control for Cyber-Physical Systems
Frederik Wiehr, Anke Hirsch, Florian Daiber +7
For mixed-initiative control between cyber-physical systems (CPS) and its users, it is still an open question how machines can safely hand over control to humans. In this work, we…
Finding Small Proofs for Description Logic Entailments: Theory and Practice (Extended Technical Report)
Christian Alrabbaa, Franz Baader, Stefan Borgwardt +2
Logic-based approaches to AI have the advantage that their behaviour can in principle be explained by providing their users with proofs for the derived consequences. However, if su…
First-Order Rewritability of Ontology-Mediated Queries in Linear Temporal Logic
Alessandro Artale, Roman Kontchakov, Alisa Kovtunova +3
We investigate ontology-based data access to temporal data. We consider temporal ontologies given in linear temporal logic LTL interpreted over discrete time (Z,<). Queries are giv…
Cutting Diamonds: Temporal DLs with Probabilistic Distributions over Data
Alisa Kovtunova, Rafael Peñaloza
Recent work has studied a probabilistic extension of the temporal logic LTL that refines the eventuality (or diamond) constructor with a probability distribution on when will this…