Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Patrick Koopmann"'
Publikováno v:
Formal Aspects of Computing. 33:885-921
Probabilistic model checking (PMC) is a well-established method for the quantitative analysis of state based operational models such as Markov decision processes. Description logics (DLs) provide a well-suited formalism to describe and reason about k
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1dcaaea109bcd627892b91ad6f203757
https://doi.org/10.1007/s00165-021-00549-0
https://doi.org/10.1007/s00165-021-00549-0
Publikováno v:
Theory and Practice of Logic Programming. 22:162-192
The inexpressive Description Logic (DL) ${\cal F}{{\cal L}_0}$ , which has conjunction and value restriction as its only concept constructors, had fallen into disrepute when it turned out that reasoning in ${\cal F}{{\cal L}_0}$ w.r.t. general TBoxes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95517302dd1e5f4d4ab299b0fdbcb4c8
https://doi.org/10.1017/s1471068421000466
https://doi.org/10.1017/s1471068421000466
Publikováno v:
KI - Künstliche Intelligenz. 34:543-550
The project “Semantic Technologies for Situation Awareness” was concerned with detecting certain critical situations from data obtained by observing a complex hard- and software system, in order to trigger actions that allow this system to save e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7dff7c718ff7516428d3500dcb0a55d7
https://doi.org/10.1007/s13218-020-00694-3
https://doi.org/10.1007/s13218-020-00694-3
Publikováno v:
ACM Transactions on Computational Logic. 21:1-46
In contrast to qualitative linear temporal logics, which can be used to state that some property will eventually be satisfied, metric temporal logics allow us to formulate constraints on how long it may take until the property is satisfied. While mos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02457bce715cf2699916a9372a942642
https://doi.org/10.1145/3399443
https://doi.org/10.1145/3399443
Publikováno v:
Automated Reasoning ISBN: 9783031107689
Abduction in description logics finds extensions of a knowledge base to make it entail an observation. As such, it can be used to explain why the observation does not follow, to repair incomplete knowledge bases, and to provide possible explanations
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e54d0bc9dc3b2a229a6f222526932551
https://doi.org/10.1007/978-3-031-10769-6_12
https://doi.org/10.1007/978-3-031-10769-6_12
Errors in Description Logic (DL) ontologies are often detected when a reasoner computes unwanted consequences. The question is then how to repair the ontology such that the unwanted consequences no longer follow, but as many of the other consequences
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08d57a0ba9b8cf1cb44e43f202292251
https://doi.org/10.25368/2022.65
https://doi.org/10.25368/2022.65
Publikováno v:
Rules and Reasoning ISBN: 9783031215407
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::698ee3a2182eec39916543565a491497
https://doi.org/10.1007/978-3-031-21541-4_11
https://doi.org/10.1007/978-3-031-21541-4_11
Publikováno v:
The Semantic Web ISBN: 9783031069802
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4050cb7f83b81f38fa0177d9822cc23
https://doi.org/10.1007/978-3-031-06981-9_8
https://doi.org/10.1007/978-3-031-06981-9_8
The application of automated reasoning approaches to Description Logic (DL) ontologies may produce certain consequences that either are deemed to be wrong or should be hidden for privacy reasons. The question is then how to repair the ontology such t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d73094e57abdb764d873bc4415aaae3
https://doi.org/10.25368/2022.64
https://doi.org/10.25368/2022.64
Autor:
Patrick Koopmann
Publikováno v:
IJCAI
Given a knowledge base and an observation as a set of facts, ABox abduction aims at computing a hypothesis that, when added to the knowledge base, is sufficient to entail the observation. In signature-based ABox abduction, the hypothesis is further r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2128f8bc88dedb29dc5f0696ee872d2f
https://doi.org/10.24963/ijcai.2021/266
https://doi.org/10.24963/ijcai.2021/266