Decidability

Next message: Alan Smaill: "Re: Decidability"
Previous message: Sangai: "Re: List quastion"
Next in thread: Alan Smaill: "Re: Decidability"
Reply: Alan Smaill: "Re: Decidability"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

From: Norbert E. Fuchs (fuchs_at_ifi.unizh.ch)
Date: 10/13/04

Date: Wed, 13 Oct 2004 09:30:56 +0200

The Horn clause subset of first-order logic is not decidable, while the
Datalog subset is.

Now somebody suggested that the Horn clause subset that uses only
primitive recursive functions to build compound terms is decidable.

Is this statement true? If yes, are there any references?

Thanks for your help.

Relevant Pages

Re: Decidability
... > Datalog subset is. ... > Now somebody suggested that the Horn clause subset that uses only ... > primitive recursive functions to build compound terms is decidable. ...
(comp.lang.prolog)
Re: Decidability
... Norbert E. Fuchs wrote: ... > The Horn clause subset of first-order logic is not decidable, ... > Datalog subset is. ... > Is this statement true? ...
(comp.lang.prolog)