%0 Conference Paper
%A Debray, S.K.
%A López García, Pedro
%A Hermenegildo, Manuel V.
%A Lin, Nai-Wei
%B First International Static Analysis Symposium, SAS '94
%C Namur, Belgium
%D 1994
%F upm:14558
%I Springer Berlin Heidelberg
%T Estimating the computational cost of logic programs
%U http://oa.upm.es/14558/
%V 864
%X 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 múltiple Solutions, making it necessary to estímate 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.