We show how to deploy the CIFF System 4.0 for abductive logic programming with constraints in a number of applications, ranging from combinatorial applications to web management. W...
Paolo Mancarella, Fariba Sadri, Giacomo Terreni, F...
We propose a novel solution approach for polynomial programming problems with equality constraints. By means of a generic transformation, we show that solution schemes for the (ty...
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
Developers are often unaware of, or fail to respect, the intentions behind a design due to poor communication of design intent. SCL (Structural Constraint Language) helps develope...