A Set-Theoretic Approach to Automated Deduction in Graded Modal Logics
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 196-200.
Abstract
In the paper, we consider the problem of supporting automated reasoning in a large class of knowledge representation formalisms, including terminological and epistemic logics, whose distinctive feature is the ability of representing and reasoning about finite quantities. Each member of this class can be represented using graded modalities, and thus the considered problem can be reduced to the problem of executing graded modal logics. We solve this problem using a set-theoretic approach that first transforms graded modal logics into polymodal logics with infinitely many modalities, and then reduces derivability in such pplymodallogics to derivability in a suitable first-order set theory.
@inproceedings{ijcai1997p30,
title = {A Set-Theoretic Approach to Automated Deduction in Graded Modal Logics},
author = {Montanari, Angelo and Policriti, Alberto},
booktitle = {Proceedings of the Fifteenth International Joint Conference on
Artificial Intelligence, {IJCAI-97}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Martha E. Pollack},
pages = {196--200},
year = {1997},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1997/30},
}
TY - CPAPER TI - A Set-Theoretic Approach to Automated Deduction in Graded Modal Logics AU - Montanari, Angelo AU - Policriti, Alberto T2 - Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97 PB - International Joint Conferences on Artificial Intelligence PY - 1997 SP - 196 EP - 200 UR - https://ijcai.org/proceedings/1997/30 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
