24 search results - page 4 / 5 » slp 1997 |
SLP
1997
13 years 7 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
SLP
1993
13 years 7 months ago
1993
We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a sing...
SLP
1994
13 years 7 months ago
1994
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
SLP
1989
13 years 7 months ago
1989
Two main aspects of Partial Evaluation for Prolog programs are considered: treatment of cuts and control of recursion. The analysis about cut is exhaustive: we consider occurrence...
SLP
1989
13 years 7 months ago
1989
This paper describes a learning system, LASSY1, which explores domains represented by Prolog databases, and use its acquired knowledge to increase the efficiency of a Prolog inter...