Differences between revisions 3 and 4
Revision 3 as of 2009-05-20 03:40:05
Size: 621
Editor: GlennSlayden
Revision 4 as of 2011-10-08 21:12:17
Size: 623
Editor: localhost
Comment: converted to 1.6 markup
Deletions are marked like this. Additions are marked like this.
Line 14: Line 14:
[http://www.computational-semantics.com/webshare/inv-3-hierarchy-lkb.png] [[http://www.computational-semantics.com/webshare/inv-3-hierarchy-lkb.png]]

This page is a repository for documenting known issues with the LKB such that they can be investigated and corrected, should developers visit or revisit the relevant areas of the code.

  • In the following full type hierarchy:

a := *top*.
b := *top*.
d := a & b.
c := b.
e := a & c.
f := a & c.

the LKB establishes a type hierarchy with redundant edges from a - f and a - e:


One expects a graph with 10 edges, rather than 12, since ‘a’ already subsumes both ‘f’ and ‘e’ via ‘glbtype1’ and ‘glbtype2’.

LkbBugs (last edited 2017-12-18 13:09:58 by JohnCarroll)

(The DELPH-IN infrastructure is hosted at the University of Oslo)