Andreas Fordan

Learn More
During the evaluation of a constraint logic program, many local variables become inaccessible, or dead. In Prolog and other programming languages, the data bound to local variables can be removed automatically by garbage collection. The case of CLP is more complex, as the variables may be involved in several constraints. We can consider dead variables to be(More)
In most of the existing linear CLP systems, a projection is employed for the answer presentation in order to eliminate the dead variables not occuring in the query. But projection is more than an ornament of the answer presentation. We have shown that there are planning problems that depend heavily on an early projection. While it is not clear how to(More)
The problem of quantiier elimination, or projection, is to reduce the dimensions of a constraint to the desired ones without changing the solution set. Such a method is best known for linear dense domains. Systems like ECL i PS e and CLP(R) provide a projection module to eliminate the dead variables of the linear part of answers. But elimination can be more(More)
  • 1