[HTML][HTML] Stanford encyclopedia of philosophy

E Zalta - 2012 - philpapers.org
Ed Zalta (ed.), Stanford Encyclopedia of Philosophy - PhilPapers Sign in | Create an account
PhilPapers PhilPeople PhilArchive PhilEvents PhilJobs PhilPapers home Syntax Advanced …

[PDF][PDF] Ontologies of Time: Review and Trends.

V Ermolayev, S Batsakis, N Keberle… - … Journal of Computer …, 2014 - researchgate.net
Time, as a phenomenon, has been in the focus of scientific thought from ancient times. It
continues to be an important subject of research in many disciplines due to its importance as …

A survey on temporal logics for specifying and verifying real-time systems

S Konur - Frontiers of Computer Science, 2013 - Springer
Over the last two decades, there has been an extensive study of logical formalisms on
specifying and verifying real-time systems. Temporal logics have been an important …

The era of big spatial data

A Eldawy, MF Mokbel - 2015 31st IEEE International …, 2015 - ieeexplore.ieee.org
The recent explosion in the amount of spatial data calls for specialized systems to handle
big spatial data. In this paper, we discuss the main features and components that needs to …

Color constancy and non-uniform illumination: Can existing algorithms work?

M Bleier, C Riess, S Beigpour… - … on computer vision …, 2011 - ieeexplore.ieee.org
The color and distribution of illuminants can significantly alter the appearance of a scene.
The goal of color constancy (CC) is to remove the color bias introduced by the illuminants …

[PDF][PDF] Interval temporal logics: a journey

D Della Monica, V Goranko, A Montanari… - Bulletin of …, 2013 - smtp.eatcs.org
We discuss a family of modal logics for reasoning about relational structures of intervals over
(usually) linear orders, with modal operators associated with the various binary relations …

Checking interval properties of computations

A Molinari, A Montanari, A Murano, G Perelli, A Peron - Acta Informatica, 2016 - Springer
Abstract Model checking is a powerful method widely explored in formal verification. Given a
model of a system, eg, a Kripke structure, and a formula specifying its expected behaviour …

Maximal decidable fragments of Halpern and Shoham's modal logic of intervals

A Montanari, G Puppis, P Sala - International Colloquium on Automata …, 2010 - Springer
In this paper, we focus our attention on the fragment of Halpern and Shoham's modal logic of
intervals (HS) that features four modal operators corresponding to the relations “meets”,“met …

The undecidability of the logic of subintervals

J Marcinkowski, J Michaliszyn - Fundamenta Informaticae, 2014 - content.iospress.com
Abstract The Halpern–Shoham logic is a modal logic of time intervals. Some effort has been
put in last ten years to classify fragments of this beautiful logic with respect to decidability of …

[HTML][HTML] Interval temporal logics over strongly discrete linear orders: Expressiveness and complexity

D Bresolin, D Della Monica, A Montanari, P Sala… - Theoretical Computer …, 2014 - Elsevier
Interval temporal logics provide a natural framework for temporal reasoning about interval
structures over linearly ordered domains, where intervals are taken as the primitive …