Computing Circumscription
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 121-126.
Abstract
Circumscription is a transformation of predicate formulas proposed by John McCarthy for the purpose of formalizing non-monotonic aspects of commonsense reasoning. Circumscription is difficult to implement because its definition involves a second-o rder quantifier. This paper presents metama.thernatical results that allow us in some cases to replace circumscription by an equivalent first-order formula.
Vladimir Lifschitz. 1985. Computing Circumscription. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85. IJCAI, 121–126. https://ijcai.org/proceedings/1985/22
Lifschitz, V. (1985). Computing Circumscription. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 (pp. 121–126). IJCAI. https://ijcai.org/proceedings/1985/22
@inproceedings{ijcai1985p22,
title = {Computing Circumscription},
author = {Lifschitz, Vladimir},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {121--126},
year = {1985},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1985/22},
}
TY - CPAPER TI - Computing Circumscription AU - Lifschitz, Vladimir T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 121 EP - 126 UR - https://ijcai.org/proceedings/1985/22 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
