Learn More
We investigate the subsumption problem in logic-based knowledge representation languages of the kl-one family and give decision procedures. All our languages contain as a kernel the logical connectives conjunction, disjunction, and negation for concepts, as well as role quantiication. The algorithms are rule-based and can be understood as variants of(More)
A basic feature of Terminological Knowledge Representation Systems is to represent knowledge by means of taxonomies, here called terminologies, and to provide a specialized reasoning engine to do inferences on these structures. The taxonomy is built through a representation language called a concept language (or description logic), which is given a(More)
We investigate subsumption algorithms for logic-based knowledge representation languages of the kl-one family. We deene an attribu-tive concept description language that contains the logical connectives conjunction, disjunction, and negation, as well as role quantiication, number restrictions and role intersection. We describe a rule based calculus to(More)
We have developed and implemented the Relational Grid Monitoring Architecture (R-GMA) as part of the DataGrid project, to provide a flexible information and monitoring service for use by other middleware components and applications. R-GMA presents users with a virtual database and mediates queries posed at this database: users pose queries against a global(More)
  • F M Donini, M Lenzerini, D Nardi, A Schaerf, Jon R Wright, Elia S Weixelbaum +76 others
  • 1996
tively used in the construction of knowledge-based applications in several domains (see for example Wright et al. 1993), like connguration and software engineering. Recently we have seen attempts to use them in the elds of machine learning (see for example Cohen and Hirsh 1994) and planning (see for example Devambu and Litman 1991, Weida and Litman 1992,(More)
Equivalence of aggregate queries is investigated for the class of conjunctive queries with comparisons and the aggregate operators count, count-distinct, min, max, and sum. Essentially, this class contains unnested SQL queries with the above aggregate operators, with a where clause consisting of a conjunction of comparisons, and without a having clause. The(More)
We present two concept languages,, called PL 1 and PL 2 which are extensions of TC-. We prove that the subsumption problem in these languages can be solved in polynomial time. Both languages include a construct for expressing inverse roles, which has not been considered up to now in tractable languages. In addition, PL 1 includes number restrictions and(More)