Ordered chaining calculi for first-order theories of transitive relations
Journal of the ACM (JACM)
Making B+- trees cache conscious in main memory
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Term Indexing
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Handbook of automated reasoning
Combining superposition, sorts and splitting
Handbook of automated reasoning
AI Communications - CASC
Yago: a core of semantic knowledge
Proceedings of the 16th international conference on World Wide Web
YAGO: A Large Ontology from Wikipedia and WordNet
Web Semantics: Science, Services and Agents on the World Wide Web
iProver --- An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
The 4th IJCAR Automated Theorem Proving System Competition - CASC-J4
AI Communications
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
External sources of axioms in automated theorem proving
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Reasoning support for expressive ontology languages using a theorem prover
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
On the verification of security-aware E-services
Journal of Symbolic Computation
Superposition for bounded domains
Automated Reasoning and Mathematics
| Hi-index | 0.00 |
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.