A Minimal Hybrid Logic for Intervals

DOI10.1093/JIGPAL/JZK003zbMath1102.03013OpenAlexW2120506667MaRDI QIDQ5479023

Altaf Hussain

Publication date: 6 July 2006

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/94b97a7578dd22604d3de00ebad761152b12591d

zbMATH Keywords

complexitydecidabilitysatisfiability problemtableau methodbulldozinginterval hybrid temporal logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

This page was built for publication: A Minimal Hybrid Logic for Intervals