On the Saturation of YAGO

Suda, Martin; Weidenbach, Christoph; Wischnewski, Patrick

doi:10.1007/978-3-642-14203-1_38

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

On the Saturation of YAGO

MPS-Authors

/persons/resource/persons45573

Suda, Martin
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons45719

Weidenbach, Christoph
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons45753

Wischnewski, Patrick
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Suda, M., Weidenbach, C., & Wischnewski, P. (2010). On the Saturation of YAGO. In J., Giesl, & R., Hähnle (Eds.), Automated Reasoning (pp. 441-456). Berlin: Springer. doi:10.1007/978-3-642-14203-1_38.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-14BB-9

要旨

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¨onfinkel 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.