David Dubin - University of Illinois Graduate School of Library and Information Science in Champaign, Illinois - Paper
Looks like a theoretical paper....but it's a Dubin presentation so who knows?
Ok, he is discussing finding the youngest (closest to the leaves in the tree) ancestor of node X and node Y using a type of formal logic programming.
He's using formal logic statements to setup a more difficult finding experience. Unfortunately for you, dear reader, I have not used logic operators in a VERY long time, so I won't be able to provide anything beyond his paper.
If you are interested in using formal logic in your Prolog demo, then you know more about this than I ever will and should just go read the paper. ;-)
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment