相关论文: Converging to the Chase - a Tool for Finite Contro…
Deep sequence models are receiving significant interest in current machine learning research. By representing probability distributions that are fit to data using maximum likelihood estimation, such models can model data on general…
Given a finite-dimensional time continuous control system and $\varepsilon>0$, we address the question of the existence of controls that maintain the corresponding state trajectories in the $\varepsilon$-neighborhood of any prescribed path…
We show that all--instances termination of chase is undecidable. More precisely, there is no algorithm deciding, for a given set $\cal T$ consisting of Tuple Generating Dependencies (a.k.a. Datalog$^\exists$ program), whether the $\cal…
This paper describes the reachable set and resolves an optimal control problem for the scalar conservation laws with discontinuous flux. We give a necessary and sufficient criteria for the reachable set. A new backward resolution has been…
We develop a new numerical method for approximating the infinite time reachable set of strictly stable linear control systems. By solving a linear program with a constraint that incorporates the system dynamics, we compute a polytope with…
Existential rules, long known as tuple-generating dependencies in database theory, have been intensively studied in the last decade as a powerful formalism to represent ontological knowledge in the context of ontology-based query answering.…
We consider the problem of approximating discrete-time plants with finite-valued sensors and actu- ators by deterministic finite memory systems for the purpose of certified-by-design controller synthesis. Building on ideas from robust…
`Trackability', the ability of systems to follow arbitrary reference commands, is investigated in this work. Controllability is not useful in explaining the tracking behavior of system outputs, a gap that is often overlooked. Trackability…
Weakly-sticky (WS) Datalog+/- is an expressive member of the family of Datalog+/- programs that is based on the syntactic notions of stickiness and weak-acyclicity. Query answering over the WS programs has been investigated, but there is…
Programs with constraints are hard to debug. In this paper, we describe a general architecture to help develop new debugging tools for constraint programming. The possible tools are fed by a single general-purpose tracer. A tracer-driver is…
Object tracking systems play important roles in tracking moving objects and overcoming problems such as safety, security and other location-related applications. Problems arise from the difficulties in creating a well-defined and…
We propose a new concept of strong controllability associated with the Schur complement of a suitable limiting matrix. This concept allows us to extend the previous results associated with multidimensional ARX models. On the one hand, we…
We study the linearizability monitoring problem, which asks whether a given concurrent history of a data structure is equivalent to some sequential execution of the same data structure. In general, this problem is $\textsf{NP}$-hard, even…
Existential rules have been proposed for representing ontological knowledge, specifically in the context of Ontology- Based Data Access. Entailment with existential rules is undecidable. We focus in this paper on conditions that ensure the…
We study pure exploration problems in which the set of correct answers is possibly infinite. For example, such problems arise when regressing a continuous function on the means of the bandit or when learning Nash equilibria by querying…
In this article, we address the control problem of unicycle path following, using a rigidly attached target point. The initial path following problem has been transformed into a reference trajectory following problem, using saturated…
Reachability analysis, in general, is a fundamental method that supports formally-correct synthesis, robust model predictive control, set-based observers, fault detection, invariant computation, and conformance checking, to name but a few.…
A numerical method is proposed for a class of stochastic control problems including singular behavior. This method solves an infinite-dimensional linear program equivalent to the stochastic control problem using a finite element type…
Ontology-based query answering (OBQA) asks whether a Boolean conjunctive query is satisfied by all models of a logical theory consisting of a relational database paired with an ontology. The introduction of existential rules (i.e., Datalog…
We address the problem of efficiently evaluating target functional dependencies (fds) in the Data Exchange (DE) process. Target fds naturally occur in many DE scenarios, including the ones in Life Sciences in which multiple source relations…