A Functional Approach to Non-Monotonic Logic
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 100-105.
Abstract
Axiom sets and their extensions are viewed as functions from the set of formulas in the language, to a set of four truth-values t, /, a for undefined, and A: for contradiction. Such functions form a lattice with 'contains less information' as the partial order ~. and 'combination of several sources of knowledge' as the l.u.b. operation U. We demonstrate the relevance of this approach by giving concise proofs for some previously known results about normal default rules. For non-monotonic rules in general (not only normal default rules) we define a stronger version of the minimality requirement on consistent fixpoints, and prove that it is sufficient for the existence of a derivation of the flXJloint.
@inproceedings{ijcai1985p18,
title = {A Functional Approach to Non-Monotonic Logic},
author = {Sandewall, Erik},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {100--105},
year = {1985},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1985/18},
}
TY - CPAPER TI - A Functional Approach to Non-Monotonic Logic AU - Sandewall, Erik T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 100 EP - 105 UR - https://ijcai.org/proceedings/1985/18 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: