Cover Image

Complex event recognition under time constraints: towards a formal framework for efficient query evaluation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	García, Julián, Riveros, Cristian
Format:	Preprint
Published:	2025
Subjects:	Databases Formal Languages and Automata Theory Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A formal query language and automata model for aggregation in complex event recognition
by: Bourhis, Pierre, et al.
Published: (2026)

Complex event recognition meets hierarchical conjunctive queries
by: Pinto, Dante, et al.
Published: (2024)

Dynamic direct (ranked) access of MSO query evaluation over SLP-compressed strings
by: Muñoz, Martín
Published: (2026)

FC-Datalog as a Framework for Efficient String Querying
by: Bell, Owen M., et al.
Published: (2025)

Homomorphism Problems in Graph Databases and Automatic Structures
by: Morvan, Rémi
Published: (2025)

A Trichotomy for Regular Trail Queries
by: Martens, Wim, et al.
Published: (2019)

Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2022)

The structure of polynomial growth for tree automata/transducers and MSO set queries
by: Gallot, Paul, et al.
Published: (2025)

A framework for extraction and transformation of documents
by: Riveros, Cristian, et al.
Published: (2024)

Dynamic direct access of MSO query evaluation over strings
by: Bourhis, Pierre, et al.
Published: (2024)

Word equations, constraints, and formal languages
by: Ciobanu, Laura
Published: (2024)

Automatic constraint satisfaction problem
by: Bulatov, Andrei, et al.
Published: (2026)

An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)

The termination of Nielsen transformations applied to word equations with length constraints
by: Przybocki, Benjamin, et al.
Published: (2025)

Constant-delay enumeration for SLP-compressed documents
by: Muñoz, Martín, et al.
Published: (2022)

SpotIt: Evaluating Text-to-SQL Evaluation with Formal Verification
by: Klopfenstein, Rocky, et al.
Published: (2025)

The Complexity of Second-order HyperLTL
by: Frenkel, Hadar, et al.
Published: (2023)

The Complexity of Generalized HyperLTL with Stuttering and Contexts
by: Regaud, Gaëtan, et al.
Published: (2025)

On The Space Complexity of Partial Derivatives of Regular Expressions with Shuffle
by: Ancona, Davide, et al.
Published: (2025)

Counterfactual Explanations for MITL Violations
by: Finkbeiner, Bernd, et al.
Published: (2024)

Complexity of Model Checking Second-Order Hyperproperties on Finite Structures
by: Finkbeiner, Bernd, et al.
Published: (2026)

A formal characterization of discrete condensed objects
by: Asgeirsson, Dagur
Published: (2024)

Slice closures of indexed languages and word equations with counting constraints
by: Ciobanu, Laura, et al.
Published: (2024)

A complete formalization of Fermat's Last Theorem for regular primes in Lean
by: Best, Alex, et al.
Published: (2024)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)

Feasability of Learning Weighted Automata on a Semiring
by: Daviaud, Laure, et al.
Published: (2023)

Weighted GKAT: Completeness and Complexity
by: Van Koevering, Spencer, et al.
Published: (2025)

The commutativity problem for effective varieties of formal series, and applications
by: Clemente, Lorenzo
Published: (2025)

Pushing the Limit: Verified Performance-Optimal Causally-Consistent Database Transactions
by: Ghasemirad, Shabnam, et al.
Published: (2024)

A Dichotomy Theorem for Automatic Structures
by: Cuvelier, Antoine, et al.
Published: (2026)

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2024)

The Queue Automaton Revisited
by: Baeten, Jos C. M., et al.
Published: (2025)

Relating Reversible Petri Nets and Reversible Event Structures, categorically
by: Melgratti, Hernán, et al.
Published: (2023)

Simplifying LTL Model Checking Given Prior Knowledge
by: Duret-Lutz, Alexandre, et al.
Published: (2025)