A scheme for integrating concrete domains into concept languages

摘要: A drawback which concept languages based on KL-ONE have is that all the terminological knowledge has to be defined an abstract logical level. In many applications, one would like able refer concrete domains and predicates these when defining concepts. Examples for such are integers, real numbers, or also non-arithmetic domains, could equality, inequality, more complex predicates. present paper we shall propose a scheme integrating into rather than describing particular extension by some specific domain. We define assertional language, consider important inference problems as subsumption, instantiation, consistency. The formal semantics well reasoning algorithms given contrast existing systems, will not only sound but complete. They generate subtasks solved special purpose reasoner of