Improved second-order quantifier elimination in modal logic

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    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. © 2008 Springer-Verlag Berlin Heidelberg.
    Original languageEnglish
    Title of host publicationLogics in Artificial Intelligence
    Subtitle of host publication11th European Conference, JELIA 2008, Dresden, Germany, September 28-October 1, 2008. Proceedings
    EditorsSteffen Hölldobler, Carsten Lutz, Heinrich Wansing
    PublisherSpringer Nature
    Pages375-388
    Number of pages13
    Volume5293
    ISBN (Electronic)9783540878032
    ISBN (Print)9783540878025
    DOIs
    Publication statusPublished - 2008
    Event11th European Conference on Logics in Artificial Intelligence, JELIA 2008 - Dresden
    Duration: 1 Jul 2008 → …

    Publication series

    NameLecture Notes in Computer Science and Lecture Notes in Artificial Intelligence
    PublisherSpringer
    Volume5293
    ISSN (Print)0302-9743

    Conference

    Conference11th European Conference on Logics in Artificial Intelligence, JELIA 2008
    CityDresden
    Period1/07/08 → …

    Keywords

    • Computer Science, Artificial Intelligence

    Fingerprint

    Dive into the research topics of 'Improved second-order quantifier elimination in modal logic'. Together they form a unique fingerprint.

    Cite this