Imagen de Portada

Rethinking meaning and ontologies from the perspective of ontological units

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fabry, Paul, Barton, Adrien, Éthier, Jean-François
Formato:	Preprint
Publicado:	2025
Materias:	Formal Languages and Automata Theory Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Arbitrary-arity Tree Automata and QCTL
por: Laroussinie, François, et al.
Publicado: (2024)

Decision Questions for Probabilistic Automata on Small Alphabets
por: Bell, Paul C., et al.
Publicado: (2021)

High-Level Message Sequence Charts: Satisfiability and Realizability Revisited
por: Bollig, Benedikt, et al.
Publicado: (2025)

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

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
por: Aceto, Luca, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

Fractals from Regular Behaviours
por: Schmid, Todd, et al.
Publicado: (2023)

Synthesizing Computable Functions from Rational Specifications over Infinite Words
por: Filiot, Emmanuel, et al.
Publicado: (2021)

A Direct Translation from LTL with Past to Deterministic Rabin Automata
por: Azzopardi, Shaun, et al.
Publicado: (2024)

Comparing Labeled Markov Chains: A Cantor-Kantorovich Approach
por: Banse, Adrien, et al.
Publicado: (2025)

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

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

Determinization of Min-Plus Weighted Automata is Decidable
por: Almagor, Shaull, et al.
Publicado: (2025)

Unreliability in Practical Subclasses of Communicating Systems
por: Suresh, Amrita, et al.
Publicado: (2025)

Proceedings of the Combined 32nd International Workshop on Expressiveness in Concurrency and 22nd Workshop on Structural Operational Semantics
por: Di Giusto, Cinzia, et al.
Publicado: (2025)

Parameterized Verification of Quantum Circuits (Technical Report)
por: Abdulla, Parosh Aziz, et al.
Publicado: (2025)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
por: Li, Junle, et al.
Publicado: (2025)

DTMC Model Checking by Path Abstraction Revisited (extended version)
por: Hartmanns, Arnd, et al.
Publicado: (2025)

Robust Probabilistic Bisimilarity for Labelled Markov Chains
por: Fatmi, Syyeda Zainab, et al.
Publicado: (2025)

Learning Verified Monitors for Hidden Markov Models
por: van der Maas, Luko, et al.
Publicado: (2025)

MightyPPL: Verification of MITL with Past and Pnueli Modalities
por: Ho, Hsi-Ming, et al.
Publicado: (2025)

General Decidability Results for Systems with Continuous Counters
por: Balasubramanian, A. R., et al.
Publicado: (2025)

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

From Sound Workflow Nets to LTLf Declarative Specifications by Casting Three Spells
por: Barbaro, Luca, et al.
Publicado: (2025)

Extended CTG Generalization and Dynamic Adjustment of Generalization Strategies in IC3
por: Su, Yuheng, et al.
Publicado: (2025)

On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report)
por: Holík, Lukáš, et al.
Publicado: (2025)

A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
por: Chen, Yu-Fang, et al.
Publicado: (2025)

Automating the Analysis of Quantitative Automata with QuAK
por: Chalupa, Marek, et al.
Publicado: (2025)

Decidability Problems for Micro-Stipula
por: Delzanno, Giorgio, et al.
Publicado: (2025)

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

The role of counting quantifiers in laminar set systems
por: Campbell, Rutger, et al.
Publicado: (2025)

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

Language Equivalence is Undecidable in VASS with Restricted Nondeterminism
por: Czerwiński, Wojciech, et al.
Publicado: (2025)