Zobrazeno 1 - 10
of 239
pro vyhledávání: '"Franz, Baader"'
Autor:
Franz Baader, Deepak Kapur
Publikováno v:
Journal of Automated Reasoning. 66:301-329
The word problem for a finite set of ground identities is known to be decidable in polynomial time using congruence closure, and this is also the case if some of the function symbols are assumed to be commutative or defined by certain shallow identit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::674f398409f7699e9737756a2c35977f
https://doi.org/10.1007/s10817-022-09624-4
https://doi.org/10.1007/s10817-022-09624-4
Autor:
Franz Baader, Jakub Rydval
Publikováno v:
Journal of Automated Reasoning. 66:357-407
Concrete domains have been introduced in the area of Description Logic to enable reference to concrete objects (such as numbers) and predefined predicates on these objects (such as numerical comparisons) when defining concepts. Unfortunately, in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f9a736de1a815603dc85500dc84b795
https://doi.org/10.1007/s10817-022-09626-2
https://doi.org/10.1007/s10817-022-09626-2
Description Logics are a family of knowledge representation languages that have been studied extensively in Artificial Intelligence over the last two decades. They are embodied in several knowledge-based systems and are used to develop various real-l
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:
Logical Methods in Computer Science, Vol Volume 12, Issue 4 (2017)
Unification in Description Logics has been introduced as a means to detect redundancies in ontologies. We try to extend the known decidability results for unification in the Description Logic $\mathcal{EL}$ to disunification since negative constraint
Externí odkaz:
https://doaj.org/article/569f450079164568a283e5df067770ad
Autor:
Franz Baader, Francesco Kriegel
Ontologies based on Description Logic (DL) represent general background knowledge in a terminology (TBox) and the actual data in an ABox. DL systems can then be used to compute consequences (such as answers to certain queries) from an ontology consis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a3841adb19c4776ce512742005c3593
https://tud.qucosa.de/id/qucosa:79251
https://tud.qucosa.de/id/qucosa:79251
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
Autor:
Franz Baader, Clément Théron
Publikováno v:
KI - Künstliche Intelligenz. 34:291-301
We investigate the impact that general concept inclusions and role-value maps have on the complexity and decidability of reasoning in the description logic$$\mathcal{FL}_0$$FL0. On the one hand, we give a more direct proof for ExpTime-hardness of sub
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c89e7bd631a5056c8773254f0d8449e
https://doi.org/10.1007/s13218-020-00651-0
https://doi.org/10.1007/s13218-020-00651-0
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