Data-aware hybrid tableaux

DOI10.46298/LMCS-21(4:26)2025MaRDI QIDQ6858426zbMATH OpenFDO

Authors Carlos Areces, Valentin Cassano, Raul Fervari

Publication date 13 February 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-21(4:26)2025

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• A Researcher's Digest of GQL (invited talk)
• A sequent calculus for a modal logic on finite data trees
• A short introduction to SHACL for logicians
• Advances in database technology -- EDBT 2004. 9th international conference on extending database technology, Heraklion, Crete, Greece, March 14--18, 2004. Proceedings.
• An introduction to non-classical logic. From if to is
• Axiomatizations for downward XPath on data trees
• Axiomatizing the logical core of XPath 2.0
• Complete axiomatizations for XPath fragments
• Data graphs with incomplete information (and a way to complete them)
• Decidability of downward XPath
• Definability for downward and vertical XPath on data trees
• Finite-memory automata
• Hilbert-style axiomatization for hybrid XPath with data
• HTab: a terminating tableaux system for hybrid logic
• scientific article; zbMATH DE number 5999538 (Why is no real title available?)
• scientific article; zbMATH DE number 837700 (Why is no real title available?)
• scientific article; zbMATH DE number 7407777 (Why is no real title available?)
• scientific article; zbMATH DE number 3274715 (Why is no real title available?)
• Hybrid languages
• Hybrid logic and its proof-theory
• Internalizing labelled deduction
• Logic, language, information, and computation. 27th international workshop, WoLLIC 2021, virtual event, October 5--8, 2021. Proceedings
• Modal logic
• Model theory of XPath on data trees. I: Bisimulation and characterization
• Model theory of XPath on data trees. II: Binary bisimulation and definability
• Proof methods for modal and intuitionistic logics
• Pure extensions, proof rules, and hybrid axiomatics
• Termination for Hybrid Tableaus
• The computational complexity of hybrid temporal logics
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Two-variable logic on data trees and XML reasoning
• Why does the proof-theory of hybrid logic work so well?
• XPath satisfiability in the presence of DTDs

This page was built for publication: Data-aware hybrid tableaux

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858426)