Abstract
AbstractNon-monotonic modal logics are typically interpreted over neighbourhood frames. For unary operators, this is just a set of worlds, together with an endofunction on predicates (subsets of worlds). It is known that all systems of not necessarily monotonic modal logics that are axiomatised by formulae of modal rank at most one (non-iterative modal logics) are Kripke-complete over neighbourhood semantics. In this paper, we give a uniform construction to obtain complete resolution calculi for all non-iterative logics. We show completeness for generative calculi (where new clauses with new literals are added to the clause set) by means of a canonical model construction. We then define absorptive calculi (where new clauses are generated by generalised resolution rules) and establish completeness by translating between generative and absorptive calculi. Instances of our construction re-prove completeness for already known calculi, but also give rise to a number of previously unknown complete calculi.
Publisher
Springer Nature Switzerland
Reference24 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. Avron, A.: Gentzen-type systems, resolution and tableaux. J. Autom. Reason. 10(2), 265–281 (1993)
5. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)