Estimating the computational cost of logic programs

Saumya K Debray, P. López Garćia, M. Hermenegildo, N. W. Lin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

22 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationStatic Analysis - 1st International Static Analysis Symposium, SAS '94, Proceedings
PublisherSpringer Verlag
Pages255-265
Number of pages11
Volume864 LNCS
ISBN (Print)9783540584858
StatePublished - 1994
Event1st International Static Analysis Symposium, SAS 1994 - Namur, Belgium
Duration: Sep 28 1994Sep 30 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume864 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Static Analysis Symposium, SAS 1994
CountryBelgium
CityNamur
Period9/28/949/30/94

Fingerprint

Logic Programs
Computational Cost
Parallelizing Compilers
Deductive Databases
Compiler Optimization
Cost Analysis
Query Optimization
Program Transformation
Nondeterminism
Number of Solutions
Multiple Solutions
Granularity
Estimate
Costs
Lower bound
Upper bound
Necessary

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Debray, S. K., López Garćia, P., Hermenegildo, M., & Lin, N. W. (1994). Estimating the computational cost of logic programs. In 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.

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Debray, SK, López Garćia, P, Hermenegildo, M & Lin, NW 1994, Estimating the computational cost of logic programs. in 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.
Debray SK, López Garćia P, Hermenegildo M, Lin NW. Estimating the computational cost of logic programs. In Static Analysis - 1st International Static Analysis Symposium, SAS '94, Proceedings. Vol. 864 LNCS. Springer Verlag. 1994. p. 255-265. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Debray, Saumya K ; López Garćia, P. ; Hermenegildo, M. ; Lin, N. W. / Estimating the computational cost of logic programs. Static Analysis - 1st International Static Analysis Symposium, SAS '94, Proceedings. Vol. 864 LNCS Springer Verlag, 1994. pp. 255-265 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4c15cebfd9e749fb8dc0b28771d9dfef,
title = "Estimating the computational cost of logic programs",
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.",
author = "Debray, {Saumya K} and {L{\'o}pez Garćia}, P. and M. Hermenegildo and Lin, {N. W.}",
year = "1994",
language = "English (US)",
isbn = "9783540584858",
volume = "864 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "255--265",
booktitle = "Static Analysis - 1st International Static Analysis Symposium, SAS '94, Proceedings",
address = "Germany",

}

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 -