Related papers: An ALC(D)-based combination of temporal constraint…
Signal Temporal Logic (STL) is a formal language over continuous-time signals (such as trajectories of a multi-agent system) that allows for the specification of complex spatial and temporal system requirements (such as staying sufficiently…
The present lack of a stable method to compare persistent homology groups with torsion is a relevant problem in current research about Persistent Homology and its applications in Pattern Recognition. In this paper we introduce a…
Dynamics and uncertainty are essential features of real-life argumentation, and many recent studies have focused on integrating both aspects into Dung's well-known abstract Argumentation Frameworks (AFs). This paper proposes a combination…
A temporal (constraint) language is a relational structure with a first-order definition in the rational numbers with the order. We study here the complexity of the Quantified Constraint Satisfaction Problem (QCSP) for temporal constraint…
The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…
Local convergence analysis of the augmented Lagrangian method (ALM) is established for a large class of composite optimization problems with nonunique Lagrange multipliers under a second-order sufficient condition. We present a new…
In our daily lives and industrial settings, we often encounter dynamic problems that require reasoning over time and metric constraints. These include tasks such as scheduling, routing, and production sequencing. Dynamic logics have…
Domain alignment in convolutional networks aims to learn the degree of layer-specific feature alignment beneficial to the joint learning of source and target datasets. While increasingly popular in convolutional networks, there have been no…
We classify simply-connected homogeneous ($D+1$)-dimensional spacetimes for kinematical and aristotelian Lie groups with $D$-dimensional space isotropy for all $D\geq 0$. Besides well-known spacetimes like Minkowski and (anti) de Sitter we…
It is shown here that in a flat, cold dark matter (CDM) dominated Universe with positive cosmological constant ($\Lambda$), modelled in terms of a Newtonian and collisionless fluid, particle trajectories are analytical in time…
In this work, the relativistic phenomena of Lorentz contraction and time dilation are derived using a modified distance formula appropriate for discrete space. This new distance formula is different than Pythagoras's theorem but converges…
The Poincar\'e sector of a recently deformed conformal algebra is proposed to describe, after the identification of the deformation parameter with the Planck length, the symmetries of a new relativistic theory with two observer-independent…
Temporal Logic (TL) guided control problems have gained interests in recent years. By using the TL, one can specify a wide range of temporal constraints on the system and is widely used in cyber-physical systems. On the other hand, Control…
Parallel computing is omnipresent in today's scientific computer landscape, starting at multicore processors in desktop computers up to massively parallel clusters. While domain decomposition methods have a long tradition in computational…
Temporal and dynamic extensions of Answer Set Programming (ASP) have played an important role in addressing dynamic problems, as they allow the use of temporal operators to reason with dynamic scenarios in a very effective way. In my Ph.D.…
We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic $\mathcal{DL}\langle \mathsf{4LQS^{R,\!\times}}\rangle(\mathbf{D})$…
Time series reasoning treats time as a first-class axis and incorporates intermediate evidence directly into the answer. This survey defines the problem and organizes the literature by reasoning topology with three families: direct…
Domain decomposition (DD) methods for solving time-dependent problems can be classified by (i) the method of domain decomposition used, (ii) the choice of decomposition operators (exchange of boundary conditions), and (iii) the splitting…
A predicate linear temporal logic LTL_{\lambda,=} without quantifiers but with predicate abstraction mechanism and equality is considered. The models of LTL_{\lambda,=} can be naturally seen as the systems of pebbles (flexible constants)…
This article introduces a novel approach to spatial database design. Instead of extending the canonical Solid-Face-Edge-Vertex schema by, say, "hypersolids" these classes are generalised to a common type SpatialEntity, and the individual…