Adding the power-set to description logics
Theoretical Computer Science, ISSN: 0304-3975, Vol: 813, Page: 155-174
2020
- 3Citations
- 2Captures
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Article Description
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Ω.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0304397519306991; http://dx.doi.org/10.1016/j.tcs.2019.10.049; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85075869052&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S0304397519306991; https://dx.doi.org/10.1016/j.tcs.2019.10.049
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know