Automatic complexity analysis of logic programs

Saumya K. Debray, Nai Wei Lin

Research output: Contribution to conferencePaper

9 Scopus citations

Abstract

Automatic complexity analysis of programs has been widely studied in the context of functional languages. This paper develops a method for automatic analysis of the worse-case complexity of a large class of logic programs. The primary contribution of this paper is that it shows how to deal with nondeterminism and the generation of multiple solutions via backtracking. One advantage of our method is that analyses for different complexity measures (e.g. time complexity, space complexity, number of solutions, etc) are performed in a unified framework that simplifies both formal reasoning about, and implementation of, the algorithms.

Original languageEnglish (US)
Pages599-613
Number of pages15
StatePublished - Dec 1 1991
EventLogic Programming - Proceedings of the 8th International Conference - Paris, Fr
Duration: Jun 24 1991Jun 28 1991

Other

OtherLogic Programming - Proceedings of the 8th International Conference
CityParis, Fr
Period6/24/916/28/91

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Debray, S. K., & Lin, N. W. (1991). Automatic complexity analysis of logic programs. 599-613. Paper presented at Logic Programming - Proceedings of the 8th International Conference, Paris, Fr, .