A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases
Abstract
In previous work, Levesque proposed an extension to classical databases that would allow for a certain form of incomplete first-order knowledge. Since this extension was sufficient to make full logical deduction undecidable, he also proposed an alternative reasoning scheme with desirable logical properties. He also
Cite
Text
Liu and Levesque. "A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases." International Joint Conference on Artificial Intelligence, 2003.Markdown
[Liu and Levesque. "A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/liu2003ijcai-tractability/)BibTeX
@inproceedings{liu2003ijcai-tractability,
title = {{A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases}},
author = {Liu, Yongmei and Levesque, Hector J.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2003},
pages = {83-88},
url = {https://mlanthology.org/ijcai/2003/liu2003ijcai-tractability/}
}