Search Results for author:
Found 1 papers, 0 papers with code
A Decidable Very Expressive Description Logic for Databases (Extended Version)
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.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
