ML Anthology

Practical Partition-Based Theorem Proving for Large Knowledge Bases

Bill MacCartney, Sheila A. McIlraith, Eyal Amir, Tomás E. Uribe
IJCAI 2003 pp. 89-98
/ijcai/2003/maccartney2003ijcai-practical/

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.

PDF Semantic Scholar

Cite

Text

MacCartney et al. "Practical Partition-Based Theorem Proving for Large Knowledge Bases." International Joint Conference on Artificial Intelligence, 2003.

Markdown

[MacCartney et al. "Practical Partition-Based Theorem Proving for Large Knowledge Bases." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/maccartney2003ijcai-practical/)

BibTeX

@inproceedings{maccartney2003ijcai-practical,
  title     = {{Practical Partition-Based Theorem Proving for Large Knowledge Bases}},
  author    = {MacCartney, Bill and McIlraith, Sheila A. and Amir, Eyal and Uribe, Tomás E.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2003},
  pages     = {89-98},
  url       = {https://mlanthology.org/ijcai/2003/maccartney2003ijcai-practical/}
}