Single Step Tableaux for Modal Logics

Authors:
Fabio Massacci
Affiliations:
Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, via Salaria 113, 00198 Roma, Italy, e-mail: massacci@dis.uniroma1.it
Venue:
Journal of Automated Reasoning
Year:
2000

Citing 24
Cited 23

First-order modal tableaux

Journal of Automated Reasoning
Modal resolution in clausal form

Theoretical Computer Science
Automated deduction in nonclassical logics

Automated deduction in nonclassical logics
A catalog of complexity classes

Handbook of theoretical computer science (vol. A)
A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
Modal nonmonotonic logics: ranges, characterization, computation

Journal of the ACM (JACM)
Basic modal logic

Handbook of logic in artificial intelligence and logic programming (vol. 1)
Reasoning about knowledge

Reasoning about knowledge
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Gentzen-type systems and resolution rules. Part I. Propositional logic

COLOG '88 Proceedings of the International Conference on Computer Logic
Gentzen Style Systems for K45 and K45D

Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
Efficient Loop-Check for Backward Proof Search in Some Non-classical Propositional Logics

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Free Variable Tableaux for Propositional Modal Logics

TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Hintikka Multiplicities in Matrix Decision Methods for Some Propositional Modal Logics

TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Resolution Calculus for Modal Logics

Proceedings of the 9th International Conference on Automated Deduction
Strongly Analytic Tableaux for Normal Modal Logics

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Tableaux and Algorithms for Propositional Dynamic Logic with Converse

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Converting Non-Classical Matrix Proofs into Sequent-Style Systems

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
On evaluating decision procedures for modal logic

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Contextual reasoning is NP-complete

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Metamathematics Of Contexts

Fundamenta Informaticae

Tableaux for Reasoning About Atomic Updates

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Analytic Tableau Systems for Propositional Bimodal Logics of Knowledge and Belief

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Lotrec: The Generic Tableau Prover for Modal and Description Logics

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Connections in nonclassical logics

Handbook of automated reasoning
A polynomial space construction of tree-like models for logics with local chains of modal connectives

Theoretical Computer Science
Deciding Regular Grammar Logics with Converse Through First-Order Logic

Journal of Logic, Language and Information
Computational Complexity of Multimodal Logics Based on Rough Sets

Fundamenta Informaticae
The axiomatic translation principle for modal logic

ACM Transactions on Computational Logic (TOCL)
Tableaux with Dynamic Filtration for Layered Modal Logics

TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Termination of Derivations in a Fragment of Transitive Distributed Knowledge Logic

Informatica
Decision Procedures for a Deontic Logic Modeling Temporal Inheritance of Obligations

Electronic Notes in Theoretical Computer Science (ENTCS)
Clausal Tableaux for Multimodal Logics of Belief

Fundamenta Informaticae
Automated reasoning in modal and description logics via SAT encoding: the case study of KmALC-satisfiability

Journal of Artificial Intelligence Research
Decision Procedures for Expressive Description Logics with Intersection, Composition, Converse of Roles and Role Identity

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A new methodology for developing deduction methods

Annals of Mathematics and Artificial Intelligence
Approximations of Modal Logic K

Electronic Notes in Theoretical Computer Science (ENTCS)
Clausal graph tableaux for hybrid logic with eventualities and difference

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Synthesising terminating tableau calculi for relational logics

RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
LoTREC: logical tableaux research engineering companion

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Encoding the satisfiability of modal and description logics into SAT: the case study of K(m)/ALC

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Clausal Tableaux for Multimodal Logics of Belief

Fundamenta Informaticae
The Nondeterministic Information Logic NIL is PSPACE-complete

Fundamenta Informaticae
Computational Complexity of Multimodal Logics \newline Based on Rough Sets

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Single Step Tableaux (SST) are the basis of a calculus for modal logics that combines different features of sequent and prefixed tableaux into a simple, modular, strongly analytic, and effective calculus for a wide range of modal logics.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. For instance, it discusses the feasibility and infeasibility of deriving decision procedures for SST and translation-based methods by replacing loop checking techniques with simpler termination checks.The complexity of searching for validity and logical consequence with SST and other methods is discussed. Minimal conditions on SST search strategies are proven to yield Pspace (and NPtime for S5 and KD45) decision procedures. The paper also presents the methodology underlying the construction of the correctness and completeness proofs.