We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
Recently, relaxation approaches have been successfully used for MAP inference on NLP problems. In this work we show how to extend the relaxation approach to marginal inference use...
This paper presents an algorithm for reverse engineering semantically sound object-oriented data models from programs written in weakly-typed languages like Cobol. Our inference i...
tor. In order to capture different data models at a time, an abstract algebraic approach based on nested attributes is taken. The presence of the list constructor calls for a new i...
Sven Hartmann, Sebastian Link, Klaus-Dieter Schewe
We study inference rules for multivalued dependencies in relational databases with null values (NMVDs). The definition of NMVDs is dependent on the underlying relation schema and ...