Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals (Q1740653): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2922221412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Fragments of the Modal Logic of Allen’s Relations over Dense Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking interval properties of computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duration calculus. A formal approach to real-time systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining knowledge about temporal intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A propositional modal logic of time intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dark side of interval temporal logic: marking the undecidability border / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval temporal logics over strongly discrete linear orders: expressiveness and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable and Undecidable Fragments of Halpern and Shoham’s Interval Temporal Logic: Towards a Complete Classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tableaux for Logics of Subinterval Structures over Dense Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decidable weakening of Compass Logic based on cone-shaped cardinal directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intervals and tenses / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical study of distributed transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness and completeness of an interval tense logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy Counter Machines Decidability Cheat Sheet / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Importance of the Past in Interval Temporal Logics: The Case of Propositional Neighborhood Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE TEMPORAL LOGIC OF TWO DIMENSIONAL MINKOWSKI SPACETIME IS DECIDABLE / rank
 
Normal rank

Revision as of 03:45, 19 July 2024

scientific article
Language Label Description Also known as
English
Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
scientific article

    Statements

    Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 May 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    interval temporal logics
    0 references
    satisfiability
    0 references
    decidability
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references