Partial Ordering and Unions

Appeared in Volume 9/3, August 1996

ged@goanna.cs.rmit.edu.au
Gerard Ellis
4th December 1995

S. Tobies (st14@ukc.ac.uk) writes:
I am looking for a Prolog algorithm which given a set of elements with a partial ordering returns the structure of those elements in a Hasse-diagram style. References to similar algorithms in other languages would also be very helpful.

See:

R. A. Levinson, Pattern Associativity and the Retrieval of Semantic Networks, Computers & Mathematics with Applications Journal, Vol.23, No. 2, pp. 573-600

F. Baader, E. Franconi, B. Hollunder, B. Nebel and H-J. Profitlich, An Empirical Analysis of Optimization Techniques for Terminological Representation Systems or: Making KRIS get a move on, In Applied Artificial Intelligence, Special Issue on Knowledge Base Management, Vol. 4, pp. 109-132, 1994

G. Ellis, Managing Complex Objects, Computer Science Dept,. Univ. of Queensland, Australia, 1995. Available by anonymous FTP from:
ftp://ftp.cs.rmit.edu.au/pub/rmit/peirce/thesis.ps.Z