### Abstract

Information about the computational cost of programs is potentially useful for a variety of purposes, including selecting among different algorithms, guiding program transformations, in granularity control and mapping decisions in parallelizing compilers, and query optimization in deductive databases. Cost analysis of logic programs is complicated by nondeterminism: on the one hand, procedures can return multiple solutions, making it necessary to estimate the number of solutions in order to give nontrivial upper bound cost estimates; on the other hand, the possibility of failure has to be taken into account while estimating lower bounds. Here we discuss techniques to address these problems to some extent.

Original language | English (US) |
---|---|

Title of host publication | Static Analysis - 1st International Static Analysis Symposium, SAS '94, Proceedings |

Publisher | Springer Verlag |

Pages | 255-265 |

Number of pages | 11 |

Volume | 864 LNCS |

ISBN (Print) | 9783540584858 |

State | Published - 1994 |

Event | 1st International Static Analysis Symposium, SAS 1994 - Namur, Belgium Duration: Sep 28 1994 → Sep 30 1994 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 864 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 1st International Static Analysis Symposium, SAS 1994 |
---|---|

Country | Belgium |

City | Namur |

Period | 9/28/94 → 9/30/94 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Static Analysis - 1st International Static Analysis Symposium, SAS '94, Proceedings*(Vol. 864 LNCS, pp. 255-265). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 864 LNCS). Springer Verlag.

**Estimating the computational cost of logic programs.** / Debray, Saumya K; López Garćia, P.; Hermenegildo, M.; Lin, N. W.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Static Analysis - 1st International Static Analysis Symposium, SAS '94, Proceedings.*vol. 864 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 864 LNCS, Springer Verlag, pp. 255-265, 1st International Static Analysis Symposium, SAS 1994, Namur, Belgium, 9/28/94.

}

TY - GEN

T1 - Estimating the computational cost of logic programs

AU - Debray, Saumya K

AU - López Garćia, P.

AU - Hermenegildo, M.

AU - Lin, N. W.

PY - 1994

Y1 - 1994

N2 - Information about the computational cost of programs is potentially useful for a variety of purposes, including selecting among different algorithms, guiding program transformations, in granularity control and mapping decisions in parallelizing compilers, and query optimization in deductive databases. Cost analysis of logic programs is complicated by nondeterminism: on the one hand, procedures can return multiple solutions, making it necessary to estimate the number of solutions in order to give nontrivial upper bound cost estimates; on the other hand, the possibility of failure has to be taken into account while estimating lower bounds. Here we discuss techniques to address these problems to some extent.

AB - Information about the computational cost of programs is potentially useful for a variety of purposes, including selecting among different algorithms, guiding program transformations, in granularity control and mapping decisions in parallelizing compilers, and query optimization in deductive databases. Cost analysis of logic programs is complicated by nondeterminism: on the one hand, procedures can return multiple solutions, making it necessary to estimate the number of solutions in order to give nontrivial upper bound cost estimates; on the other hand, the possibility of failure has to be taken into account while estimating lower bounds. Here we discuss techniques to address these problems to some extent.

UR - http://www.scopus.com/inward/record.url?scp=0010734404&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0010734404&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9783540584858

VL - 864 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 255

EP - 265

BT - Static Analysis - 1st International Static Analysis Symposium, SAS '94, Proceedings

PB - Springer Verlag

ER -