Abstract
Data reification normally involves the explicit positing of an abstraction function with certain properties. However, the condition for one definition to reify another only requires that a function with such properties should exist. This suggests that it may be possible to carry through a data reification without giving an explicit definition of the abstraction function at all. This paper explores this possibility and compares it with the more conventional approach.
Cite
CITATION STYLE
Clement, T. (1996). Data reification without explicit abstraction functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1051, pp. 195–213). Springer Verlag. https://doi.org/10.1007/3-540-60973-3_88
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
