Cover Image

The Precise Complexity of Reasoning in $\mathcal{ALC}$ with $ω$-Admissible Concrete Domains (Extended Version)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Borgwardt, Stefan, De Bortoli, Filippo, Koopmann, Patrick
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

Concrete Domains Meet Expressive Cardinality Restrictions in Description Logics (Extended Version)
by: Baader, Franz, et al.
Published: (2025)

The Shape of $\mathcal{EL}$ Proofs: A Tale of Three Calculi (Extended Version)
by: Alrabbaa, Christian, et al.
Published: (2025)

Automated planning with ontologies under coherence update semantics (Extended Version)
by: Borgwardt, Stefan, et al.
Published: (2025)

Non-expansive Fuzzy ALC
by: Gebhart, Stefan, et al.
Published: (2025)

Lattice-preserving $\mathcal{ALC}$ ontology embeddings with saturation
by: Zhapa-Camacho, Fernando, et al.
Published: (2023)

FALCON: Scalable Reasoning over Inconsistent ALC Ontologies
by: Hinnerichs, Tilman, et al.
Published: (2022)

A C++ reasoner for the description logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$ (Extended Version)
by: Cantone, Domenico, et al.
Published: (2017)

Equational Reasoning Modulo Commutativity in Languages with Binders (Extended Version)
by: Caires-Santos, Ali K., et al.
Published: (2025)

Partially Finite Model Reasoning in Description Logics Extended Version
by: Gogacz, Tomasz, et al.
Published: (2026)

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

An Abstract Domain for Heap Commutativity (Extended Version)
by: Pincus, Jared, et al.
Published: (2024)

Tableaux for Automated Reasoning in Dependently-Typed Higher-Order Logic (Extended Version)
by: Niederhauser, Johannes, et al.
Published: (2024)

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

Unification with Simple Variable Restrictions and Admissibility of $Π_{2}$-rules
by: Almeida, Rodrigo Nicolau, et al.
Published: (2024)

Repairing Networks of $\mathcal{EL_\perp}$ Ontologies using Weakening and Completing -- Extended version
by: Li, Ying, et al.
Published: (2024)

Compositional Symbolic Execution for Correctness and Incorrectness Reasoning (Extended Version)
by: Lööw, Andreas, et al.
Published: (2024)

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

Rely-Guarantee Reasoning for Causally Consistent Shared Memory (Extended Version)
by: Lahav, Ori, et al.
Published: (2023)

Practical Deductive Verification of OCaml Programs (Extended Version)
by: Pereira, Mário
Published: (2024)

Towards Proving Liveness on Weak Memory (Extended Version)
by: Bargmann, Lara, et al.
Published: (2026)

Satisfiability Modulo Extensional Constant Arrays (Extended Version)
by: Preiner, Mathias, et al.
Published: (2026)

Sharing and Linear Logic with Restricted Access (Extended Version)
by: Barenbaum, Pablo, et al.
Published: (2025)

First-Order LTLf Synthesis with Lookback (Extended Version)
by: Winkler, Sarah
Published: (2025)

Formulas as Processes, Deadlock-Freedom as Choreographies (Extended Version)
by: Acclavio, Matteo, et al.
Published: (2025)

A Hyperlogic for Strategies in Stochastic Games (Extended Version)
by: Gerlach, Lina, et al.
Published: (2025)

Putting Perspective into OWL [sic]: Complexity-Neutral Standpoint Reasoning for Ontology Languages via Monodic S5 over Counting Two-Variable First-Order Logic (Extended Version with Appendix)
by: Álvarez, Lucía Gómez, et al.
Published: (2025)

Why not? Developing ABox Abduction beyond Repairs
by: Haak, Anselm, et al.
Published: (2025)

Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs (Extended Version)
by: Li, Kwing Hei, et al.
Published: (2025)

$ω$-Regular Energy Problems
by: Dziadek, Sven, et al.
Published: (2022)

Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory [Extended Version]
by: Kettmann, Pascal, et al.
Published: (2026)

Efficient Probabilistic Model Checking for Relational Reachability (Extended Version)
by: Gerlach, Lina, et al.
Published: (2025)

Certified Branch-and-Bound MaxSAT Solving (Extended Version)
by: Vandesande, Dieter, et al.
Published: (2025)

Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)
by: Paulus, Joseph W. N., et al.
Published: (2021)

Model Checking as Program Verification by Abstract Interpretation (Extended Version)
by: Baldan, Paolo, et al.
Published: (2025)

A Framework for Coalgebraic Reward-Sensitive Bisimulation (Extended Version)
by: de Amorim, Pedro H. Azevedo, et al.
Published: (2026)

Mechanized Undecidability of Higher-order beta-Matching (Extended Version)
by: Dudenhefner, Andrej
Published: (2026)

Admissibility of Substitution Rule in Cyclic-Proof Systems
by: Saotome, Kenji, et al.
Published: (2025)

Complete $ω$-Regular Supermartingale Certificates
by: Abate, Alessandro, et al.
Published: (2026)

Static and Dynamic Verification of OCaml Programs: The Gospel Ecosystem (Extended Version)
by: Soares, Tiago Lopes, et al.
Published: (2024)

Weak Simplicial Bisimilarity for Polyhedral Models and SLCS_eta -- Extended Version
by: Bezhanishvili, Nick, et al.
Published: (2024)