192 search results - page 17 / 39 » Using Call Exit Analysis for Logic Program Transformation |
LOPSTR
2004
Springer
15 years 5 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
121
click to vote
CORR
2002
Springer
14 years 11 months ago
2002
Springer
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalu...
123
click to vote
CEC
2011
IEEE
13 years 11 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
111
click to vote
PPDP
2010
Springer
14 years 9 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
126
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...