Practical Partition-Based Theorem Proving for Large Knowledge Bases (2003)
Cached
Download Links
- [www.cs.uiuc.edu]
- [ksl-web.stanford.edu]
- [www.cs.toronto.edu]
- [www.cs.toronto.edu]
- CiteULike
- DBLP
Other Repositories/Bibliography
by
Bill Maccartney
,
Sheila Mcilraith
| Citations: | 22 - 4 self |
BibTeX
@MISC{Maccartney03practicalpartition-based,
author = {Bill Maccartney and Sheila Mcilraith},
title = {Practical Partition-Based Theorem Proving for Large Knowledge Bases},
year = {2003}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often be hand-tuned to answer queries with reasonable performance in practice.
