Alternating-time Temporal Logic (ATL) and Coalition (CL) are well-established logical formalisms particularly suitable to model games between dynamic coalitions of agents (like e.g. the system environment). Recently, ATL formalism has been extended in order take into account boundedness resources needed for a task be performed. The resulting logic, called Resource-Bounded (RB-ATL), presented quite variety scenarios. Even if checking problem extensions dealing with resource bounds is usually...

We compare the expressiveness of fragments Halpern and Shoham's interval logic (HS), i.e., all logics with modal operators associated Allen's relations between intervals in linear orders. establish a complete set inter-definability equations these operators, thus obtain classification family 212 HS respect to their expressiveness. Using that result computer program, we have found there are 1347 expressively different such over class

Unlike the Moon, dark side of interval temporal logics is one we usually see: their ubiquitous undesirability. Identifying minimal undecidable thus a natural and important issue in research agenda area. The decidability status logic often depends on class models (in our case, structures)in which it interpreted. In this paper, have identified several new amongst fragments Halpern-Shoham HS, including overlaps relation, over classes all finite linear orders, as well meet subinterval relations,...

Temporal reasoning plays an important role in artificial intelligence. logics provide a natural framework for its formalization and implementation. A standard way of enhancing the expressive power temporal is to replace their unidimensional domain by multidimensional one. In particular, such dimensional increase can be exploited obtain spatial counterparts logics. Unfortunately, it often involves blow up complexity, possibly losing decidability. this paper, we propose generalization...

The validity/satisfiability problem for most propositional interval temporal logics is (highly) undecidable, under very weak assumptions on the class of structures in which they are interpreted. That, particular, holds fragments Halpern and Shoham's modal logic HS. Still, decidability rule HS with only one operator, based an Allen's relation. In this paper, we show that O Overlap relation, when interpreted over discrete linear orderings, exception. proof a reduction from undecidable octant...

Verification of multi-agents systems (MAS) has been recently studied taking into account the need expressing resource bounds. Several logics for specifying properties MAS have presented in quite a variety scenarios with bounded resources. In this paper, we study different formalism, called Priced Resource-Bounded Alternating-time Temporal Logic (PRBATL), whose main novelty consists moving notion resources from syntactic level (part formula) to semantic one model). This allows us track...

We investigate fragments of Halpern-Shoham's interval logic HS involving the modal operators for relations left or right overlap intervals. prove that most these are undecidable, by employing a non-trivial reduction from octant tiling problem.

In the setting of modal logic that characterizes refinement over transition systems, Boudol and Larsen showed formulae for which model checking can be reduced to preorder checking, is, characteristic formulae, are exactly consistent prime ones. This paper presents general, sufficient conditions guaranteeing It is shown given apply various behavioural relations in literature. particular, ones all semantics van Glabbeek's linear time-branching time spectrum.

Interval temporal logics provide a general framework for reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. In this paper, we identify all fragments of Halpern and Shoham's logic HS with decidable satisfiability problem class strongly discrete linear orders. We classify them in terms both their relative expressive power complexity. show that there exactly 44 expressively different fragments, whose complexity...

Within the timeline-based framework, planning problems are modeled as sets of independent, but interacting, components whose behavior over time is described by a set temporal constraints. Timeline-based being used successfully in number complex tasks, its theoretical properties not so well studied. In particular, while it known that Linear Temporal Logic (LTL) can capture classical action-based planning, similar logical characterization was available for formalisms. This paper shows with...

In several domains, systems generate continuous streams of data during their execution, including meaningful telemetry information, that can be used to perform tasks like preemptive failure detection. Deep learning models have been exploited for these with increasing success, but they hardly provide guarantees over a problem which is exacerbated by lack interpretability. many critical contexts, formal methods, ensure the correct behavior system, are thus necessary. However, specifying in...