Clausal graph tableaux for hybrid logic with eventualities and difference

Authors:
Mark Kaminski;Gert Smolka
Affiliations:
Saarland University, Saarbrücken, Germany;Saarland University, Saarbrücken, Germany
Venue:
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Year:
2010

Citing 15
Cited 1

“Sometimes” and “not never” revisited: on branching versus linear time temporal logic

Journal of the ACM (JACM) - The MIT Press scientific computation series
Synthesis of Communicating Processes from Temporal Logic Specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Modal logic

Modal logic
Dynamic Logic

Dynamic Logic
Single Step Tableaux for Modal Logics

Journal of Automated Reasoning
A New Space Bound for the Modal Logics K4, KD4 and S4

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
A Decision Algorithm for Full Propositional Temporal Logic

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
The Hybrid µ-Calculus

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Handbook of Modal Logic, Volume 3 (Studies in Logic and Practical Reasoning)

Handbook of Modal Logic, Volume 3 (Studies in Logic and Practical Reasoning)
Optimizing Terminological Reasoning for Expressive Description Logics

Journal of Automated Reasoning
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies

TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Clausal Tableaux for Multimodal Logics of Belief

Fundamenta Informaticae
Optimal and cut-free tableaux for propositional dynamic logic with converse

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Terminating tableaux for hybrid logic with eventualities

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning

Correctness and worst-case optimality of Pratt-style decision procedures for modal and hybrid logics

TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods

Quantified Score

Hi-index	0.02

Visualization

Abstract

We introduce the method of clausal graph tableaux at the example of hybrid logic with difference and star modalities. Clausal graph tableaux are prefix-free and terminate by construction. They provide an abstract method of establishing the small model property of modal logics. In contrast to the filtration method, clausal graph tableaux result in goal-directed decision procedures. Until now no goal-directed decision procedure for the logic considered in this paper was known. There is the promise that clausal graph tableaux lead to a new class of effective decision procedures.