Sciweavers

6 search results - page 1 / 2
» Preserving Termination of Tabled Logic Programs While Unfold...
Sort
View
LOPSTR
1997
Springer
14 years 3 months ago
Preserving Termination of Tabled Logic Programs While Unfolding
Michael Leuschel, Bern Martens, Konstantinos F. Sa...
PPDP
2007
Springer
14 years 5 months ago
Unfolding in CHR
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
Paolo Tacchella, Maurizio Gabbrielli, Maria Chiara...
WLP
1997
Springer
14 years 3 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
JELIA
2010
Springer
13 years 8 months ago
Tabling with Answer Subsumption: Implementation, Applications and Performance
Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the t...
Terrance Swift, David Scott Warren
DAGSTUHL
1996
14 years 6 days ago
Global Control for Partial Deduction through Characteristic Atoms and Global Trees
Recently, considerable advances have been made in the (on-line) control of logic program specialisation. A clear conceptual distinction has been established between local and glob...
Michael Leuschel, Bern Martens