Characterizing the Semantics of Terminological Cycles in ALN Using Finite Automata

Apparatus designed to measure, within a selectively variable defined range, the distance of an object's surface from opposite sides of a predetermined datum plane. The apparatus includes two pairs of light sources which are disposed on one side of the datum plane, and on opposite sides of a reflection viewing plane which is normal to the datum plane. In each source pair, the two sources are energized alternately to create, on opposite sides of the datum plane, and with regard to the viewing plane, alternate upper and lower preferential illumination zones. A 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.

[1]  Diego Calvanese Reasoning with Inclusion Axioms in Description Logics: Algorithms and Complexity , 1996, ECAI.

[2]  Franz Baader,et al.  Terminological Cycles in KL-ONE-based Knowledge Representation Languages , 1990, AAAI.

[3]  Alexander Borgida,et al.  Description Logics in Data Management , 1995, IEEE Trans. Knowl. Data Eng..

[4]  Bernhard Nebel,et al.  Terminological Cycles: Semantics and Computational Properties , 1991, Principles of Semantic Networks.

[5]  Maurizio Lenzerini,et al.  Concept Language with Number Restrictions and Fixpoints, and its Relationship with Mu-calculus , 1994, ECAI.

[6]  W. Nutt,et al.  Subsumption algorithms for concept languages , 1990 .

[7]  Bernhard Nebel,et al.  Terminological Reasoning is Inherently Intractable , 1990, Artif. Intell..

[8]  Bernhard Nebel,et al.  Reasoning and Revision in Hybrid Representation Systems , 1990, Lecture Notes in Computer Science.

[9]  Sonia Bergamaschi,et al.  On taxonomic reasoning in conceptual design , 1992, TODS.

[10]  Klaus Schild,et al.  Terminological Cycles and the Propositional µ-Calculus , 1994, KR.

[11]  Fausto Giunchiglia,et al.  A SAT-based Decision Procedure for ALC , 1996, KR.

[12]  Diego Calvanese,et al.  A Unified Framework for Class-Based Representation Formalisms , 1994, KR.

[13]  Franz Baader,et al.  A Formal Definition for the Expressive Power of Terminological Knowledge Representation Languages , 1996, J. Log. Comput..

[14]  H. Aït-Kaci A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification) , 1984 .

[15]  Robert M. MacGregor What's Needed to Make a Description Logic a Good KR Citizen? , 1992, Description Logics.