Relational dual tableaux for interval temporal logics ★

  title={Relational dual tableaux for interval temporal logics ★},
  author={Davide Bresolin and Joanna Golinska-Pilarek and Ewa Orlowska},
  journal={Journal of Applied Non-Classical Logics},
  pages={251 - 277}
Interval temporal logics provide both an insight into a nature of time and a framework for temporal reasoning in various areas of computer science. In this paper we present sound and complete relational proof systems in the style of dual tableaux for relational logics associated with modal logics of temporal intervals and we prove that the systems enable us to verify validity and entailment of these temporal logics. We show how to incorporate in the systems various relations between intervals… 
8 Citations
Logics of similarity and their dual tableaux. A survey
Several classes of logics for reasoning with information stored in information systems enable us to cope with the phenomena of incompleteness of information and uncertainty of knowledge derived from such an information.
Reasoning on Relations, Modalities, and Sets
To set up a common ground, cross-translation methods among languages commonly used to work with relations, modalities, and sets, are revisited and automated support for reasoning based on the calculus of dyadic relations is reported on.
RESEARCH ARTICLE Implementing a Relational Theorem Prover for Modal Logic K
(Received 00 Month 200x; in nal form 00 Month 200x)An automatic theorem prover for a proof system in the style of dual tableaux for the relationallogic associated with modal logic K has been
Implementing a relational theorem prover for modal logic
An automatic theorem prover for a proof system in the style of dual tableaux for the relational logic associated with modal logic has been introduced, which would be the basis for successive extensions of this logic.
Reasoning about reversal-bounded counter machines
A proof is provided that is alternative to Ibarra’s original one for showing that reachability sets are effectively definable in Presburger arithmetic.
Signed Dual Tableaux for Kleene Answer Set Programs
A sound and complete proof procedure based on dual tableaux for classical first-order logic is presented.
Relational Attribute Systems II: Reasoning with Relations in Information Structures
We describe deduction mechanisms for various types of data bases with incomplete information, in particular, relational attribute systems, which we have introduced earlier in [8].


A General Tableau Method for Propositional Interval Temporal Logics
This paper provides BCDT + with a generic tableau method which combines features of explicit tableau methods for modal logics with constraint label management and the classical tableAU method for first-order logic, and proves its soundness and completeness.
A tableau-based decision procedure for a branching-time interval temporal logic
This paper develops a branching-time interval neighborhood logic that interleaves operators that quantify over possible timelines with operators that quantify over intervals belonging to a given timeline.
Decidability of Interval Temporal Logics over Split-Frames via Granularity
It is shown that there exists a straightforward correspondence between Split Logic and the first-order fragments of the monadic theories of time granularity proposed in the literature, which allows existing decidability results for such theories to be transferred to Split Logic.
Propositional Interval Neighborhood Temporal Logics
First, interval neighborhood frames are introduced and representation theorems for them are provided; then, complete axiomatic systems and semantic tableaux for logics in PNL are developed.
Labelled Natural Deduction for Interval Logics
A Labelled Natural Deduction framework is developed for interval logics with emphasis on Signed Interval Logic and it is shown that normal derivations satisfy a subformula property.
Relational Logics and Their Applications
Logics of binary relations corresponding to the class RRA of representable relation algebras and the class FRA of full relation alagbras are presented together with the proof systems in the style of dual tableaux and relational constants interpreted as point relations are extended.
Sharpening the Undecidability of Interval Temporal Logic
  • K. Lodaya
  • Philosophy, Computer Science
  • 2000
This paper works with the simplest (propositional) ITLs and discusses their decidability.
A Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic
This paper makes one step in this direction by devising an original tableau-based decision procedure for the future fragment of Propositional Neighborhood Interval Temporal Logic, interpreted over natural numbers.
A Road Map of Interval Temporal Logics and Duration Calculi
This work surveys main developments, results, and open problems on interval temporal logics and duration calculi and presents various formal systems studied in the literature, emphasizing on expressiveness, axiomatic systems, and (un)decidability results.