On the Integration of Recursive ALN-Theories

@inproceedings{Vitria2000OnTI,
  title={On the Integration of Recursive ALN-Theories},
  author={Aida Vit{\'o}ria and Margarida Mamede},
  booktitle={Canadian Conference on AI},
  year={2000}
}
In this paper we focus on the problem of integrating knowledge bases expressed in a description logic. To this end, we propose three basic operations: union, intersection and renaming. First, the semantics of these compositional operations is studied abstracting away from implementation details. Then, we present an implementation of the proposed operations, for knowledge bases expressed in the language ALN extended with recursive definitions of concepts, which transforms compositions of… 

References

SHOWING 1-10 OF 14 REFERENCES

The Complexity of Concept Languages

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.

Terminological Cycles in KL-ONE-based Knowledge Representation Languages

For this language, the effect of the three types of semantics introduced by (Nebel 1987,1989,1989a) can be completely described with the help of finite automata and provide an intuitive understanding of terminologies with cyclic definitions and insight into the essential features of the respective semantics.

Unification of Concept Terms in Description Logics

This work shows that this inference problem for description logics is of interest for applications, and presents first decidability and complexity results for a small concept description language.

Matching in Description Logics: Preliminary Results

A new approach to performing matching is proposed, based on a "concept-centered" normal form, rather than the more standard “structural subsumption” normal form for concepts, so that matching can be performed (in polynomial time) using arbitrary concept patterns of the description language FL¬, thus removing restrictions from previous work.

Computing the Least Common Subsumer and the Most Specific Concept in the Presence of Cyclic ALN-Concept Descriptions

This paper extends the notions lcs and msc to cyclic descriptions, and shows how they can be computed, based on the automata-theoretic characterizations of fixed-point semantics for cyclic terminologies developed in previous papers.

Composing General Logic Programs

It is shown how the introduction of a basic set of (meta-level) composition operations over general programs increases the knowledge representation capabilities of logic programming for non-monotonic reasoning.

Modular logic programming

The modular framework defined here for logic programming consists of a small number of operations over modules which are (meta-) logically defined and semantically justified in terms of the basic logic programming semantics.

Description Logic Framework for Information Integration

This work presents a novel approach to conceptual modeling for Information Integration, which allows for suitably modeling the global concepts of the application, the individual information sources, and the constraints among different sources.

Reasoning and Revision in Hybrid Representation Systems

  • B. Nebel
  • Philosophy
    Lecture Notes in Computer Science
  • 1990
The universal term-forming formalism is a hybrid representation formalism that combines terminological cycles, representation and management of knowledge, and reasoning in the formalism.

Characterizing the Semantics of Terminological Cycles in ALN Using Finite Automata

Photodetector, which "looks" for reflections along the viewing plane, has its output signal coordinately gated in such a manner that the level of such signal is directly interpretable to indicate the distance of a reflecting surface from the datum plane, as well as the side of such plane on which the surface is located.