Complete and Terminating Tableau for the Logic of Proper Subinterval Structures Over Dense Orderings

DOI10.1016/J.ENTCS.2009.02.033zbMATH Open1347.03032OpenAlexW2115440678MaRDI QIDQ4982118

Davide Bresolin

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.033

zbMATH Keywords

interval temporal logictableau methoddense structure

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35) Temporal logic (03B44) Logic in computer science (03B70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A propositional modal logic of time intervals
• An optimal decision procedure for right propositional neighborhood logic
• An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic
• A Decision Procedure and Complete Axiomatization of Finite Interval Temporal Logic with Projection
• Tableau Systems for Logics of Subinterval Structures over Dense Orderings
• Automated Reasoning with Analytic Tableaux and Related Methods
• Interval logics and their decision procedures. I: An interval logic
• On Decidability and Expressiveness of Propositional Interval Neighborhood Logics

Cited In (3)

• Mining approximate interval-based temporal dependencies
• Tableau Systems for Logics of Subinterval Structures over Dense Orderings
• On begins, meets and before

This page was built for publication: Complete and Terminating Tableau for the Logic of Proper Subinterval Structures Over Dense Orderings

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