We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
By managing network resources at compile time, the compiled communication technique greatly improves the communication performance for communication patterns that are known at com...
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
Tina Dell'Armi, Wolfgang Faber, Giuseppe Ielpa, Ni...
In the past decade, moving horizon estimation (MHE) has emerged as a powerful technique for estimating the state of a dynamical system in the presence of nonlinearities and disturb...
Angelo Alessandri, Marco Baglietto, Giorgio Battis...