Terminating Tableau Calculi for Hybrid Logics Extending K
From MaRDI portal
Publication:4982112
DOI10.1016/j.entcs.2009.02.027zbMath1347.03039WikidataQ57813472 ScholiaQ57813472MaRDI QIDQ4982112
Publication date: 23 March 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2009.02.027
03B45: Modal logic (including the logic of norms)
03B70: Logic in computer science
03B35: Mechanization of proofs and logical operations
Related Items
A logic for diffusion in social networks, ExpTime tableaux with global caching for hybrid PDL, Extended decision procedure for a fragment of HL with binders, Why does the proof-theory of hybrid logic work so well?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nominal tense logic
- Modal logic with names
- Hybrid logics: characterization, interpolation and complexity
- Tableau-based Decision Procedures for Hybrid Logic
- Linguistics, Logic and Finite Trees
- Internalizing labelled deduction
- Computer Science Logic
- Termination for Hybrid Tableaus