Improved Second-Order Quantifier Elimination in Modal Logic

Authors:
Renate A. Schmidt
Affiliations:
School of Computer Science, The University of Manchester,
Venue:
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Year:
2008

Citing 3
Cited 0

Computing Circumscription Revisited: A Reduction Algorithm

Journal of Automated Reasoning
Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA

Journal of Logic and Computation
Second Order Quantifier Elimination: Foundations, Computational Aspects and Applications

Second Order Quantifier Elimination: Foundations, Computational Aspects and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces improvements for second-order quantifier elimination methods based on Ackermann's Lemma and investigates their application in modal correspondence theory. In particular, we define refined calculi and procedures for solving the problem of eliminating quantified propositional symbols from modal formulae. We prove correctness results and use the approach to compute first-order frame correspondence properties for modal axioms and modal rules. Our approach can solve two new classes of formulae which have wider scope than existing classes known to be solvable by second-order quantifier elimination methods.