Basic Description Logics
This chapter provides an introduction to Description Logics as a formal language for representing knowledge and reasoning about it, covering syntax and semantics, and the basic constructors that are used in systems or have been introduced in the literature.
The Complexity of Concept Languages
- F. M. Donini, M. Lenzerini, D. Nardi, W. Nutt
- Computer ScienceInternational Conference on Principles of…
- 10 April 1997
A complexity analysis of concept satisfiability and subsumption for a wide class of concept languages and algorithms for these inferences that comply with the worst-case complexity of the reasoning task they perform.
Evolution of DL-Lite Knowledge Bases
- Diego Calvanese, E. Kharlamov, W. Nutt, D. Zheleznyakov
- Computer ScienceInternational Workshop on the Semantic Web
- 7 November 2010
Two novel formula-based approaches that respect fundamental principles of KB evolution are proposed and for which evolution is expressible in DL-Lite are proposed.
An Epistemic Operator for Description Logics
Rewriting aggregate queries using views
- Sara Cohen, W. Nutt, Alexander Serebrenik
- Computer ScienceACM SIGACT-SIGMOD-SIGART Symposium on Principles…
- 1 May 1999
This paper investigates the problem of rewriting queries with aggregate operators using views that may or may not contain aggregate operators, and shows for each type of candidate that the existence of both, partial and complete rewritings is decidable, and provides upper and lower complexity bounds.
Subsumption Algorithms for Concept Description Languages
- B. Hollunder, W. Nutt, M. Schmidt-Schauß
- Computer ScienceEuropean Conference on Artificial Intelligence
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 is described.
The Relational Grid Monitoring Architecture: Mediating Information about the Grid
The requirements, design and implementation of R-GMA are discussed, as deployed on the DataGrid testbed, and some of the ways in which the service is being used are described.
Order-Sorted Equational Computation
Unification in Monoidal Theories
- W. Nutt
- 1 July 1990
We study the unification problem for a class of equational theories that comprises important examples like abelian monoids (AC), idempotent abelian monoids (ACI), and abelian groups. Monoidal…
R-GMA: An Information Integration System for Grid Monitoring
Computational Grids are distributed systems that provide access to computational resources in a transparent fashion. Collecting and providing information about the status of the Grid itself is called…