1 |
Rewriting Concepts Using TerminologiesBaader, Franz, Molitor, Ralf 20 May 2022 (has links)
In this work we consider the inference problem of computing (minimal) rewritings of concept descriptions using defined concepts from a terminology. We introduce a general framework for this problem. For the small description logic FL₀, which provides us with conjunction and value restrictions, we show that the decision problem induced by the minimal rewriting problem is NP-complete.
|
2 |
Unification of Concept Terms in Description Logics: Revised VersionBaader, Franz, Narendran, Paliath 19 May 2022 (has links)
Unification of concept terms is a new kind of inference problem for Description Logics, which extends the equivalence problem by allowing to replace certain concept names by concept terms before testing for equivalence. We show that this inference problem is of interest for applications, and present first decidability and complexity results for a small concept description language. / This revised version of LTCS-Report 97-02 provides a stronger complexity result in Section 6. An abridged version will appear in Proc. ECAI'98 .
|
3 |
Description Logics with Aggregates and Concrete Domains, Part IIBaader, Franz, Sattler, Ulrike 19 May 2022 (has links)
We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min,max,count,sum), which are usually available in database systems. We present decision procedures for the inference problems satisfiability for these Logics-provided that the concrete domain is
not too expressive. An example of such a concrete domain is the set of (nonnegative) integers with comparisons (=,≤, ≤n, ...) and the aggregation functions min, max, count. / This is a new, extended version of a report with the same number.
An abridged version has appeared in the Proceedings of the European Conference on Artificial Intelligence, Brighton, UK, 1998.
|
4 |
Unfication of Concept Terms in Description LogicsBaader, Franz, Narendran, Paliath 18 May 2022 (has links)
Unification of concept terms is a new kind of inference problem for Description Logics, which extends the equivalence problem by allowing to replace certain concept names by concept terms before testing for equivalence. We show that this inference problem is of interest for applications, and present first decidability and complexity results for a small concept description language.
|
5 |
The instance problem and the most specific concept in the description logic EL w.r.t. terminological cycles with descriptive semanticsBaader, Franz 30 May 2022 (has links)
In two previous reports we have investigated both standard and non-standard inferences in the presence of terminological cycles for the description logic EL, which allows for conjunctions, existential restrictions, and the top concept. Regarding standard inference problems, it was shown there that the subsumption problem remains polynomial for all three types of semantics usually considered for cyclic definitions in description logics, and that the instance problem remains polynomial for greatest fixpoint semantics. Regarding non-standard inference problems, it was shown that, w.r.t. greatest fixpoint semantics, the least common subsumer and the most specific concept always exist and can be computed in ploynomial time, and that, w.r.t. descriptive semantics, the least common subsumer need not exist. The present report is concerned with two problems left open by this previous work, namely the instance problem and the problem of computing most specific concepts w.r.t. descriptive semantics, which is the usual first-order semantics for description logic. We will show that the instance problem is polynomial also in this context. Similar to the case of the least common subsumer, the most specific concept w.r.t. descriptive semantics need not exist, but we are able to characterize the cases in which it exists and give a decidable sufficient condition for the existence of the most specific concept. Under this condition, it can be computed in polynomial time.
|
Page generated in 0.096 seconds