Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: Satisfiability in Logic vs. satisfiability in DB theory

Re: Satisfiability in Logic vs. satisfiability in DB theory

From: Tom Hester <$$tom_at_metadata.com>
Date: Thu, 1 Apr 2004 15:56:15 -0800
Message-ID: <a1861$406cac20$45033832$6526@msgid.meganewsservers.com>


I don't know; but thinking about it today, I can't see why the change should alter decidability.

"Anthony WIDJAJA" <twidjaja_at_cs.mu.OZ.AU> wrote in message news:Pine.GSO.4.56.0404012009460.8515_at_mulga.cs.mu.OZ.AU...
> Hi,
>
> Recently, I've seen some papers that confuse the notions of
> FOL satisfiability in logic (where the domain is specified in the model
> and may take constants not appearing in any relations)
> and first-order query satisfiability in DB theory (where the domain is
> taken to be the active domain). I'm wondering if the decidability status
> of satisfiability of any fragment of FOL changes when the domain is
> forced to be the active domain. For example, monadic FOL
> satisfiability is decidable whether or not we force the domain of
> interpretation to be the active domain. Does anybody know?
>
> Thanks in advance,
>
> Anthony
Received on Thu Apr 01 2004 - 17:56:15 CST

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US