@inproceedings{2c4bf7fbe94d47d0a28bd6653c911645,
title = "Anytime approximate modal reasoning",
abstract = "Propositional modal logics have two independent sources of complexity: unbounded logical omniscience and unbounded logical introspection. This paper discusses an approximation method to tame both of them, by merging propositional approximations with a new technique tailored for multi-modal logics. It provides both skeptical and credulous approximations (or approximation that are neither of the two). On this semantics we build an anytime proof procedure with a simple modification to classical modal tableaux. The procedure yields approximate proofs whose precision increases as we have more resources (time, space etc.) and we analyze its semantical and computational `quality guarantees'.",
author = "Fabio Massacci",
year = "1998",
language = "English",
series = "Proceedings of the National Conference on Artificial Intelligence",
publisher = "AAAI",
pages = "274--279",
booktitle = "Proceedings of the National Conference on Artificial Intelligence",
note = "Proceedings of the 1998 15th National Conference on Artificial Intelligence, AAAI ; Conference date: 26-07-1998 Through 30-07-1998",
}