A Decidable First-Order Logic for Knowledge Representation
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Knowledge Representation. Pages 455-457.
Abstract
Even though logic has played an important role in knowledge representation (KR) research, there has b ee n little effort exp ended on devising decidable logics for KR. Most modifications to logic suggested for KR are either extensions to first-order logic (e.g., to handle non-monotonidty) or ad hoc changes in its inference mechanism. This paper presents a variant of first- order relevance lo gic that has a decidable algorithm for determining tautological entailment. Although this logic is considerably weaker than standard fir st-order logic , it can be used effectively in a KR system when semantically correct answers to queries are required within a finite amount of time.
@inproceedings{ijcai1985p89,
title = {A Decidable First-Order Logic for Knowledge Representation},
author = {Patel-Schneider, Peter F.},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {455--457},
year = {1985},
note = {Knowledge Representation},
url = {https://ijcai.org/proceedings/1985/89},
}
TY - CPAPER TI - A Decidable First-Order Logic for Knowledge Representation AU - Patel-Schneider, Peter F. T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 455 EP - 457 UR - https://ijcai.org/proceedings/1985/89 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
