Reasoning with Time Intervals: A Logical and Computational Perspective | Zendy

Guido Sciavicco | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Reasoning with Time Intervals: A Logical and Computational Perspective

Author(s) -

Guido Sciavicco

Publication year - 2012

Publication title -

isrn artificial intelligence

Language(s) - English

Resource type - Journals

eISSN - 2090-7443

pISSN - 2090-7435

DOI - 10.5402/2012/616087

Subject(s) - decidability , modal logic , generalization , perspective (graphical) , interval (graph theory) , modal , interval temporal logic , computer science , satisfiability , field (mathematics) , point (geometry) , artificial intelligence , mathematics , algorithm , linear temporal logic , pure mathematics , combinatorics , mathematical analysis , chemistry , geometry , polymer chemistry

The role of time in artificial intelligence is extremely important. Interval-based temporal reasoning can be seen as a generalization of the classical point-based one, and the first results in this field date back to Hamblin (1972) and Benhtem (1991) from the philosophical point of view, to Allen (1983) from the algebraic and first-order one, and to Halpern and Shoham (1991) from the modal logic one. Without purporting to provide a comprehensive survey of the field, we take the reader to a journey through the main developments in modal and first-order interval temporal reasoning over the past ten years and outline some landmark results on expressiveness and (un)decidability of the satisfiability problem for the family of modal interval logics.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research