Practical reasoning for very expressive description logics
From MaRDI portal
Publication:4487262
Recommendations
- Publication:4938424
- scientific article; zbMATH DE number 2090284
- Reasoning in expressive description logics
- scientific article; zbMATH DE number 1531967
- Reasoning in Description Logics: Basics, Extensions, and Relatives
- Reasoning and query answering in description logics
- Description Logics
- A logical semantics for description logic programs
Cited in
(59)- Semantic characterization of rational closure: from propositional logic to description logics
- Blocking and other enhancements for bottom-up model generation methods
- scientific article; zbMATH DE number 1507191 (Why is no real title available?)
- scientific article; zbMATH DE number 67500 (Why is no real title available?)
- scientific article; zbMATH DE number 1612535 (Why is no real title available?)
- Algorithms for reasoning in very expressive description logics under infinitely valued Gödel semantics
- Tractable approximate deduction for OWL
- LINEAR TIME IN HYPERSEQUENT FRAMEWORK
- scientific article; zbMATH DE number 1405450 (Why is no real title available?)
- Deciding expressive description logics in the framework of resolution
- The two-variable fragment with counting and equivalence
- Reasoning about Multiple Aspects in Rational Closure for DLs
- Second-order reasoning in description logics
- Automated reasoning in \(\mathcal{ALCQ}\) via SMT
- A proof theory for description logics.
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- Reasoning with uncertain and inconsistent OWL ontologies
- Reasoning in expressive description logics under infinitely valued Gödel semantics
- Rough Pragmatic Description Logic
- Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse
- Foundations of Information and Knowledge Systems
- Decidable description logics of context with rigid roles
- A loop-free decision procedure for modal propositional logics K4, S4 and S5
- \({\mathcal E}\)-connections of abstract description systems
- Tractable reasoning using logic programs with intensional concepts
- Unification in the description logic \(\mathcal{EL}\) without the top concept
- Using tableau to decide description logics with full role negation and identity
- Towards World Identification in Description Logics
- Semantic web
- EXPtime tableaux for ALC
- How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited
- BDD-based decision procedures for the modal logic K ★
- Inductive logic programming in databases: from Datalog to \(\mathcal {DL} + \text{LOG}^{\neg \vee}\)
- Ontology Integration Using ε-Connections
- Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor
- scientific article; zbMATH DE number 1765662 (Why is no real title available?)
- OUP accepted manuscript
- scientific article; zbMATH DE number 1149436 (Why is no real title available?)
- Reasoning and query answering in description logics
- Beth definability in expressive description logics
- A Correspondence between Temporal Description Logics
- Foundations of Onto-Relational Learning
- Rational closure for all description logics
- scientific article; zbMATH DE number 1761427 (Why is no real title available?)
- Computing the least common subsumer w.r.t. a background terminology
- scientific article; zbMATH DE number 1980927 (Why is no real title available?)
- A universal approach to guarantee data privacy
- scientific article; zbMATH DE number 67503 (Why is no real title available?)
- scientific article; zbMATH DE number 1735887 (Why is no real title available?)
- scientific article; zbMATH DE number 1400210 (Why is no real title available?)
- ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching
- PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\)
- On the relative expressiveness of description logics and predicate logics
- Reasoning in description logics by a reduction to disjunctive datalog
- An overview of tableau algorithms for description logics
- Automata can show PSpace results for description logics
- Fuzzy description logics with general t-norms and datatypes
- On the undecidability of logics with converse, nominals, recursion and counting
- Composing Modular Ontologies with Distributed Description Logics
This page was built for publication: Practical reasoning for very expressive description logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487262)
