Cover Image

A framework for computing upper bounds in passive learning settings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bordais, Benjamin, Neider, Daniel
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
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)

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

Multi-Environment MDPs with Prior and Universal Semantics
by: Bordais, Benjamin, et al.
Published: (2026)

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

What is Formal Verification without Specifications? A Survey on mining LTL Specifications
by: Neider, Daniel, et al.
Published: (2025)

Learning DFAs from Positive Examples Only via Word Counting
by: Bordais, Benjamin, et al.
Published: (2025)

Countability constraints in order-theoretic approaches to computability
by: Hack, Pedro, et al.
Published: (2022)

ZFLean: a framework for set-level mathematics in Lean
by: Trélat, Vincent
Published: (2026)

Lower bounds for set-blocked clauses proofs
by: Yolcu, Emre
Published: (2024)

VeriFlow: Modeling Distributions for Neural Network Verification
by: Zaid, Faried Abu, et al.
Published: (2024)

Incompleteness for stably computable formal systems
by: Savelyev, Yasha
Published: (2022)

Speedability of computably approximable reals and their approximations
by: Barmpalias, George, et al.
Published: (2026)

Nelson algebras, residuated lattices and rough sets: A survey
by: Järvinen, Jouni, et al.
Published: (2024)

Strong negation in the theory of computable functionals TCF
by: Köpp, Nils, et al.
Published: (2022)

On matrix rank function over bounded arithmetics
by: Ken, Eitetsu, et al.
Published: (2023)

Rethinking the notion of oracle: A prequel to Lawvere-Tierney topologies for computability theorists
by: Kihara, Takayuki
Published: (2022)

Intuitionistic modal logics: a minimal setting
by: Balbiani, Philippe, et al.
Published: (2025)

Indivisibility and uniform computational strength
by: Gill, Kenneth
Published: (2023)

On the consistency of stronger lower bounds for NEXP
by: Thapen, Neil
Published: (2025)

Abstract computation over first-order structures. Part IIa: Moschovakis' operator and other non-determinisms
by: Gaßner, Christine
Published: (2025)

Abstract computation over first-order structures. Part IIb: Moschovakis' operator and other non-determinisms
by: Gaßner, Christine
Published: (2025)

Abstract computation over first-order structures. Part I: Deterministic and non-deterministic BSS RAMs
by: Gaßner, Christine
Published: (2025)

Robust Computation Tree Logic
by: Nayak, Satya Prakash, et al.
Published: (2022)

The equivariant model structure on cartesian cubical sets
by: Awodey, Steve, et al.
Published: (2024)

Shininess, strong politeness, and unicorns
by: Przybocki, Benjamin, et al.
Published: (2025)

Characterizing Sets of Theories That Can Be Disjointly Combined
by: Przybocki, Benjamin, et al.
Published: (2025)

Being polite is not enough (and other limits of theory combination)
by: Toledo, Guilherme V., et al.
Published: (2025)

Bringing closure to theory combination properties
by: Toledo, Guilherme V., et al.
Published: (2026)

PECR: A formal system based on computability logic
by: Pantelis, G.
Published: (2024)

On the specification of modal systems: A comparison of three frameworks
by: Aceto, Luca, et al.
Published: (2024)

A framework to measure the robustness of programs in the unpredictable environment
by: Castiglioni, Valentina, et al.
Published: (2021)

The nonexistence of unicorns and many-sorted Löwenheim-Skolem theorems
by: Przybocki, Benjamin, et al.
Published: (2024)

Relating homotopy equivalences to conservativity in dependent type theories with computation axioms
by: Spadetto, Matteo
Published: (2023)

A unified rule format for bounded nondeterminism in SOS with terms as labels
by: Aceto, Luca, et al.
Published: (2024)

A set-theoretical approach for ABox reasoning services (Extended Version)
by: Cantone, Domenico, et al.
Published: (2017)

Effective weak convergence and tightness of measures in computable Polish spaces
by: Rojas, Diego A.
Published: (2024)

Bringing memory to Boolean networks: a unifying framework
by: Gadouleau, Maximilien, et al.
Published: (2024)

On some computational properties of open sets
by: Normann, Dag, et al.
Published: (2024)

A Dynamic Logic for Information Evaluation in Intelligence
by: Icard, Benjamin
Published: (2024)

Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
by: Ye, Lina, et al.
Published: (2023)