Abstract
This paper presents a technique called generic composition to provide a neat basis for different kinds of semantic compositions and various higher-order healt hiness conditions appearing in a variety of semantic theories. The weak inverse of generic composition is defined. A completeness theorem shows that any predicate can be written in terms of generic composition and its weak inverse, and a number of algebraic laws are given to support reasoning. © Springer-Verlag Berlin Heidelberg 2000.
Cite
CITATION STYLE
Chen, Y. (2000). How to write a healthiness condition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1945 LNCS, pp. 299–317). Springer Verlag. https://doi.org/10.1007/3-540-40911-4_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
