We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
First-order probabilistic models are recognized as efficient frameworks to represent several realworld problems: they combine the expressive power of first-order logic, which serv...
We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It ...
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Two controllers which extend the PD+I fuzzy logic controller to deal with the plant having time varying nonlinear dynamics are proposed. The adaptation ability of the first self tu...