An Algebraic Foundation for Truth Maintenance
Proceedings of the Tenth International Joint Conference on Artificial Intelligence. Reasoning. Pages 973-979.
Abstract
We have recast the probl e m of truth maintenance in a setting of algebraic equations over Boolean lattices . If a method of labeling propositions to justify them according to some reasoning agent 's constraints of belief happens to conform to the postulates of Boolean lattices , the labeling system can be reformulated as an algebraic equation solving system . All truth maintenance systems known to us can be so reformulated. This note summarizes our inv estigations into the existence and structure of solutions of these algebraic systems. Our central result is a unique factorization theorem for lattice equational systems and their solutions. Our theoretical results are interpreted to compare various styles of truth maintenance and to reveal certain computational difficulties implicit in the algebraic structure of truth maintenance.
@inproceedings{ijcai1987p200,
title = {An Algebraic Foundation for Truth Maintenance},
author = {Jr., Allen L. Brown and Gaucas, Dale E. and Benanav, Dan},
booktitle = {Proceedings of the Tenth International Joint Conference on
Artificial Intelligence, {IJCAI-87}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John McDermott},
pages = {973--979},
year = {1987},
note = {Reasoning},
url = {https://ijcai.org/proceedings/1987/200},
}
TY - CPAPER TI - An Algebraic Foundation for Truth Maintenance AU - Jr., Allen L. Brown AU - Gaucas, Dale E. AU - Benanav, Dan T2 - Proceedings of the Tenth International Joint Conference on Artificial Intelligence, IJCAI-87 PB - International Joint Conferences on Artificial Intelligence PY - 1987 SP - 973 EP - 979 UR - https://ijcai.org/proceedings/1987/200 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
