Software maintenance and evolution can be made easier if program comprehension techniques are used. Understanding a software system would typically necessitate a combination of st...
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
Abstract. Several mathematical frameworks for static analysis of programs have been developed in the past decades. Although these tools are quite useful, they have still many limit...
Abstract. In order to extend the application domain of natural language interfaces to more realistic tasks without the decrease of user’s performance, it is desirable for users t...
The chemical reaction metaphor describes computation in terms of a chemical solution in which molecules interact freely according to reaction rules. Chemical solutions are represen...