Complexity hierarchies beyond elementary

S Schmitz - ACM Transactions on Computation Theory (TOCT), 2016 - dl.acm.org
We introduce a hierarchy of fast-growing complexity classes and show its suitability for
completeness statements of many nonelementary problems. This hierarchy allows the …

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 …

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 …

Horn fragments of the Halpern-Shoham interval temporal logic

D Bresolin, A Kurucz, E Muñoz-Velasco… - ACM Transactions on …, 2017 - dl.acm.org
We investigate the satisfiability problem for Horn fragments of the Halpern-Shoham interval
temporal logic depending on the type (box or diamond) of the interval modal operators, the …

Decidability of model checking multi-agent systems against a class of EHS specifications

AR Lomuscio, J Michaliszyn - ECAI 2014, 2014 - ebooks.iospress.nl
We define and illustrate the expressiveness of the fragment of the Epistemic Halpern–
Shoham Logic as a specification language for multi-agent systems. We consider the model …

The dark side of interval temporal logic: marking the undecidability border

D Bresolin, DD Monica, V Goranko, A Montanari… - Annals of Mathematics …, 2014 - Springer
Unlike the Moon, the dark side of interval temporal logics is the one we usually see: their
ubiquitous undecidability. Identifying minimal undecidable interval logics is thus a natural …