The Complexity of Learning Temporal Properties
Fuente:
arXiv
Saved in:
| Main Authors: | Bordais, Benjamin, Neider, Daniel, Roy, Rajarshi |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Learning Branching-Time Properties in CTL and ATL via Constraint Solving
by: Bordais, Benjamin, et al.
Published: (2024)
by: Bordais, Benjamin, et al.
Published: (2024)
A framework for computing upper bounds in passive learning settings
by: Bordais, Benjamin, et al.
Published: (2025)
by: Bordais, Benjamin, et al.
Published: (2025)
What is Formal Verification without Specifications? A Survey on mining LTL Specifications
by: Neider, Daniel, et al.
Published: (2025)
by: Neider, Daniel, et al.
Published: (2025)
Multi-Environment MDPs with Prior and Universal Semantics
by: Bordais, Benjamin, et al.
Published: (2026)
by: Bordais, Benjamin, et al.
Published: (2026)
Robust Computation Tree Logic
by: Nayak, Satya Prakash, et al.
Published: (2022)
by: Nayak, Satya Prakash, et al.
Published: (2022)
Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
by: Ye, Lina, et al.
Published: (2023)
by: Ye, Lina, et al.
Published: (2023)
Learning Probabilistic Temporal Logic Specifications for Stochastic Systems
by: Roy, Rajarshi, et al.
Published: (2025)
by: Roy, Rajarshi, et al.
Published: (2025)
Learning DFAs from Positive Examples Only via Word Counting
by: Bordais, Benjamin, et al.
Published: (2025)
by: Bordais, Benjamin, et al.
Published: (2025)
Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime
by: Nayak, Satya Prakash, et al.
Published: (2022)
by: Nayak, Satya Prakash, et al.
Published: (2022)
A Cegar-centric Bounded Reachability Analysis for Compositional Affine Hybrid Systems
by: Kundu, Atanu, et al.
Published: (2025)
by: Kundu, Atanu, et al.
Published: (2025)
Closure and Complexity of Temporal Causality
by: Carelli, Mishel, et al.
Published: (2025)
by: Carelli, Mishel, et al.
Published: (2025)
Multi-Property Temporal Logic Monitoring
by: Demir, Arınç, et al.
Published: (2026)
by: Demir, Arınç, et al.
Published: (2026)
VeriFlow: Modeling Distributions for Neural Network Verification
by: Zaid, Faried Abu, et al.
Published: (2024)
by: Zaid, Faried Abu, et al.
Published: (2024)
Positional Properties in Temporal Logic
by: Newman, Jessica, et al.
Published: (2026)
by: Newman, Jessica, et al.
Published: (2026)
Dependence Logics in Temporal Settings
by: Baltag, Alexandru, et al.
Published: (2022)
by: Baltag, Alexandru, et al.
Published: (2022)
Complexity of Safety and coSafety Fragments of Linear Temporal Logic
by: Artale, Alessandro, et al.
Published: (2022)
by: Artale, Alessandro, et al.
Published: (2022)
POLIMON: Checking Temporal Properties over Out-of-order Streams at Runtime
by: Klaedtke, Felix
Published: (2024)
by: Klaedtke, Felix
Published: (2024)
Cyclic Implicit Complexity
by: Curzi, Gianluca, et al.
Published: (2021)
by: Curzi, Gianluca, et al.
Published: (2021)
Guarded Successor: A Novel Temporal Logic
by: Asor, Ohad
Published: (2024)
by: Asor, Ohad
Published: (2024)
The Complexity of the Constructive Master Modality
by: Santiago-Fernández, Sofía, et al.
Published: (2026)
by: Santiago-Fernández, Sofía, et al.
Published: (2026)
A Linear Temporal Logic of Frequencies on Series of Events
by: Antonelli, Melissa, et al.
Published: (2026)
by: Antonelli, Melissa, et al.
Published: (2026)
Cumulative-Time Signal Temporal Logic
by: Chen, Hongkai, et al.
Published: (2025)
by: Chen, Hongkai, et al.
Published: (2025)
Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
by: Afshari, Bahareh, et al.
Published: (2024)
by: Afshari, Bahareh, et al.
Published: (2024)
Universal Horn Sentences and the Joint Embedding Property
by: Bodirsky, Manuel, et al.
Published: (2021)
by: Bodirsky, Manuel, et al.
Published: (2021)
Hyperarithmetical Complexity of Infinitary Action Logic with Multiplexing
by: Pshenitsyn, Tikhon
Published: (2023)
by: Pshenitsyn, Tikhon
Published: (2023)
About Time: Model-free Reinforcement Learning with Timed Reward Machines
by: Roy, Rajarshi, et al.
Published: (2025)
by: Roy, Rajarshi, et al.
Published: (2025)
Complexity of the Model Checking problem for inquisitive propositional and modal logic
by: Grilletti, Gianluca, et al.
Published: (2024)
by: Grilletti, Gianluca, et al.
Published: (2024)
Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)
On the Metric Temporal Logic for Continuous Stochastic Processes
by: Ikeda, Mitsumasa, et al.
Published: (2023)
by: Ikeda, Mitsumasa, et al.
Published: (2023)
Skill Machines: Temporal Logic Skill Composition in Reinforcement Learning
by: Tasse, Geraud Nangue, et al.
Published: (2022)
by: Tasse, Geraud Nangue, et al.
Published: (2022)
Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)
by: Oliveira, Igor C.
Published: (2025)
GradSTL: Comprehensive Signal Temporal Logic for Neurosymbolic Reasoning and Learning
by: Chevallier, Mark, et al.
Published: (2025)
by: Chevallier, Mark, et al.
Published: (2025)
Shininess, strong politeness, and unicorns
by: Przybocki, Benjamin, et al.
Published: (2025)
by: Przybocki, Benjamin, et al.
Published: (2025)
Characterizing Sets of Theories That Can Be Disjointly Combined
by: Przybocki, Benjamin, et al.
Published: (2025)
by: Przybocki, Benjamin, et al.
Published: (2025)
Bringing closure to theory combination properties
by: Toledo, Guilherme V., et al.
Published: (2026)
by: Toledo, Guilherme V., et al.
Published: (2026)
Being polite is not enough (and other limits of theory combination)
by: Toledo, Guilherme V., et al.
Published: (2025)
by: Toledo, Guilherme V., et al.
Published: (2025)
The Parameterized Complexity of Learning Monadic Second-Order Logic
by: van Bergerem, Steffen, et al.
Published: (2023)
by: van Bergerem, Steffen, et al.
Published: (2023)
The nonexistence of unicorns and many-sorted Löwenheim-Skolem theorems
by: Przybocki, Benjamin, et al.
Published: (2024)
by: Przybocki, Benjamin, et al.
Published: (2024)
Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
by: Atserias, Albert, et al.
Published: (2024)
by: Atserias, Albert, et al.
Published: (2024)
Synthesis of Temporal Causality
by: Finkbeiner, Bernd, et al.
Published: (2024)
by: Finkbeiner, Bernd, et al.
Published: (2024)
Similar Items
-
Learning Branching-Time Properties in CTL and ATL via Constraint Solving
by: Bordais, Benjamin, et al.
Published: (2024) -
A framework for computing upper bounds in passive learning settings
by: Bordais, Benjamin, et al.
Published: (2025) -
What is Formal Verification without Specifications? A Survey on mining LTL Specifications
by: Neider, Daniel, et al.
Published: (2025) -
Multi-Environment MDPs with Prior and Universal Semantics
by: Bordais, Benjamin, et al.
Published: (2026) -
Robust Computation Tree Logic
by: Nayak, Satya Prakash, et al.
Published: (2022)