Re: semantic nets vs first-order logic

From: Chris Menzel (cmenzel_at_remove-this.tamu.edu)
Date: 03/11/05


Date: 11 Mar 2005 14:09:01 GMT

On Fri, 11 Mar 2005 04:56:14 -0800, alex goldman <hello@spamm.er> said:
> Even after reading up a bit on the subject, I'm still not very sure about
> how semantic nets are related to first-order logic, and I have a few
> questions (I'm more familiar with FOL than with SNs)
>
> Is FOL strictly more expressive than SNs?
>
> Can FOL be limited so that the result will be isomorphic to SNs, and
> if so, what would be the isomorphism?
>
> FOL is to Prolog, as SN is to ... ?

If by a semantic network you mean some sort of graphical system for
representing information, the answer depends on which system you have in
mind. Some, like KL-ONE, are much weaker than full FOL (IIRC, KL-ONE
lacks negation), others, like Peirce's system of Existential Graphs, are
fully equivalent. Still others, like SNePS, are not classically
first-order at all.

Chris Menzel



Relevant Pages

  • Re: semantic nets vs first-order logic
    ... > how semantic nets are related to first-order logic, ... > questions (I'm more familiar with FOL than with SNs) ... Some, like KL-ONE, are much weaker than full FOL (IIRC, KL-ONE ...
    (comp.theory)
  • semantic nets vs first-order logic
    ... how semantic nets are related to first-order logic, ... Is FOL strictly more expressive than SNs? ... what would be the isomorphism? ...
    (comp.theory)
  • semantic nets vs first-order logic
    ... how semantic nets are related to first-order logic, ... Is FOL strictly more expressive than SNs? ... what would be the isomorphism? ...
    (sci.logic)
  • semantic nets vs first-order logic
    ... how semantic nets are related to first-order logic, ... Is FOL strictly more expressive than SNs? ... what would be the isomorphism? ...
    (comp.lang.prolog)
  • Re: semantic nets vs first-order logic
    ... > questions (I'm more familiar with FOL than with SNs) ... > what would be the isomorphism? ... description logics can be regarded as ...
    (comp.lang.prolog)