Image de couverture de livre

FILO -- automated unification in $\mathcal{FL}_0$

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Morawska, Barbara, Marzec, Dariusz, Kost, Sławomir, Henne, Michał
Format:	Preprint
Publié:	2025
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Solving unification in the description logic $\mathcal{FL}_\bot$
par: Morawska, Barbara, et autres
Publié: (2024)

Subsumption in $\mathcal{FL}_{\bot \mathit{reg}}$ with TBoxes Is in ExpTime
par: Henne, Michał, et autres
Publié: (2026)

One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus
par: Cerna, David M., et autres
Publié: (2022)

Nominal anti-unification
par: Baumgartner, Alexander, et autres
Publié: (2025)

A unification of graded and substructural logics
par: Hanukaev, Peter, et autres
Publié: (2026)

A Note On Square-free Sequences and Anti-unification Type
par: Cerna, David M.
Publié: (2024)

Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
par: Dudenhefner, Andrej
Publié: (2022)

Algebraic anti-unification
par: Antić, Christian
Publié: (2024)

Positionality in $Σ_0^2$ and a completeness result
par: Ohlmann, Pierre, et autres
Publié: (2023)

A note on Stone-Čech compactification in ZFA
par: Przybyłek, Michał R.
Publié: (2023)

Duality theory and representations for distributive quasi relation algebras and DInFL-algebras
par: Craig, Andrew, et autres
Publié: (2025)

Monadic Second-Order Logic of Permutations
par: Jelínek, Vít, et autres
Publié: (2025)

Compositional pre-processing for automated reasoning in dependent type theory
par: Blot, Valentin, et autres
Publié: (2022)

On The Axioms Of $\mathcal{M},\mathcal{N}$-Adhesive Categories
par: Castelnovo, Davide, et autres
Publié: (2024)

The complete classification for quantified equality constraints
par: Zhuk, Dmitriy, et autres
Publié: (2021)

A method for the automated generation of proof exercises with comparable levels of proving complexity
par: Mendes, João, et autres
Publié: (2026)

Computable universal online learning
par: Kalociński, Dariusz, et autres
Publié: (2025)

The Shape of $\mathcal{EL}$ Proofs: A Tale of Three Calculi (Extended Version)
par: Alrabbaa, Christian, et autres
Publié: (2025)

Quasi Directed Jonsson Operations Imply Bounded Width (For fo-expansions of symmetric binary cores with free amalgamation)
par: Wrona, Michal
Publié: (2024)

The Precise Complexity of Reasoning in $\mathcal{ALC}$ with $ω$-Admissible Concrete Domains (Extended Version)
par: Borgwardt, Stefan, et autres
Publié: (2024)

Fully Abstract Encodings of $λ$-Calculus in HOcore through Abstract Machines
par: Biernacka, Małgorzata, et autres
Publié: (2022)

A C++ reasoner for the description logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$ (Extended Version)
par: Cantone, Domenico, et autres
Publié: (2017)

$\text{TT}^{\Box}_{\mathcal C}$: a Family of Extensional Type Theories with Effectful Realizers of Continuity
par: Cohen, Liron, et autres
Publié: (2023)

A set-based reasoner for the description logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$ (Extended Version)
par: Cantone, Domenico, et autres
Publié: (2018)

Tabular intermediate logics comparison
par: Rzążewski, Paweł, et autres
Publié: (2025)

Proceedings Eleventh International Conference on Non-Classical Logics. Theory and Applications
par: Indrzejczak, Andrzej, et autres
Publié: (2024)

An optimized KE-tableau-based system for reasoning in the description logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$ (Extended Version)
par: Cantone, Domenico, et autres
Publié: (2018)

Bi-reachability in Petri nets with data
par: Kamiński, Łukasz, et autres
Publié: (2024)

Hybrid Modal Operators for Definite Descriptions
par: Wałęga, Przemysław Andrzej, et autres
Publié: (2024)

Lattice-preserving $\mathcal{ALC}$ ontology embeddings with saturation
par: Zhapa-Camacho, Fernando, et autres
Publié: (2023)

A Dichotomy Theorem for Ordinal Ranks in MSO
par: Niwiński, Damian, et autres
Publié: (2025)

On the Computability of Measures of Regular Sets of Infinite Trees
par: Niwiński, Damian, et autres
Publié: (2023)

Extracting efficient exact real number computation from proofs in constructive type theory
par: Konečný, Michal, et autres
Publié: (2022)

Identifying Tractable Quantified Temporal Constraints within Ord-Horn
par: Rydval, Jakub, et autres
Publié: (2024)

Formalizing Hyperspaces and Operations on Subsets of Polish spaces over Abstract Exact Real Numbers
par: Konečný, Michal, et autres
Publié: (2024)

Wadge degrees of $Δ^0_2$ omega-powers
par: Finkel, Olivier, et autres
Publié: (2024)

Witnesses for Fixpoint Games on Lattices
par: König, Barbara, et autres
Publié: (2026)

Collapsing the bounded width hierarchy for infinite-domain CSPs: when symmetries are enough
par: Mottet, Antoine, et autres
Publié: (2021)

Solvability of orbit-finite systems of linear equations
par: Ghosh, Arka, et autres
Publié: (2022)

Low rank MSO
par: Bojańczyk, Mikołaj, et autres
Publié: (2025)