Hybrid Tableaux for the Difference Modality

Authors:
Mark Kaminski;Gert Smolka
Affiliations:
Programming Systems Lab, Saarland University, Saarbrücken, Germany;Programming Systems Lab, Saarland University, Saarbrücken, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 8
Cited 3

Type-logical semantics

Type-logical semantics
EXPTIME tableaux for ALC

Artificial Intelligence
Modal logic

Modal logic
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
A Simple Tableau System for the Logic of Elsewhere

TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Higher-Order Syntax and Saturation Algorithms for Hybrid Logic

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 Tableau Systems for Hybrid Logic with Difference and Converse

Journal of Logic, Language and Information
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)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first tableau-based decision procedure for basic hybrid logic with the difference modality. The decision procedure is gracefully degrading in that the less expressive constructs don't pay for the computationally expensive difference modality. The procedure can be specialized to reflexive and transitive frames. Key features of our approach are nominal elimination, pattern-based blocking, and expansion control.