The Complexity of Concept Languages
@inproceedings{Donini1997TheCO,
title={The Complexity of Concept Languages},
author={Francesco M. Donini and Maurizio Lenzerini and Daniele Nardi and Werner Nutt},
booktitle={International Conference on Principles of Knowledge Representation and Reasoning},
year={1997}
}Abstract 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 well-defined set-theoretic semantics. The efficiency of reasoning has often been advocated as a primary motivation for the use of such…
Figures from this paper
439 Citations
Reasoning with Individuals in Concept Languages
- Computer ScienceData Knowl. Eng.
- 1993
Reasoning with Individuals in Concept Languages Reasoning with Individuals in Concept Languages
- Computer Science
- 1994
This paper investigates the consequences of introducing constructors of this type in the concept description language and provides a complete reasoning procedure to deal with these constructors and gets some complexity results on it.
Taxonomic Reasoning in LOGIDATA+
- Computer ScienceLOGIDATA+: Deductive Databases with Complex Objects
- 1993
The developed idea is that, by extending complex object data models with defined classes, it is possible to infer ISA relationships (i.e. compute subsumption) between classes on the basis of their descriptions.
Adding Epistemic Operators to Concept Languages
- Computer ScienceKR
- 1992
This work investigates the use of epistemic operators in the framework of concept languages (also called terminological languages) and reconstructs in logic several common features of existing knowledge representation systems.
Querying Concept-based Knowledge Bases
- Computer SciencePDK
- 1991
This work shows that, provided that a limited language is used for the assertions, it is possible to employ a richer query language while keeping the reasoning process tractable, and it is shown that, on the other hand, there are constructs that make query answering inherently intractable.
Reasoning with Expressive Description Logics: Theory and Practice
- Computer ScienceCADE
- 2002
DAML+OIL is a description logic based ontology language specifically designed for use on the web, and the logical basis of the language means that reasoning services can be provided, both to support ontology design and to make described web resources more accessible to automated processes.
A Refined Architecture for Terminological Systems: Terminology = Schema + Views
- Computer ScienceArtif. Intell.
- 1998
Attribute Description Formalisms ... and the Rest of the World
- Computer ScienceText Understanding in LILOG
- 1991
This work has shown that feature logics, which rely mainly on attributes as the primary notational primitives for representing knowledge, can be jointly characterized as attributive description formalisms.
On taxonomic reasoning in conceptual design
- Computer ScienceTODS
- 1992
The effectiveness of taxonomic reasoning techniques as an active support to knowledge acquisition and conceptual schema design is shown and an extended formalism and taxonomic inference algorithms for models giving prominence to attributes are given.
Decidable Reasoning in Terminological Knowledge Representation Systems
- Computer ScienceIJCAI
- 1993
The decidability of a number of desirable TKRS-deduction services are proved through a sound, complete and terminating calculus for reasoning in ALCNR-knowledge bases, and the result that inclusion statements in A LCNR can be simulated by terminological cycles, if descriptive semantics is adopted.
References
SHOWING 1-10 OF 47 REFERENCES
Foundations of a Functional Approach to Knowledge Representation
- Computer Science, PhilosophyArtif. Intell.
- 1984
Subsumption algorithms for concept languages
- Computer Science
- 1990
The subsumption problem in logic-based knowledge representation languages of the KL-ONE family is investigated and it is shown that subsumption in this language is decidable, and sublanguages for which the problem of deciding subsumption is PSPACE-complete are investigated.
Computational Complexity of Terminological Reasoning in BACK
- Computer ScienceArtif. Intell.
- 1988
Subsumption Algorithms for Concept Description Languages
- Computer ScienceECAI
- 1990
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 Complexity of Existential Quantification in Concept Languages
- Linguistics, Computer ScienceArtif. Intell.
- 1992
KRIS: Knowledge Representation and Inference System
- Computer ScienceSGAR
- 1991
It turned out that almost all implemented KL-ONE systems such as BACK, KL-TWO, LOOM, NIKL, SB-ONE use sound but incomplete algorithms.
Krypton: A Functional Approach to Knowledge Representation
- Computer ScienceComputer
- 1983
The authors have developed a design strategy for avoiding these types of problems and have implemented a representation system based on it, called Krypton, which clearly distinguishes between definitional and factual information.
A Feature Logic with Subsorts
- Computer ScienceLILOG-Report
- 1988
A model theoretic open world semantics and it is shown that sorted feature structures constitute a canon-ical model, that is, without loss of generality subsumption and consistency of set descriptions can be considered with respect to feature structures only.