Satisfiability in Logic vs. satisfiability in DB theory
Date: Thu, 01 Apr 2004 10:24:06 GMT
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 - 12:24:06 CEST