article

Open access

Cost analysis of logic programs

Authors:

Saumya K. Debray,

Nai-Wei LinAuthors Info & Claims

ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 15, Issue 5

Pages 826 - 875

https://doi.org/10.1145/161468.161472

Published: 01 November 1993 Publication History

PDF eReader

References

[1]

BOND~, J.A.1969. Bounds for the chromatic number of a graph, J. Combinatorlal Theor. 7, 96 98.]]

Google Scholar

[2]

CARLSSON, M., ~o WIDEN. J. 1988. SICStus Prolog User's Manual. Swedish Institute of Computer Science, Kista, Sweden.]]

Google Scholar

[3]

CHANG, J., DESPAIN, A. M., AND DEGRoo% D. 1985. AND-paral}elism of logic programs based on a static data dependency analysis. In Digest of Papers, Compcon 85, IEEE Computer Society, New York, Feb.]]

Google Scholar

[4]

CHAR, B., GEDDES, K., GONNE% G., MONAO^N, M., ~n WATT, S. 1988. MAPLE: Reference Manual. Univ. of Waterloo.]]

Google Scholar

[5]

COHEN, J., ~3~D KSTCO~F, J. 1977. Symbolic solution of finite-difference equations. ACM Trans. Math. Softw. 3, 3 (Sept.), 261 271.]]

Crossref

Google Scholar

[6]

DARLINGTON, J. 1982. Program transformation. In Funct~onal Programm~ng and Its Applica-tions, J. Darlington, P. Henderson, and D. Turner, Eds. Cambridge University Press.]]

Google Scholar

[7]

DE~~, S.K. 1989. Static inference of modes and data dependencies in logic programs. ACM Trans. Program. Lang. Syst. 11, 3 (July), 419 450.]]

Crossref

Google Scholar

[8]

DE}BRAY, S. K., AND WARREN, D. S. 1989. Functional computations in log}c programs. ACM Trans. Program. Lang. Syst. 11, 3 (July), 451-481.]]

Crossref

Google Scholar

[9]

~DEBRAY, S K., LIN, N., AND HERMENEGILDO, M. 1990. Task granulanty analysis in }ogic programs. In Proceedzng~s of the ACM SIGPLAN'90 Conference on Pro~~rammzng Language Design and Irnplementatzon (June), 174 188]]

Crossref

Google Scholar

[10]

DEBRAY, S K., AND LIN, N. 1990. Static estimation of query sizes m Horn programs. In Proceedzngs of the Thlrd International Conferenee on Database Theor~ {Paris, Dec.), 514-528.]]

Crossref

Google Scholar

[11]

FLAJOLET, P., SALVY, B., AND ZiMMERMANN, P. 1991. Automatic average-case analysis of algorithms. Theor. Corrzput. Ste. 79, 37 109.]]

Crossref

Google Scholar

[12]

HEINTZg, N., AND JAFF^R, J 1990. A finite presentation theorem fbr approximating logic prog~-ams In Proceed~ngs of the ACM Symposlum on Prznc~ples of Programmzng Languages (San Francises, Jan.), 197-209.]]

Crossref

Google Scholar

[13]

HERMENEGILDO, M. V., AND GREENE, K. J 1990. &-Prolog and ~ts performance: Exploitmg independent and-parallelism. In Proceedzr~gs of the Seve, th International Conference on Logzc Programmtng (Jerusalem), MIT Press, Cambridge, Mass., 253-270.]]

Crossref

Google Scholar

[14]

HICK~Y, T., AND COHEN, J 1988. Automatmg program analyms J. ACM 35, i (Jan), 185-220.]]

Crossref

Google Scholar

[15]

IwE, J. 1978. Some MACSYMA programs for so}ving recurrenee relations. ACM Trans. Math Softw. 4, 1 (March), 24-33.]]

Crossref

Google Scholar

[16]

I4~L~, L V, 1985. Parallel architectures for problem solving, Ph D. d~ssertation, SUNY, Stony Brook.]]

Google Scholar

[17]

KAPLAN, S 1988. Algorithmm complexity of logm programs. In Logzc Programming, Proceedings of the Fz/~h Internatzona{ Con/erence and Symposlum (Seattle, Wash.), 780-793.]]

Google Scholar

[18]

KARP, R.M. 1972. Reducibility among combinatorial problems. In Complexzty of Computer ComputatLons, R. E. Mil}er and J. W Thatcher, Eds., Plenum Press, New York, 85 103]]

Google Scholar

[19]

KNU%q, D.E. 1975. Estimating the efficiency of backtracking programs. Math. Comput. 29, 121-136.]]

Google Scholar

[20]

LE M~TAYER, D. 1988. ACE: An automatic complexJty evaluator. ACM Trans. Program. Lang. Syst. 10, 2 (April), 248-266]]

Crossref

Google Scholar

[21]

LEE, R C. T, CHa'~~, C. L., AND WALD~NGE~, R.J. 1974. An nnproved program-synthesizing algorithm and lts correctness, Commun. ACM 17, 4 (April), 211-217]]

Crossref

Google Scholar

[22]

LIN, N. 1991. Approximating the chromatic polynomml of a graph. Tech Rep. 91-5, Dept of Computer Science, Umv. of Arizona, Tucson, Feb.]]

Google Scholar

[23]

LIN, N. 1992. Estimating the number of solutions for constramt satisfaction problems. Tech. Rep. 92-14. Dept. of Computer Science, Umv. of Arizona, Tucson, March]]

Google Scholar

[24]

LIPTON, R., AND NAUGHTON, J. 1990. Query size estimation by adaptive sampling. In Proceedzngs of the Ninth ACM Sympos~ura on Pr~nciples of Datctbase Systems, April.]]

Crossref

Google Scholar

[25]

MAHER, M, AND RAMAKRISHNAN, R. 1989. D~j~ vu in fixpomts of logic progTams In Proceedinos of the North Amerzcan Conference on Logic Programming (Cleveland, Oh.), 963-980]]

Google Scholar

[26]

MANNA, Z. AND WALDINGER, R J. 1971. Toward automatie program synthesm. Commun. ACM 14, 3 (Match), 151-164]]

Crossref

Google Scholar

[27]

MELHSH, C.S. 1985. Some global opt~mizations for a Prolog compiler. J. Loglc Prograra. 2, 1 (Apnl), 43-66]]

Google Scholar

[28]

MISHRA, P. 1984. Toward a theory of types m Prolog. In Proceedtrzgs of the 1984 IEEE Sympoaum on Log~c Programmzng (Atlantlc City, N.J.) IEEE, New York, 289 298.]]

Google Scholar

[29]

M~NTANARI, U. 1974. Networks of constrmnts: Fundamental propertms and applications to picture processing. Infi Sc~. 7, 95-132.]]

Google Scholar

[30]

PgTKOVSEK, M. 1991. Finding closed-form solutions of'difference equatlons by symbohc methods. Ph.D. dissertation, SchooI of Computer Science, Carnegie Mellon Univ.]]

Crossref

Google Scholar

[31]

PL~MER, L. 1990. Termination proofs of logic programs. LNCS 446, Springer-Verlag, Berlin, (in German).]]

Google Scholar

[32]

PURDOM, P.W. 1978. Tree s~ze by partial backtrackmg. SIAM J. Comput. 7, 481 491.]]

Google Scholar

[33]

R~MSHAW, L.H. 1979. Formalizing the analysis of algorithms. Rep. SL-79-5, Xerox Pals Alto Research Center, Pals Alto, Cahf.]]

Google Scholar

[34]

RABHr, F. A, AND MANSON, G.A. 1990. Using complexity functions to control parallelism in functmnal programs. Res. Rep CS-90-1, Dept of Computer Science, Univ. of Sheffield, England, Jan.]]

Google Scholar

[35]

~PYO, C., AND REDDY, U.S. 1989. Inference of polymorphic types for logic programs. In Proceedmg~ of the North American Conference on Loglc Programm~ng (Cleveland, Oh.), 1115-1134.]]

Crossref

Google Scholar

[36]

ROSENDAHL, M. 1989. Automatic complexity analysis. In Proceedings of the ACM Conference on Functwnal Programming Languages and Computer Architecture. ACM, New York, 144-156.]]

Crossref

Google Scholar

[37]

ULLMAN, J. D., AND VAN GELDER, A. 1988. Efficient tests for top-down termination of log~cal rules. J. ACM 35, 2, 345-373.]]

Crossref

Google Scholar

[38]

VAN GELDE~, A. 1990. Deriving constraints among argument sizes in logic programs. In Proceedings of the Nmth ACM Symposium on Prmclples of Database Systems (Nashville, Tenn., April). ACM, New York.]]

Crossref

Google Scholar

[39]

VERCHAETSE, K, AND DE SCHREYE, D. 1991. Deriving termination proofs for logic progTams, using abstract procedures. In Proceedings of the Eighth Internatwnal Conference on Logic Programming (Paris, June), 301-315.]]

Google Scholar

[40]

WEC~BREIT, B. 1975. Mechanical program analysis. Commun. ACM 18, 9 (Sept.), 528-539.]]

Crossref

Google Scholar

[41]

YARDENI, E., AND SHAPIRO, E. 1988, A type system for logic programs. In Concurrent Prolog: Collected Papers, vol. 2, E. Shapiro, Ed., 211-244,]]

Crossref

Google Scholar

[42]

WELSH, D. J. A., AND POWELL, M. J.D. 1967. An upper bound for the chromatic number of a graph and its applications to timetabling problems. Computer J. 10, 85-87.]]

Google Scholar

[43]

ZIMMERMANN, P., AND ZIMMERMANN, W. 1989. The automatic complexity analysis of divide-andconquer algorithms. Res. Rep. 1149, INRIA, France, Dec.]]

Google Scholar

Cited By

View all

Klemen MCarreira-Perpiñán MLopez-Garcia P(2023)Solving Recurrence Relations using Machine Learning, with Application to Cost AnalysisElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.385.16385(155-168)Online publication date: 12-Sep-2023
https://doi.org/10.4204/EPTCS.385.16
Ish-Shalom OItzhaky SRinetzky NShoham S(2022)Runtime Complexity Bounds Using SqueezersACM Transactions on Programming Languages and Systems10.1145/352763244:3(1-36)Online publication date: 15-Jul-2022
https://dl.acm.org/doi/10.1145/3527632
Rozplokhas DBoulytchev D(2022)Scheduling Complexity of Interleaving SearchFunctional and Logic Programming10.1007/978-3-030-99461-7_9(152-170)Online publication date: 10-May-2022
https://dl.acm.org/doi/10.1007/978-3-030-99461-7_9
Show More Cited By

Index Terms

Recommendations

On the complexity of dataflow analysis of logic programs

It is widely held that there is a correlation between complexity and precision in dataflow analysis, in the sense that the more precise an analysis algorithm, the more computationally expensive it must be. The details of this relationship, however, ...
Expressiveness of Logic Programs under the General Stable Model Semantics

Stable model semantics had been recently generalized to non-Herbrand structures by several works, which provides a unified framework and solid logical foundations for answer set programming. This article focuses on the expressiveness of normal and ...
Semantics for disjunctive logic programs

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Programming Languages and Systems

ACM Transactions on Programming Languages and Systems Volume 15, Issue 5

Nov. 1993

151 pages

ISSN:0164-0925

EISSN:1558-4593

DOI:10.1145/161468

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1993

Published in TOPLAS Volume 15, Issue 5

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

118
Total Citations
View Citations
733
Total Downloads

Downloads (Last 12 months)109
Downloads (Last 6 weeks)11

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Klemen MCarreira-Perpiñán MLopez-Garcia P(2023)Solving Recurrence Relations using Machine Learning, with Application to Cost AnalysisElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.385.16385(155-168)Online publication date: 12-Sep-2023
https://doi.org/10.4204/EPTCS.385.16
Ish-Shalom OItzhaky SRinetzky NShoham S(2022)Runtime Complexity Bounds Using SqueezersACM Transactions on Programming Languages and Systems10.1145/352763244:3(1-36)Online publication date: 15-Jul-2022
https://dl.acm.org/doi/10.1145/3527632
Rozplokhas DBoulytchev D(2022)Scheduling Complexity of Interleaving SearchFunctional and Logic Programming10.1007/978-3-030-99461-7_9(152-170)Online publication date: 10-May-2022
https://dl.acm.org/doi/10.1007/978-3-030-99461-7_9
Kafle BGallagher JHermenegildo MKlemen MLópez-García PMorales J(2021)Regular Path Clauses and Their Application in Solving LoopsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.344.3344(22-35)Online publication date: 13-Sep-2021
https://doi.org/10.4204/EPTCS.344.3
DE ANGELIS EFIORAVANTI FGALLAGHER JHERMENEGILDO MPETTOROSSI APROIETTI M(2021)Analysis and Transformation of Constrained Horn Clauses for Program VerificationTheory and Practice of Logic Programming10.1017/S147106842100021122:6(974-1042)Online publication date: 15-Nov-2021
https://doi.org/10.1017/S1471068421000211
Ish-Shalom OItzhaky SRinetzky NShoham S(2021)Run-time Complexity Bounds Using SqueezersProgramming Languages and Systems10.1007/978-3-030-72019-3_12(320-347)Online publication date: 23-Mar-2021
https://doi.org/10.1007/978-3-030-72019-3_12
Pérez VKlemen MLópez-García PMorales JHermenegildo M(2020)Cost Analysis of Smart Contracts Via Parametric Resource AnalysisStatic Analysis10.1007/978-3-030-65474-0_2(7-31)Online publication date: 18-Nov-2020
https://dl.acm.org/doi/10.1007/978-3-030-65474-0_2
ALBERT EBOFILL MBORRALLERAS CMARTIN-MARTIN ERUBIO A(2019)Resource Analysis driven by (Conditional) Termination ProofsTheory and Practice of Logic Programming10.1017/S147106841900015219:5-6(722-739)Online publication date: 20-Sep-2019
https://doi.org/10.1017/S1471068419000152
Klemen MLópez-García PGallagher JMorales JHermenegildo M(2019)A General Framework for Static Cost Analysis of Parallel Logic ProgramsLogic-Based Program Synthesis and Transformation10.1007/978-3-030-45260-5_2(19-35)Online publication date: 8-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-45260-5_2
Klemen MStulova NLópez-García PMorales JHermenegildo MSabel DThiemann P(2018)Static Performance Guarantees for Programs with Runtime ChecksProceedings of the 20th International Symposium on Principles and Practice of Declarative Programming10.1145/3236950.3236970(1-13)Online publication date: 3-Sep-2018
https://dl.acm.org/doi/10.1145/3236950.3236970
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

On the complexity of dataflow analysis of logic programs

Expressiveness of Logic Programs under the General Stable Model Semantics

Semantics for disjunctive logic programs

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations