Let S be a set system of convex sets in Rd . Helly’s theorem states that if all sets in S have empty intersection, then there is a subset S′ ⊂ S of size d+1 which also has e...
We address a problem of updating XML documents having their XML schema described by a Document Type Definition (DTD) without breaking their validity. We present a way how to expre...
Rough set theory can be applied to rule induction. There are two different types of classification rules, positive and boundary rules, leading to different decisions and consequen...
Types are a good starting point for various software reengineering tasks. Unfortunately, programs requiring reengineering most desperately are written in languages without an adeq...
In network applications it is crucial to have a mechanism to guarantee that communications evolve correctly according to the agreed protocol. Session types offer a method for abstr...
Lorenzo Bettini, Sara Capecchi, Mariangiola Dezani...