The pseudo-Skolem Problem is decidable

The pseudo-Skolem Problem is decidable

We study fundamental decision problems on linear dynamical systems in discrete time. We focus on pseudo-orbits, the collection of trajectories of the dynamical system for which there is an arbitrarily small perturbation at each step. Pseudo-orbits are generalizations of orbits in the topological the...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	D'Costa, J, Karimov, T, Majumdar, R, Ouaknine, J, Salamati, M, Soudjani, S, Worrell, J
Formáid:	Conference item
Teanga:	English
Foilsithe / Cruthaithe:	Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021

Míreanna comhchosúla

On the Skolem problem and the Skolem conjecture
de réir: Lipton, RJ, et al.
Foilsithe / Cruthaithe: (2022)

The pseudo-reachability problem for diagonalisable linear dynamical systems
de réir: D'Costa, J, et al.
Foilsithe / Cruthaithe: (2022)

On the Skolem problem and prime powers
de réir: Ouaknine, J, et al.
Foilsithe / Cruthaithe: (2020)

On the skolem problem for continuous linear dynamical systems
de réir: Chonev, V, et al.
Foilsithe / Cruthaithe: (2016)

On the Skolem Problem for continuous linear dynamical systems
de réir: Ouaknine, J, et al.
Foilsithe / Cruthaithe: (2016)

Universal skolem sets
de réir: Luca, F, et al.
Foilsithe / Cruthaithe: (2021)

Skolem meets Schanuel
de réir: Bilu, Y, et al.
Foilsithe / Cruthaithe: (2022)

A universal Skolem set of positive lower density
de réir: Luca, F, et al.
Foilsithe / Cruthaithe: (2022)

On the decidability of Presburger arithmetic expanded with powers
de réir: Karimov, T, et al.
Foilsithe / Cruthaithe: (2025)

Deciding ω-regular properties on linear recurrence sequences
de réir: Almagor, S, et al.
Foilsithe / Cruthaithe: (2021)

The 2-dimensional constraint loop problem is decidable
de réir: Guilmant, Q, et al.
Foilsithe / Cruthaithe: (2024)

On the decidability of monadic second-order logic with arithmetic predicates
de réir: Berthé, V, et al.
Foilsithe / Cruthaithe: (2024)

What's decidable about linear loops?
de réir: Karimov, T, et al.
Foilsithe / Cruthaithe: (2022)

Safety metric temporal logic is fully decidable
de réir: Ouaknine, J, et al.
Foilsithe / Cruthaithe: (2006)

On the decidability of Metric Temporal Logic
de réir: Ouaknine, J, et al.
Foilsithe / Cruthaithe: (2005)

Nonnegativity problems for matrix semigroups
de réir: D'Costa, J, et al.
Foilsithe / Cruthaithe: (2024)

ON THE DECIDABILITY AND COMPLEXITY OF METRIC TEMPORAL LOGIC OVER FINITE WORDS
de réir: Ouaknine, J, et al.
Foilsithe / Cruthaithe: (2007)

On the decidability of membership in matrix-exponential semigroups
de réir: Ouaknine, J, et al.
Foilsithe / Cruthaithe: (2019)

On Robustness for the Skolem, Positivity and Ultimate Positivity Problems
de réir: S. Akshay, et al.
Foilsithe / Cruthaithe: (2024-06-01)

Complexity of restricted variants of Skolem and related problems
de réir: Akshay, S, et al.
Foilsithe / Cruthaithe: (2017)

On the decidability and complexity of Metric Temporal Logic over finite words
de réir: Joel Ouaknine, et al.
Foilsithe / Cruthaithe: (2007-02-01)

Decidability and complexity results for timed automata via channel machines
de réir: Abdulla, P, et al.
Foilsithe / Cruthaithe: (2005)

On the decidability of reachability in linear time-invariant systems
de réir: Fijalkow, N, et al.
Foilsithe / Cruthaithe: (2019)

On strong Skolem starters for ℤpq
de réir: Adrián Vázquez-Ávila
Foilsithe / Cruthaithe: (2020-09-01)

On Skolem odd and even difference mean graphs
de réir: Gee-Choon Lau, et al.
Foilsithe / Cruthaithe: (2018-04-01)

On the complexity of the Escape Problem for linear dynamical systems over compact semialgebraic sets
de réir: D'Costa, J, et al.
Foilsithe / Cruthaithe: (2021)

Skolem Number of Cycles and Grid Graphs
de réir: Braxton Carrigan, et al.
Foilsithe / Cruthaithe: (2021-08-01)

SET-THEORY, SKOLEMS-PARADOX AND THE 'TRACTATUS'
de réir: Moore, A
Foilsithe / Cruthaithe: (1985)

Sequent calculus Sk4 for skolemized formulas
de réir: Andrejus Belovas, et al.
Foilsithe / Cruthaithe: (2005-12-01)

How fast can you escape a compact polytope?
de réir: D'Costa, J, et al.
Foilsithe / Cruthaithe: (2020)

On LTL model-checking for low-dimensional discrete linear dynamical systems
de réir: Karimov, T, et al.
Foilsithe / Cruthaithe: (2020)

Towards skolemize clauses binding for reasoning in inference engine
de réir: Abdul Kadir, Rabiah, et al.
Foilsithe / Cruthaithe: (2007)

Interactive Realizability and the elimination of Skolem functions in Peano Arithmetic
de réir: Federico Aschieri, et al.
Foilsithe / Cruthaithe: (2012-10-01)

Deciding Bit−Vector Arithmetic with Abstraction
de réir: Bryant, R, et al.
Foilsithe / Cruthaithe: (2007)

Bounding the escape time of a linear dynamical system over a compact semialgebraic set
de réir: D'Costa, J, et al.
Foilsithe / Cruthaithe: (2022)

Decision Problems for Linear Recurrence Sequences.
de réir: Ouaknine, J, et al.
Foilsithe / Cruthaithe: (2012)

The Semialgebraic Orbit Problem
de réir: Almagor, S, et al.
Foilsithe / Cruthaithe: (2019)

The polytope-collision problem
de réir: Almagor, S, et al.
Foilsithe / Cruthaithe: (2017)

Intelligent information extraction using logical approach: skolemize clauses binding
de réir: Abdul Kadir, Rabiah, et al.
Foilsithe / Cruthaithe: (2008)

Retrieving answers from multiple documents using semantic skolem indexing
de réir: Varathan, Kasturi Dewi, et al.
Foilsithe / Cruthaithe: (2011)