1. Agrawal, R., Borgida, A., & Jagadish, H.V. (1989). Efficient management of transitive relationships in large data and knowledge bases. In Clifford, J., Lindsay, B.G., & Maier, D. (Eds.) Proceedings of the ACM SIGMOD International Conference on Management of Data, (Vol. 18 pp. 253–262). Portland: ACM, SIGMOD Record. [Available online
http://dbs.informatik.uni-halle.de/Lehre/DBSIIaSS02/p253-agrawal.pdf
].
2. Aït-Kaci, H. (2007). Data models as constraint systems—a key to the Semantic Web. Constraint Processing Letters, 1, 33–88. [Available online
cs.brown.edu/people/pvh/CPL/Papers/v1/hak.pdf
].
3. Aït-Kaci, H. (2007). Description logic vs.order-sorted feature logic. In Calvanese, D., Franconi, E., Haarslev, V., Lembo, D., Motik, B., Turhan, A.-Y., & Tessaris, S. (Eds.) International Workshop on Description Logics (DL’07), (pp. 147–154). Brixen-Bressanone (Italy): CEUR Workshop Proceedings. [Available online
http://ceur-ws.org/Vol-250/paper2.pdf
] .
4. Aït-Kaci, H. (2013). Efficient encoding of very large partial orders—a specification. In
𝓒
𝓔
𝓓
𝓐
𝓡
$\mathcal {C}\mathcal {E}\mathcal {D}\mathcal {A}\mathcal {R}$
Technical Report Number 4,
𝓒
𝓔
𝓓
𝓐
𝓡
$\mathcal {C}\mathcal {E}\mathcal {D}\mathcal {A}\mathcal {R}$
Project, LIRIS, Département d’Informatique, Université Claude Bernard Lyon 1, Villeurbanne, France. [Available online
cedar.liris.cnrs.fr/papers/ctr4.pdf
].
5. Aït-Kaci, H. (2014).
ℋ
𝓞
𝓞
T
$\mathcal {H}\mathcal {O}\mathcal {O}\mathcal {T}$
: A language for expressing and querying hierarchical ontologies, objects, and types—a specification. In
𝓒
𝓔
𝓓
𝓐
𝓡
$\mathcal {C}\mathcal {E}\mathcal {D}\mathcal {A}\mathcal {R}$
Technical Report Number 16,
𝓒
𝓔
𝓓
𝓐
𝓡
$\mathcal {C}\mathcal {E}\mathcal {D}\mathcal {A}\mathcal {R}$
Project, LIRIS, Département d’Informatique, Université Claude Bernard Lyon 1, Villeurbanne, France. [Available online
cedar.liris.cnrs.fr/papers/ctr16.pdf
].