(Enter summary)
Abstract: can be useful for a variety of applications, including program transformation,
granularity control during parallel execution, and query optimization in deductive
databases. Most of the work to date on compile-time cost estimation of logic programs
has focused on the estimation of upper bounds on costs. However, in many
applications, such as parallel implementations on distributed-memory machines, one
would prefer to work with lower bounds instead. The problem with estimating lower
bounds is... (Update)
Cited by: More
Estimating the Computational Cost of Logic Programs - Debray, Garcia.. (1994)
(Correct)
Non-failure Analysis and Granularity Control in Parallel.. - Garcia (2000)
(Correct)
Some Techniques for Automated, Resource-Aware.. - Hermenegildo..
(Correct)
Similar documents (at the sentence level):
51.1%: Lower Bound Cost Estimation for Logic Programs - Debray, García.. (1997)
(Correct)
Active bibliography (related documents): More All
0.4: Cost Analysis of Logic Programs - Debray (1993)
(Correct)
0.4: A Methodology for Granularity Based Control of.. - Lopez, Hermenegildo.. (1996)
(Correct)
0.2: Task Granularity Analysis in Logic Programs - Saumya Debray Nai-Wei (1990)
(Correct)
Similar documents based on text: More All
0.4: Non-Failure Analysis for Logic Programs - Debray.. (1997)
(Correct)
0.3: Detection And Optimization Of Suspension-Free Logic Programs - Debray, Gudeman, Bigot (1996)
(Correct)
0.3: Profile-Guided Context-Sensitive Program Analysis - Debray
(Correct)
Related documents from co-citation: More All
9: ACM Transactions on Programming Languages and Systems (context) - Debray, Warren et al. - 1989
9: Task Granularity Analysis in Logic Programs
- Debray, Lin et al. - 1990
5: Non-failure analysis of logic programs
- Debray, Lopez-Garcia et al. - 1997
BibTeX entry: (Update)
S. K. Debray, P. Lopez-Garca, and M. V. Hermenegildo. Lower Bound Cost Estimation for Logic Programs. In J. Mal/uszynski, editor, Logic Programming: Proceedings of the 1997 International Symposium, pages 291--306. The MIT Press, 1997. http://citeseer.ist.psu.edu/debray97lower.html More
@techreport{ debray94lower,
author = "S. K. Debray and P. L\'{o}pez Garc\'{\i}a and M. Hermenegildo and N.-W. Lin",
title = "{L}ower {B}ound {C}ost {E}stimation for {L}ogic {P}rograms",
address = "Facultad Inform\'atica UPM, 28660-Boadilla del Monte, Madrid-Spain",
year = "1994",
url = "citeseer.ist.psu.edu/debray97lower.html" }
Citations (may not include all citations):
773
Reducibility among Combinatorial Problems (context) - Karp - 1972
82
ACM Transactions on Programming Languages and Systems (context) - Debray, Lin et al. - 1993
42
Task Granularity Analysis in Logic Programs
- Debray, Lin et al. - 1990
38
Generalized Semantics and Abstract Interpretation for Constr..
- Giacobazzi, Debray et al. - 1995
37
Inferring Argument Size Relationships with CLP
- Benoy, King - 1996
27
Non-Failure Analysis for Logic Programs
- Debray, opez et al. - 1997
27
The CIAO Multi-Dialect Compiler and System: An Experimentati..
- Hermenegildo, Bueno et al. - 1995
10
Using Run-Time List Sizes to Guide Parallel Thread Creation (context) - Huelsbergen, Larus et al. - 1994
9
inductive assertion synthesis (context) - Jones, Muchnick et al. - 1981
7
Static estimation of query sizes in horn programs (context) - Debray, Lin - 1990
7
Using Complexity Functions to Control Parallelism in Functio.. (context) - Rabhi, Manson - 1990
7
Algorithmic Complexity of Logic Programs (context) - Kaplan - 1988
7
A Methodology for Granularity Based Control of Parallelism i.. (context) - opez, Hermenegildo et al. - 1996
2
Nineteenth International Workshop on Graph-Theoretic Concept.. (context) - Lin, Chromatic et al. - 1993
1
IEEE Symposium on Logic in Computer Science (context) - Basin, Ganzinger et al. - 1996
1
Towards an Ecient Compile-Time Granularity Analysis Algorith.. (context) - Zhong, Tick et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://clip.dia.fi.upm.es/clippubsbyyear/node8.html): More
An Algebraic Approach to Sharing Analysis of Logic Programs - Codish, Lagoon, Bueno (1997)
(Correct)
Exploiting Goal Independence in the Analysis of Logic.. - Codish, Bruynooghe.. (1997)
(Correct)
Some Challenges for Constraint Programming - Hermenegildo (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC