A Computational Structure for the Propositional Calculus
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Automated Deduction. Pages 384-387.
Abstract
Despite the long history and descriptive simphclty of the propositional calculus, practical aspe~ts of its. implementation on the computer remam an achve area of study. We propose a representation of the propositional calculus which is s.traightfo~ard, yet compact and sufficiently flex1ble to c1rcumvent the combinatorial difficulties posed by many problems. The methodology does not involve term-rewriting, production systems, or similar, symbol-oriented approaches, but, rather, relies on a non-canonical representation in disjunctive normal form. It has been implemented in PASCAL, and efficiently solves what are described in the literature as "difficult" problems. The approach, which is simple and highly structured, and perhaps more procedural than many others, may be recommended for its ease of interpretation and for incorporation as a tool in larger systems.
@inproceedings{ijcai1989p61,
title = {A Computational Structure for the Propositional Calculus},
author = {Shensa, M. J.},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {384--387},
year = {1989},
month = {8},
note = {Automated Deduction},
url = {https://ijcai.org/proceedings/1989/61},
}
TY - CPAPER TI - A Computational Structure for the Propositional Calculus AU - Shensa, M. J. T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 384 EP - 387 UR - https://ijcai.org/proceedings/1989/61 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
