Abstract
AbstractWe present resolution calculi for the cube of classical non-normal modal logics. The calculi are based on a simple clausal form that comprises both local and global clauses. Any formula can be efficiently transformed into a small set of clauses. The calculi contain uniform rules and provide a decision procedure for all logics. Their completeness is based on a new and crucial notion of inconsistency predicate, needed to ensure the usual closure properties of maximal consistent sets. As far as we know the calculi presented here are the first resolution calculi for this class of logics.
Publisher
Springer Nature Switzerland
Reference52 articles.
1. Lecture Notes in Computer Science;M Abadi,1986
2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);C Areces,1999
3. Auffray, Y.: Linear strategy for propositional modal resolution. Inf. Process. Lett. 28(2), 87–92 (1988)
4. del Cerro, L.F.: Resolution modal logics. In: Proceedings of Advanced NATO Study Institute on Logics and Models for Verification and Specification of Concurrent Systems, La Colle-sur-Loup, France, pp. 46–78 (1984)
5. del Cerro, L.F.: A simple deduction method for modal logic. Inf. Process. Lett. 14(2), 49–51 (1982)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Non-iterative Modal Resolution Calculi;Lecture Notes in Computer Science;2024