A Decidable Very Expressive Description Logic for Databases

@inproceedings{Artale2017ADV,
  title={A Decidable Very Expressive Description Logic for Databases},
  author={Alessandro Artale and Enrico Franconi and Rafael Pe{\~n}aloza and Francesco Sportelli},
  booktitle={International Semantic Web Conference},
  year={2017}
}
  • Alessandro Artale, Enrico Franconi, +1 author Francesco Sportelli
  • Published in
    International Semantic Web…
    2017
  • Computer Science
  • We introduce \(\mathcal{DLR}^+\), an extension of the n-ary propositionally closed description logic \(\mathcal{DLR}\) to deal with attribute-labelled tuples (generalising the positional notation), projections of relations, and global and local objectification of relations, able to express inclusion, functional, key, and external uniqueness dependencies. The logic is equipped with both TBox and ABox axioms. We show how a simple syntactic restriction on the appearance of projections sharing… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-4 OF 4 CITATIONS

    Evidence-based lean logic profiles for conceptual data modelling languages

    VIEW 12 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Temporally Attributed Description Logics

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    Connecting Databases and Ontologies: A Data Quality Perspective

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 17 REFERENCES

    Elements of Relational Database Theory

    • Paris C. Kanellakis
    • Computer Science
    • Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
    • 1990