Prefixed Tableaux Systems for Modal Logics with Enriched Languages
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 190-194.
Abstract
We present sound and complete prefixed tableaux systems for various modal logics with enriched languages including the "difference" modal operator[#] and the "only if" modal operator [-R]. These logics are of special interest in Artificial Intelligence since their expressive power is higher than the standard modal logics and for most of them the satisfiability problem remains decidable. We also include in the paper decision procedures based on these systems. In the conclusion, we relate our work with similar ones from the literature and we propose extensions to other logics.
@inproceedings{ijcai1997p29,
title = {Prefixed Tableaux Systems for Modal Logics with Enriched Languages},
author = {Balbiani, Philippe and Demri, Stephane},
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 = {190--194},
year = {1997},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1997/29},
}
TY - CPAPER TI - Prefixed Tableaux Systems for Modal Logics with Enriched Languages AU - Balbiani, Philippe AU - Demri, Stephane T2 - Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97 PB - International Joint Conferences on Artificial Intelligence PY - 1997 SP - 190 EP - 194 UR - https://ijcai.org/proceedings/1997/29 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
