Terminating Tableau Systems for Hybrid Logic with Difference and Converse

Authors:
Mark Kaminski;Gert Smolka
Affiliations:
Department of Computer Science, Saarland University, Saarbrücken, Germany 66123;Department of Computer Science, Saarland University, Saarbrücken, Germany 66123
Venue:
Journal of Logic, Language and Information
Year:
2009

Citing 6
Cited 12

A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
Modal logic

Modal logic
Higher-Order Syntax and Saturation Algorithms for Hybrid Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
A Tableau Decision Procedure for $\mathcal{SHOIQ}$

Journal of Automated Reasoning
Hybrid Tableaux for the Difference Modality

Electronic Notes in Theoretical Computer Science (ENTCS)
Prefixed tableaux systems for modal logics with enriched languages

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1

Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Spartacus: A Tableau Prover for Hybrid Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Combining logics in simple type theory

CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Verifying the modal logic cube is an easy task: for higher-order automated reasoners

Verification, induction termination analysis
Verifying the modal logic cube is an easy task: for higher-order automated reasoners

Verification, induction termination analysis
A tableaux based decision procedure for a broad class of hybrid formulae with binders

TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Combining and automating classical and non-classical logics in classical higher-order logics

Annals of Mathematics and Artificial Intelligence
Terminating tableaux for hybrid logic with eventualities

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
A Tableau Based Decision Procedure for an Expressive Fragment of Hybrid Logic with Binders, Converse and Global Modalities

Journal of Automated Reasoning
A proof procedure for hybrid logic with binders, transitivity and relation hierarchies

CADE'13 Proceedings of the 24th international conference on Automated Deduction
InKreSAT: modal reasoning via incremental reduction to SAT

CADE'13 Proceedings of the 24th international conference on Automated Deduction
A Goal-Directed Decision Procedure for Hybrid PDL

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper contributes to the principled construction of tableau-based decision procedures for hybrid logic with global, difference, and converse modalities. We also consider reflexive and transitive relations. For converse-free formulas we present a terminating control that does not rely on the usual chain-based blocking scheme. Our tableau systems are based on a new model existence theorem.