[ Not sure if this should be asked here or on the OpenCog list... tell
me which one is more appropriate ]
I think it will be very helpful and illuminating to some of us here
(including myself) who are more familar with FOL than PLN, to give a
1-1 correspondence (either exact or approximate) between the two
formalisms.
Here are some examples in FOL:
"Mary is female"
female(mary)
This is a [production] "rule": (not to be confused with an inference rule)
"A female child is called a daughter"
daughter(X) <- child(X) & female(X)
where universal quantification is assumed.
Another rule:
"there exists a parent for every child"
forall X exists Y, child(X) -> parent(Y,X)
This is a ground fact involving a function symbol:
"Mary's mother is female"
female(mother(mary))
A rule involving a function symbol:
"All mothers are female"
forall X, female(mother(X))
"a person is either male or female"
forall X, male(X) V female(X)
[ Ben -- I guess you're in Japan now, so maybe you or someone else
working on OpenCog can answer this ]
Thanks in advance!
*** bonus question ***
Can you give an example of something expressed in PLN that is very
hard or impossible to express in FOL?
YKY
-------------------------------------------
agi
Archives: http://www.listbox.com/member/archive/303/=now
RSS Feed: http://www.listbox.com/member/archive/rss/303/
Modify Your Subscription:
http://www.listbox.com/member/?member_id=8660244&id_secret=103754539-40ed26
Powered by Listbox: http://www.listbox.com
