Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
The DEGAS project aims at enriching standard UML-centred development environments in such a way that the developers of global applications can exploit automated formal analyses wit...
Mikael Buchholtz, Carlo Montangero, Lara Perrone, ...
Although sorts and unary predicates are semantically identical in order-sorted logic, they are classified as different kinds of properties in formal ontology (e.g. sortal and non...
Overcoming the disadvantages of equidistant discretization of continuous actions, we introduce an approach that separates time into slices of varying length bordered by certain ev...
Abstract. Using mathematical morphology on formulas introduced recently by Bloch and Lang (Proceedings of IPMU’2000) we define two new explanatory relations. Their logical behav...