Zobrazeno 1 - 10
of 238
pro vyhledávání: '"Franz Baader"'
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, Barbara Morawska
Publikováno v:
Logical Methods in Computer Science, Vol Volume 6, Issue 3 (2010)
The Description Logic EL has recently drawn considerable attention since, on the one hand, important inference problems such as the subsumption problem are polynomial. On the other hand, EL is used to define large biomedical ontologies. Unification i
Externí odkaz:
https://doaj.org/article/387ff54503d342b4b0a975414139b9c3
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
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
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
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
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
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