PROBABILISTIC COST ANALYSIS OF LOGIC PROGRAMS

dc.creatorSoza Pollman,Héctor Juan
dc.date2009-08-01
dc.date.accessioned2017-03-07T16:14:34Z
dc.date.available2017-03-07T16:14:34Z
dc.identifierhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0718-33052009000200008
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/398359
dc.descriptionCost analyses of logic programs have been developed which make it possible to obtain automatically lower and upper bounds of runtime cost of computations. This information is very useful for a variety of purposes, including granularity control, query optimization in databases, and program transformation and synthesis. However, current techniques suffer a loss of accuracy in some cases which are quite representative (i.e., some divide-and-conquer programs as QuickSort). This paper describes an alternative probabilistic approach which makes it possible to figure out an estimate of the execution cost. One of its advantages is that it needs only a few changes over previously proposed schemes.
dc.formattext/html
dc.languageen
dc.publisherUniversidad de Tarapacá.
dc.sourceIngeniare. Revista chilena de ingeniería v.17 n.2 2009
dc.subjectLogic programming
dc.subjectcost analysis
dc.subjectcomplexity analysis
dc.subjectprogram analysis
dc.subjectresource consumption estimation
dc.titlePROBABILISTIC COST ANALYSIS OF LOGIC PROGRAMS
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución