We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...
Abstract. A logic-based language is often adopted in systems for pervasive computing, because it provides a convenient way to define rules that change the behavior of the systems d...
Aspect-oriented software development (AOSD) techniques support systematic modularization and composition of crosscutting concerns. Though AOSD techniques have been proposed to han...
Abstract. We present a theorem proving environment for the development of reliable and efficient group communication systems. Our approach makes methods of automated deduction appl...
We demonstrate a method for describing data-flow analyses based program optimizations as compositional type systems with a transformation component. Analysis results are presented...