Sciweavers

241 search results - page 43 / 49
» Bounded Nondeterminism of Logic Programs
Sort
View
VAMOS
2008
Springer
13 years 9 months ago
How complex is my Product Line? The case for Variation Point Metrics
Software Product Lines aim at capturing the variability and commonality of a family of related programs that share a common set of assets. Variation points capture variability on ...
Roberto E. Lopez-Herrejon, Salvador Trujillo
ICALP
2010
Springer
13 years 9 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
ICLP
1989
Springer
13 years 11 months ago
A Simple Code Improvement Scheme for Prolog
The generation of efficient code for Prolog programs requires sophisticated code transformation and optimization systems. Much of the recent work in this area has focussed on hig...
Saumya K. Debray
DAC
2012
ACM
11 years 10 months ago
A metric for layout-friendly microarchitecture optimization in high-level synthesis
In this work we address the problem of managing interconnect timing in high-level synthesis by generating a layoutfriendly microarchitecture. A metric called spreading score is pr...
Jason Cong, Bin Liu
DAGSTUHL
1996
13 years 9 months 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