Abstract
Languages for models of nested relations and complex objects have been attracting considerable attention recently. Some of these languages are algebraic, others are calculus based, some are logic programming oriented. This paper describes these languages and surveys recent results about the expressive power of these languages. The emphasis is on completeness issues. The expressive power of the languages is described in terms of the three common types of completeness: calculus-completeness, BP-completeness and CH-completeness.
Cite
CITATION STYLE
Abiteboul, S., Beeri, C., Gyssens, M., & Van Gucht, D. (1989). An introduction to the completeness of languages for complex objects and nested relations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 361 LNCS, pp. 117–138). Springer Verlag. https://doi.org/10.1007/3-540-51171-7_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
