Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features
From MaRDI portal
Publication:6545542
DOI10.1007/978-3-031-43619-2_21MaRDI QIDQ6545542
Publication date: 29 May 2024
Could not fetch data.
Cites Work
- Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\)
- Propositional dynamic logic of regular programs
- More on nonregular PDL: Finite models and Fibonacci-like programs
- Propositional dynamic logic with recursive programs
- Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies
- Conjunctive Visibly-Pushdown Path Queries
- An Introduction to Description Logic
- Deciding Properties of Nonregular Programs
- Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings
- Adding nesting structure to words
- Reasoning and Query Answering in Description Logics
- Regularity Problems for Visibly Pushdown Languages
- Fragments of First-Order Logic
- A Decidable Non-Regular Modal Fixpoint Logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545542)
