Abstract
YAGO is an automatically generated ontology out of Wikipedia and WordNet. It is eventually represented in a proprietary flat text file format and a core comprises 10 million facts and formulas. We present a translation of YAGO into the Bernays-Schönfinkel Horn class with equality. A new variant of the superposition calculus is sound, complete and terminating for this class. Together with extended term indexing data structures the new calculus is implemented in Spass-YAGO. YAGO can be finitely saturated by Spass-YAGO in about 1 hour. We have found 49 inconsistencies in the original generated ontology which we have fixed. Spass-YAGO can then prove non-trivial conjectures with respect to the resulting saturated and consistent clause set of about 1.4 GB in less than one second. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Suda, M., Weidenbach, C., & Wischnewski, P. (2010). On the saturation of YAGO. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6173 LNAI, pp. 441–456). https://doi.org/10.1007/978-3-642-14203-1_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
