EL-Concepts go Second-Order: Greatest Fixpoints and Simulation Quantifiers
EL-Concepts go Second-Order: Greatest Fixpoints and Simulation Quantifiers
复制标题
EL 概念进入二阶:最大固定点和模拟量词
DOI:
--
复制
发表时间:
2010
期刊:
影响因子:
--
通讯作者:
F. Wolter
中科院分区:
文献类型:
--
作者:
C. Lutz;R. Piro;F. Wolter
The well-known description logic (DL) ALC is usually regarded as the basic DL that comprises all Boolean concept constructors and from which all expressive DLs are derived by admitting additional concept constructors. The fundamental role of ALC is largely due to the fact that it is very well-behaved regarding its logical, model-theoretic, and computational properties. This good behavior can, in turn, be explained nicely by the fact that ALC-concepts can be characterized exactly as the bisimulation invariant fragment of first-order logic (FO) in the sense that an FO formula is invariant under bisimulation if, and only if, it is equivalent to an ALC-concept [22, 13, 16]. In particular, invariance under bisimulation explains the tree-model property of ALC as well as its favorable computational properties [24]. In the mentioned characterization, the condition thatALC is a fragment of FO is much less important than its bisimulation invariance. In fact, ALCμ, the extension of ALC with fixpoint operators, is not a fragment of FO, but inherits almost all important properties of ALC [8, 12]. Similar to ALC, ALCμ’s fundamental role (in particular in its formulation as the modal mu-calculus) can be explained by the fact that ALCμ-concepts can be characterized exactly as the bisimulation invariant fragment of monadic second-order logic (MSO) [14, 8]. Indeed, from a purely theoretical viewpoint it is hard to explain why ALC rather than ALCμ forms the logical underpinning of current ontology language standards; the facts that mu-calculus concepts can be hard to grasp and that, despite the same theoretical complexity, efficient reasoning in ALCμ is more challenging than in ALC are probably the only reasons for the limited interest in ALCμ compared to ALC. In recent years, the development of very large ontologies and the use of ontologies to access instance data has led to a revival of interest in tractable DLs. The main examples are EL [5] and DL-Lite [9], the logical underpinnings of the OWL profiles OWL2 EL and OWL2 QL, respectively. In contrast to ALC, a satisfactory characterization of the expressivity of such DLs is still missing, and a first aim of this paper is to fill this gap for EL. To this end, we characterize EL as a maximal fragment of FO that is preserved under simulations and has finite minimal models. Note that preservation under simulations alone would characterize EL with disjunctions, and the existence of minimal models reflects the “Horn-aspect” of EL. The second and main aim of this paper, however, is to introduce and investigate two equi-expressive extensions of EL with greatest fixpoints, EL and EL, and to Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, 2010.
DOI:
--
发表时间:
2010
期刊:
--
影响因子:
--
作者:
Boris Konev
通讯作者:
Boris Konev