Re: deductive databases
From: alex goldman <hello_at_spamm.er>
Date: Tue, 17 May 2005 10:33:37 -0700
Message-Id: <1301963.fDU1I1y9sr_at_yahoo.com>
>
> Datalog is decidable precisely because it chucked Prolog's 'functor'.
> Prolog is of course undecidable.
Date: Tue, 17 May 2005 10:33:37 -0700
Message-Id: <1301963.fDU1I1y9sr_at_yahoo.com>
vc wrote:
> Just to prevent spreading mis-information:
>
>> > alex goldman wrote:
> [...skipped ...]
>
>>. First-order logic without functors is far less
>> expressive.
>
> There is no FOL with 'functors'
Looks like this idiot doesn't even realize the relation between Prolog and FOL. How much humiliation can he take?
http://clip.dia.fi.upm.es/~logalg/slides/5_autded/node1.html http://www.cee.hw.ac.uk/~alison/ai3notes/subsection2_4_3_2.html
Enjoy
>>.First-order logic without functors is far less expressive. The >> restricted language is called Datalog. The inference in Datalog >> is decidable and the inference in First-order logic isn't.
>
> Datalog is decidable precisely because it chucked Prolog's 'functor'.
> Prolog is of course undecidable.
How does poorly rephrasing something count as prevention of spreading of mis-information (sic) ? Received on Tue May 17 2005 - 19:33:37 CEST