Interval prediction can be more useful than single value prediction in many continuous data streams. This paper introduces a novel Interval Prediction Tree IP3 algorithm for interval prediction of numerical target variables from temporal mean-variance aggregated continuous data. This algorithm characterized by: processing incoming mean-variance aggregated multivariate temporal data, splitting e...

The clinical narrative contains a great deal of valuable information that is only understandable in a temporal context. Events, time expressions, and temporal relations convey information about the time course of a patient’s clinical record that must be understood for many applications of interest. In this paper, we focus on extracting information about how time expressions and events are relat...

The paper provides an assessment of Tuz Gölü, a site in Turkey proposed for the radiometric vicarious calibration of satellite sensors, in terms of its spatial homogeneity as expressed in visible and near-infrared (VNIR) wavelengths over a 25-year period (1984–2009). By combining the coefficient of variation (CV) and Getis statistic (Gi*), a spatially homogenous and temporally stable area at le...

the use of satellite data in an estimation of air temperature (ta) near the earth’s surface has turned into an effective way for a large area of high spatial and temporal resolution. throughout the present study, artificial neural network (ann) as well as m5 model tree were employed to estimate ta in khuzestan province (south west of iran), using satellite remotely sensed land surface temperatu...

Most autonomous robotic agents use logic inference to keep themselves to safe and permitted behaviour. Given a set of rules, it is important that the robot is able to establish the consistency between its rules, its perception-based beliefs, its planned actions and their consequences. This paper investigates how a robotic agent can use model checking to examine the consistency of its rules, bel...

Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL) are often used to describe specifications of probabilistic properties for discrete time and continuous time, respectively. In PCTL and CSL, the possibility of executions satisfying some temporal properties can be quantitatively represented by the probabilistic extension of the path quantifiers in their basic Compu...

Currently known sequent systems for temporal logics such as linear time temporal logic and computation tree logic either rely on a cut rule, an invariant rule, or an infinitary rule. The first and second violate the subformula property and the third has infinitely many premises. We present finitary cut-free invariant-free weakeningfree and contraction-free sequent systems for both logics mentio...

We propose a validity preserving translation from a subset of epistemic Alternating-time Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and decidable model-checking. This entails the decidability of validity but the implied algorithm is unfeasible. Reducing the validity problem to that in a corres...

Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automata-theoretic techniques have long been thought to introduce an exponential penalty, making them essentially useless for mod...

LTL synthesis is the process of generating a reactive finite-state system from a formal specification written in Linear Temporal Logic (LTL). The idea of synthesis is to automatically construct a functional correct system from a behavioral description of the system. Even though the idea is nearly fifty years old and the underlying theory is well established, is has not be adapted to practice ye...