On 1/18/19 3:12 PM, Johannes Castner wrote:
Do you know of a simpler way than to hand-code those Axioms
individually? I mean, do you know if they might not already be encoded
somewhere? If I have to, I'll encode all of them by hand--quite a project!
Unfortunately I doubt such axioms are encoded anywhere.
I have intended to supplement PLN rules with higher order facts (HOF)
to, among other things, define an ontology of relationships such as
ImplicationScope (stv 1 1)
P
And
Member
P
Concept "binary"
Member
P
Concept "transitive"
ImplicationScope
VariableList X Y Z
And
Evaluation
P
List X Y
Evaluation
P
List Y Z
Evaluation
P
List X Z
so that one may directly write
Member (stv 1 1)
Predicate "be-friends"
Concept "transitive"
Then PLN would need an extra step to reason about the transitiveness of
be-friends but it would make it much more compact to encode.
These facts are planned to be placed under
https://github.com/opencog/opencog/tree/master/opencog/pln/facts
but, as you can see, only one is present ATM.
Nil
--
You received this message because you are subscribed to the Google Groups
"opencog" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/opencog.
To view this discussion on the web visit
https://groups.google.com/d/msgid/opencog/64541b77-5290-832a-facc-2bc03bca92e9%40gmail.com.
For more options, visit https://groups.google.com/d/optout.
