Abstract Constraint Logic Programming (CLP) is one of the most successful branches of
Logic Programming; it attracts the interest of theoreticians and practitioners, and it is …

We present cTI, the first system for universal left-termination inference of logic programs.
Termination inference generalizes termination analysis and checking. Traditionally, a …

Shadow mapping has been a popular way of generating shadows in real-time applications,
but it is still incapable of generating realistic real time soft shadows for area light. There is an …

It is well known that freeness and linearity information positively interact with aliasing
information, allowing both the precision and the efficiency of the sharing analysis of logic …

For programming languages based on logic, a knowledge of variable sharing is important;
for instance, for their automatic parallelization and for many optimisations of the unification …

Logic languages based on the theory of rational, possibly infinite, trees have much appeal in
that rational trees allow for faster unification (due to the safe omission of the occurs-check) …

Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and
Oz, offer a computation domain including rational trees that allow for increased expressivity …

In order to find a more tractable and practical architecture for high-performance routers
within current technology and market constraints, the High-Performance Networking Group …

Recientemente, esta revista ha publicado una excelente monografıa,[65], dedicada a los
problemas de satisfacción con restricciones. La monografıa cubre muchos de los aspectos …

Abstract Knowledge representation and automated reasoning are two of the pillars of
Artificial Intelligence but, differently from other pillars, they are strictly intertwined. Depending …