Search Results for author: Patrick Koopmann

Found 10 papers, 1 papers with code

Towards Ontology-Mediated Planning with OWL DL Ontologies (Extended Version)

no code implementations16 Aug 2023 Tobias John, Patrick Koopmann

Current approaches for planning with DL ontologies integrate the DL directly into the planning language, and practical approaches have been developed based on first-order rewritings or rewritings into datalog.

Why Not? Explaining Missing Entailments with Evee (Technical Report)

no code implementations14 Aug 2023 Christian Alrabbaa, Stefan Borgwardt, Tom Friese, Patrick Koopmann, Mikhail Kotlov

Understanding logical entailments derived by a description logic reasoner is not always straight-forward for ontology users.

Efficient Computation of General Modules for ALC Ontologies (Extended Version)

no code implementations16 May 2023 Hui Yang, Patrick Koopmann, Yue Ma, Nicole Bidoit

Our evaluation indicates that our general modules are often smaller than classical modules and uniform interpolants computed by the state-of-the-art, and compared with uniform interpolants, can be computed in a significantly shorter time.

On the Eve of True Explainability for OWL Ontologies: Description Logic Proofs with Evee and Evonne (Extended Version)

1 code implementation15 Jun 2022 Christian Alrabbaa, Stefan Borgwardt, Tom Friese, Patrick Koopmann, Julián Méndez, Alexej Popovič

When working with description logic ontologies, understanding entailments derived by a description logic reasoner is not always straightforward.

Connection-minimal Abduction in EL via Translation to FOL -- Technical Report

no code implementations17 May 2022 Fajar Haifani, Patrick Koopmann, Sophie Tourret, Christoph Weidenbach

We consider TBox abduction in the lightweight description logic EL, where the observation is a concept inclusion and the background knowledge is a TBox, i. e., a set of concept inclusions.

Translation

Efficient TBox Reasoning with Value Restrictions using the $\mathcal{FL}_{o}$wer reasoner

no code implementations27 Jul 2021 Franz Baader, Patrick Koopmann, Friedrich Michel, Anni-Yasmin Turhan, Benjamin Zarrieß

The inexpressive Description Logic (DL) $\mathcal{FL}_0$, which has conjunction and value restriction as its only concept constructors, had fallen into disrepute when it turned out that reasoning in $\mathcal{FL}_0$ w. r. t.

Signature-Based Abduction with Fresh Individuals and Complex Concepts for Description Logics (Extended Version)

no code implementations1 May 2021 Patrick Koopmann

In signature-based ABox abduction, the hypothesis is further required to use only names from a given set.

Finding Good Proofs for Description Logic Entailments Using Recursive Quality Measures (Extended Technical Report)

no code implementations27 Apr 2021 Christian Alrabbaa, Franz Baader, Stefan Borgwardt, Patrick Koopmann, Alisa Kovtunova

In previous work, we first restricted the attention to a setting where proof size is used to measure the quality of a proof.

Signature-Based Abduction for Expressive Description Logics -- Technical Report

no code implementations1 Jul 2020 Patrick Koopmann, Warren Del-Pinto, Sophie Tourret, Renate A. Schmidt

Signature-based abduction aims at building hypotheses over a specified set of names, the signature, that explain an observation relative to some background knowledge.

Cannot find the paper you are looking for? You can Submit a new open access paper.