TY - JOUR
T1 - Adding the power-set to description logics
AU - Giordano, Laura
AU - Policriti, Alberto
N1 - Publisher Copyright:
© 2019 Elsevier B.V.
PY - 2020/4/12
Y1 - 2020/4/12
N2 - We explore the relationships between Description Logics and Set Theory. The study is carried on using, on the set-theoretic side, a very rudimentary axiomatic set theory Ω, consisting of only four axioms characterizing binary union, set difference, inclusion, and the power-set. An extension of ALC, dubbed ALCΩ, is defined in which concepts are naturally interpreted as sets living in Ω-models. In ALCΩ not only membership between concepts is allowed—even admitting membership circularity—but also the power-set construct is exploited to add metamodelling capabilities. We investigate translations of ALCΩ into standard description logics as well as a set-theoretic translation. A polynomial encoding of ALCΩ in ALCOI proves the validity of the finite model property as well as an EXPTIME upper bound on the complexity of concept satisfiability. We develop a set-theoretic translation of ALCΩ in the theory Ω, exploiting a technique proposed for translating normal modal and polymodal logics into Ω. Finally, we show that the fragment LCΩ of ALCΩ not admitting roles and individual names, is as expressive as ALCΩ.
AB - We explore the relationships between Description Logics and Set Theory. The study is carried on using, on the set-theoretic side, a very rudimentary axiomatic set theory Ω, consisting of only four axioms characterizing binary union, set difference, inclusion, and the power-set. An extension of ALC, dubbed ALCΩ, is defined in which concepts are naturally interpreted as sets living in Ω-models. In ALCΩ not only membership between concepts is allowed—even admitting membership circularity—but also the power-set construct is exploited to add metamodelling capabilities. We investigate translations of ALCΩ into standard description logics as well as a set-theoretic translation. A polynomial encoding of ALCΩ in ALCOI proves the validity of the finite model property as well as an EXPTIME upper bound on the complexity of concept satisfiability. We develop a set-theoretic translation of ALCΩ in the theory Ω, exploiting a technique proposed for translating normal modal and polymodal logics into Ω. Finally, we show that the fragment LCΩ of ALCΩ not admitting roles and individual names, is as expressive as ALCΩ.
KW - Description logic
KW - Knowledge representation
KW - Set theory
UR - http://www.scopus.com/inward/record.url?scp=85075869052&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2019.10.049
DO - 10.1016/j.tcs.2019.10.049
M3 - Article
SN - 0304-3975
VL - 813
SP - 155
EP - 174
JO - Theoretical Computer Science
JF - Theoretical Computer Science
ER -