Taxonomic Reasoning
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 191-192.
Abstract
In formalizing knowledge for common sense reasoning, one often needs to partition some domain. An instance of this from the Blocks World is the statement "All blocks are either held, on the table, or on another block." Although we can write this axiom in predicate calculus or in clause form for input to a theorem prover, such representations are highly space inefficient. In this paper we present a generalized clause form that allows for the compact representation of arbitrary partitions, along with a set of corresponding inference rules. Additionally, a theorem prover imp lem enting these rules is described that demonstrates their utility with certain kinds of common sense rule bases.
@inproceedings{ijcai1985p35,
title = {Taxonomic Reasoning},
author = {Tenenberg, Josh D.},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {191--192},
year = {1985},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1985/35},
}
TY - CPAPER TI - Taxonomic Reasoning AU - Tenenberg, Josh D. T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 191 EP - 192 UR - https://ijcai.org/proceedings/1985/35 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: