Hintikka Multiplicities in Matrix Decision Methods for Some Propositional Modal Logics

@inproceedings{Cerrito1997HintikkaMI,
  title={Hintikka Multiplicities in Matrix Decision Methods for Some Propositional Modal Logics},
  author={Serenella Cerrito and Marta Cialdea Mayer},
  booktitle={TABLEAUX},
  year={1997}
}
This work is a study of the inter-translatability of two closely related proof methods, i.e. tableau (or sequent) and connection based, in the case of the propositional modal logics K, K4, T, S4, paying particular attention to the relation between matrix multiplicity and multiple use of ν0-formulae (contractions) in tableaux/sequent proofs. 
Single Step Tableaux for Modal
TLDR
The paper presents a number of the computational results about SST (connu-ence, decidability, space complexity, query combination etc.) and compares SST with other formalisms such as translation methods, modal resolution and Gentzen-type tableaux and discusses the feasibility and unfeasibility of deriving decision procedures for SST.
Tableau-Based Reasoning for Decidable Fragments of First-Order Logic
TLDR
This thesis reviews existing work on incorporating unification into first-order and modal tableau procedures, shows how the closure fairness problem arises, and discusses existing solutions to it, and outlines a calculus which addresses theclosure fairness problem.
Exptime Tableaux for ALC
Single Step Tableaux for Modal Logics Computational Properties, Complexity and Methodology
TLDR
The paper presents a number of the computational results about SST (confluence, decidability, space complexity, modularity, etc.) and compares SST with other formalisms such as translation methods, modal resolution, and Gentzen-type tableaux and presents the methodology underlying the construction of the correctness and completeness proofs.
Single Step Tableaux for Modal Logics
  • F. Massacci
  • Mathematics
    Journal of Automated Reasoning
  • 2004
TLDR
The paper presents a number of the computational results about SST (confluence, decidability, space complexity, modularity, etc.) and compares SST with other formalisms such as translation methods, modal resolution, and Gentzen-type tableaux and the methodology underlying the construction of the correctness and completeness proofs is presented.
Integration of decision procedures into high-order interactive provers
TLDR
This work presents an implementation of several decision procedures for arithmetical formulas with linear terms in the MetaPRL proof assistant in a way that provides formal proofs of formulas found valid by those procedures.

References

SHOWING 1-10 OF 18 REFERENCES
Proof Methods for Modal and Intuitionistic Logics
One / Background.- Two / Analytic Modal Tableaus and Consistency Properties.- Three / Logical Consequence, Compactness, Interpolation, and Other Topics.- Four / Axiom Systems and Natural Deduction.-
Improved Decision Procedures for the Modal Logics K, T, and S4
TLDR
Deduction search in these calculi is shown to provide more efficient decision procedures than those hitherto known for three prominent modal logics K, T, and S4.
Matrix Proof Methods for Modal Logics
We present matrix proof systems for both constant- and varying-domain versions of the first-order modal logics K, K4, D, D4, T, 84 and 86 based on modal versions of Herbrand's Theorem specifically
Converting Non-Classical Matrix Proofs into Sequent-Style Systems
TLDR
A uniform algorithm for transforming matrix proofs in classical, constructive, and modal logics into sequent style proofs by using a similarity between matrix methods and Fitting's prefixed tableaus is presented.
A Polynomial Translation of S4 into T and Contraction-Free Tableaux for S4
TLDR
Tableau proof-systems are used to show that Fitting's translation of the transitive modal logic S4 into T can be constructed in deterministic polynomial time, and Mints'stranslation of modal formulae into modal clauses is used to obtain a complete contraction free fragment of the sequent calculus for S4.
Efficient Loop-Check for Backward Proof Search in Some Non-classical Propositional Logics
We consider the modal logics KT and S4, the tense logic Kt, and the fragment IPC(∧,→) of intuitionistic logic.
Strongly Analytic Tableaux for Normal Modal Logics
TLDR
A strong analytic tableau calculus is presentend for the most common normal modal logics, which combines the advantages of both sequent-like tableaux and prefixed tableaux, and satisfies the strong Church Rosser property and can be fully parallelized.
The Computational Complexity of Provability in Systems of Modal Propositional Logic
  • R. Ladner
  • Computer Science, Mathematics
    SIAM J. Comput.
  • 1977
The computational complexity of the provability problem in systems of modal propositional logic is investigated. Every problem computable in polynomial space is $\log $ space reducible to the
On Transforming Intuitionistic Matrix Proofs into Standard-Sequent Proofs
TLDR
A procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus based on L. Wallen's proof justifying his matrix characterization for the validity of intuitionistic formulae is presented.
Problem-Oriented Applications of Automated Theorem Proving
TLDR
An overall view of an approach to developing a coherent ATP-system which can deal with a variety of logics and with different applications in a tailored way is provided.
...
...