Cover Image

The Complexity of Data-Free Nfer

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kauffman, Sean, Larsen, Kim Guldstrand, Zimmermann, Martin
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Monitoring Timed Properties (Revisited)
by: Grosen, Thomas Møller, et al.
Published: (2022)

Compositional Shielding and Reinforcement Learning for Multi-Agent Systems
by: Brorholt, Asger Horn, et al.
Published: (2024)

The Complexity of HyperQPTL
by: Regaud, Gaëtan, et al.
Published: (2024)

The Complexity of Fragments of Second-Order HyperLTL
by: Regaud, Gaëtan, et al.
Published: (2025)

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

Efficient Shield Synthesis via State-Space Transformation
by: Brorholt, Asger Horn, et al.
Published: (2024)

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

Uppaal Coshy: Automatic Synthesis of Compact Shields for Hybrid Systems
by: Brorholt, Asger Horn, et al.
Published: (2025)

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

Synchronous Team Semantics for Temporal Logics
by: Krebs, Andreas, et al.
Published: (2024)

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder
by: Fortin, Marie, et al.
Published: (2023)

Cyclic Implicit Complexity
by: Curzi, Gianluca, et al.
Published: (2021)

Robust Probabilistic Temporal Logics
by: Zimmermann, Martin
Published: (2023)

The Complexity of the Constructive Master Modality
by: Santiago-Fernández, Sofía, et al.
Published: (2026)

Distribution-Free Normal Modal Logics
by: Hartonas, Chrysafis
Published: (2024)

Hyperarithmetical Complexity of Infinitary Action Logic with Multiplexing
by: Pshenitsyn, Tikhon
Published: (2023)

Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime
by: Nayak, Satya Prakash, et al.
Published: (2022)

Normalisation for Negative Free Logics without and with Definite Descriptions
by: Kürbis, Nils
Published: (2024)

Distribution-Free Modal Logics: Sahlqvist -- Van Benthem Correspondence
by: Chrysafis, et al.
Published: (2025)

Complexity of the Model Checking problem for inquisitive propositional and modal logic
by: Grilletti, Gianluca, et al.
Published: (2024)

Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)

On-The-Fly Symbolic Algorithm for Timed ATL with Abstractions
by: Jensen, Nicolaj Ø., et al.
Published: (2025)

Sequent Calculi for Data-Aware Modal Logics
by: Areces, Carlos, et al.
Published: (2025)

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

TAPAAL HyperLTL: A Tool for Checking Hyperproperties of Petri Nets
by: Gonzalez, Bruno Maria René, et al.
Published: (2025)

The Parameterized Complexity of Learning Monadic Second-Order Logic
by: van Bergerem, Steffen, et al.
Published: (2023)

Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking
by: Winter, Sarah, et al.
Published: (2024)

Prophecies all the Way: Game-based Model-Checking for HyperQPTL beyond $\forall^*\exists^*$
by: Winter, Sarah, et al.
Published: (2025)

Logics for Context-free Hyperproperties
by: Winter, Sarah, et al.
Published: (2026)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
by: Atserias, Albert, et al.
Published: (2024)

The Reachability Problem for Neural-Network Control Systems
by: Schilling, Christian, et al.
Published: (2024)

On Small Types in Univalent Foundations
by: de Jong, Tom, et al.
Published: (2021)

Computational Complexity of Standpoint LTL
by: Demri, Stéphane, et al.
Published: (2024)

The Complexity of Learning Temporal Properties
by: Bordais, Benjamin, et al.
Published: (2024)

Complexity of Abduction in Łukasiewicz Logic
by: Inoue, Katsumi, et al.
Published: (2025)

Closure and Complexity of Temporal Causality
by: Carelli, Mishel, et al.
Published: (2025)

On the Complexity of Proving Polyhedral Reductions
by: Amat, Nicolas, et al.
Published: (2023)

The complete classification for quantified equality constraints
by: Zhuk, Dmitriy, et al.
Published: (2021)

Declassification Policy for Program Complexity Analysis
by: Hainry, Emmanuel, et al.
Published: (2024)

Complex Bounded Operators in Isabelle/HOL
by: Unruh, Dominique, et al.
Published: (2025)