Results 1  10
of
4,889,013
Most Specific Generalizations w.r.t. General ELTBoxes
"... In the area of Description Logics the least common subsumer (lcs) and the most specific concept (msc) are inferences that generalize a set of concepts or an individual, respectively, into a single concept. If computed w.r.t. a general ELTBox neither the lcs nor the msc need to exist. So far in this ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In the area of Description Logics the least common subsumer (lcs) and the most specific concept (msc) are inferences that generalize a set of concepts or an individual, respectively, into a single concept. If computed w.r.t. a general ELTBox neither the lcs nor the msc need to exist. So far
Most Specific Generalizations w.r.t. General ELTBoxes
"... In the area of Description Logics the least common subsumer (lcs) and the most specific concept (msc) are inferences that generalize a set of concepts or an individual, respectively, into a single concept. If computed w.r.t. a general ELTBox neither the lcs nor the msc need to exist. So far in this ..."
Abstract
 Add to MetaCart
In the area of Description Logics the least common subsumer (lcs) and the most specific concept (msc) are inferences that generalize a set of concepts or an individual, respectively, into a single concept. If computed w.r.t. a general ELTBox neither the lcs nor the msc need to exist. So far
Proceedings of the TwentyThird International Joint Conference on Artificial Intelligence Most Specific Generalizations w.r.t. General ELTBoxes
"... In the area of Description Logics the least common subsumer (lcs) and the most specific concept (msc) are inferences that generalize a set of concepts or an individual, respectively, into a single concept. If computed w.r.t. a general ELTBox neither the lcs nor the msc need to exist. So far in this ..."
Abstract
 Add to MetaCart
In the area of Description Logics the least common subsumer (lcs) and the most specific concept (msc) are inferences that generalize a set of concepts or an individual, respectively, into a single concept. If computed w.r.t. a general ELTBox neither the lcs nor the msc need to exist. So far
Similarity Measures for Computing Relaxed Instances w.r.t. General ELTBoxes
, 2013
"... The notion of concept similarity is central to several ontology tasks and can be employed to realize relaxed versions of classical reasoning services. In this paper we investigate the reasoning service of answering instance queries in a relaxed fashion, where the query concept is relaxed by means of ..."
Abstract
 Add to MetaCart
of a concept similarity measure (CSM). To this end we investigate CSMs that assess the similarity of ELconcepts defined w.r.t. a general ELTBox. We derive such a family of CSMs from a family of similarity measures for finite interpretations and show in both cases that the resulting measures enjoy a
Subsumption in EL w.r.t. hybrid TBoxes
"... In the area of Description Logic (DL) based knowledge representation, two desirable features of DL systems have as yet been incompatible: firstly, the support of general TBoxes containing general concept inclusion (GCI) axioms, and secondly, nonstandard inference services facilitating knowledge en ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
polynomial reduction to subsumption w.r.t. cyclic ELTBoxes with fixpoint semantics. By virtue of this reduction, all nonstandard inferences already available for cyclic ELTBoxes become available for hybrid ones.
Query Rewriting under ELTBoxes: Efficient Algorithms
"... Abstract. We propose a new type of algorithm for computing firstorder (FO) rewritings of concept queries under ELTBoxes that is tailored towards efficient implementation. The algorithm outputs a nonrecursive datalog rewriting if the input is FOrewritable and otherwise reports nonFOrewritabilit ..."
Abstract
 Add to MetaCart
Abstract. We propose a new type of algorithm for computing firstorder (FO) rewritings of concept queries under ELTBoxes that is tailored towards efficient implementation. The algorithm outputs a nonrecursive datalog rewriting if the input is FOrewritable and otherwise reports non
Computing the lcs w.r.t. General EL +TBoxes
"... Abstract. Recently, exact conditions for the existence of the least common subsumer (lcs) computed w.r.t. general ELTBoxes have been devised [13]. This paper extends these results and provides necessary and suffcient conditions for the existence of the lcs w.r.t. EL +TBoxes. We show decidability o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Recently, exact conditions for the existence of the least common subsumer (lcs) computed w.r.t. general ELTBoxes have been devised [13]. This paper extends these results and provides necessary and suffcient conditions for the existence of the lcs w.r.t. EL +TBoxes. We show decidability
A ProofTheoretic Subsumption Reasoner for Hybrid ELTBoxes
"... Abstract. Hybrid ELTBoxes combine general concept inclusions (GCIs), which are interpreted with descriptive semantics, with cyclic concept definitions, which are interpreted with greatest fixpoint (gfp) semantics. We introduce a prooftheoretic approach that yields a polynomialtime decision proced ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
procedure for subsumption in EL w.r.t. hybrid TBoxes, and present preliminary experimental results regarding the performance of the reasoner Hyb that implements this decision procedure. 1
Concept definability and interpolation in enriched models of EL–TBoxes ⋆
"... Abstract. It is known that in Description Logics explicit concept definability is directly related to concept interpolation. The problem to decide whether a concept is definable under a TBox wrt a signature usually reduces to entailment in the underlying logic. If an explicit definition exists, then ..."
Abstract
 Add to MetaCart
, then it can be found as a concept interpolant for a concept inclusion entailed by an appropriately chosen TBox. In fact, it can be extracted from a corresponding proof of the concept inclusion. We describe a graph structure called enriched model that represents proofs in normalized ELTBoxes and show that
Mining Generalized Association Rules
, 1995
"... We introduce the problem of mining generalized association rules. Given a large database of transactions, where each transaction consists of a set of items, and a taxonomy (isa hierarchy) on the items, we find associations between items at any level of the taxonomy. For example, given a taxonomy th ..."
Abstract

Cited by 577 (7 self)
 Add to MetaCart
We introduce the problem of mining generalized association rules. Given a large database of transactions, where each transaction consists of a set of items, and a taxonomy (isa hierarchy) on the items, we find associations between items at any level of the taxonomy. For example, given a taxonomy
Results 1  10
of
4,889,013