Newsgroups: comp.lang.prolog
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!oitnews.harvard.edu!purdue!lerc.nasa.gov!magnus.acs.ohio-state.edu!math.ohio-state.edu!uwm.edu!cs.utexas.edu!uunet!in1.uu.net!newsfeed.internetmci.com!EU.net!sun4nl!freya.let.rug.nl!let.rug.nl!gosse
From: gosse@let.rug.nl (Gosse Bouma)
Subject: Re: complexity
Sender: news@let.rug.nl (News system at let.rug.nl)
Message-ID: <1995Nov10.090654.15606@let.rug.nl>
Date: Fri, 10 Nov 1995 09:06:54 GMT
References:  <47pmsl$93e@rztsun.tu-harburg.de>
Nntp-Posting-Host: hela.let.rug.nl
Organization: Faculty of Arts, University of Groningen
Lines: 33

In article <47pmsl$93e@rztsun.tu-harburg.de>, rtshb@tuhhco.rz.tu-harburg.de
(Bernd Heiming) writes:

> does anybody know where I can find some theoretical or practical work about
> estimating the time complexity O() of logical programs?

In CLIN V ((on-line) Proceedings of fifth computational linguistics in the
Netherlands conference) you will find the paper
 
      	Erik Aarts 

	Complexity of Pure Prolog Programs 

       	This paper gives a method to estimate the space and time complexity of 	
	algorithms implemented in pure Prolog and executed under the OLDT 
	search strategy (also called Earley Deduction). 

CLIN home page:

http://grid.let.rug.nl/~vannoord/clin/clin.html

CLIN V home page: 

http://www.let.rug.nl/~vannoord/clin/Clin5/clin5.html



Kind regards,

Gosse.
-- 
Gosse Bouma, Alfa-informatica, RUG, Postbus 716, 9700 AS Groningen
gosse@let.rug.nl      tel. +31-50-3635937      fax  +31-50-3636855
