Allowed Arguments
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Non-monotonic Reasoning. Pages 1466-1472.
Abstract
Starting with a first-order modal conditional logic which allows unlimited nesting of defaults and embeddings into any context analyzable in possibleworlds theory, I introduce two simple notions of default reasoning: the syntactic notion of (prioritized) Allowed Consequence and the semantic notion of (prioritized) Allowed Entailment. I prove that the one is sound and complete relative to the other.
Michael Morreau. 1995. Allowed Arguments. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95. IJCAI, 1466–1472. https://ijcai.org/proceedings/1995/189
Morreau, M. (1995). Allowed Arguments. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 (pp. 1466–1472). IJCAI. https://ijcai.org/proceedings/1995/189
@inproceedings{ijcai1995p189,
title = {Allowed Arguments},
author = {Morreau, Michael},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {1466--1472},
year = {1995},
note = {Non-monotonic Reasoning},
url = {https://ijcai.org/proceedings/1995/189},
}
TY - CPAPER TI - Allowed Arguments AU - Morreau, Michael T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 1466 EP - 1472 UR - https://ijcai.org/proceedings/1995/189 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
