scientific article
From MaRDI portal
Publication:4012244
zbMath0742.68059MaRDI QIDQ4012244
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dynamic logicscomplexity results on terminological logicsfeature-structure logicsterminological logics as modal and dynamic logics
Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Logic of natural languages (03B65) Logic in computer science (03B70)
Related Items (69)
Computing the least common subsumer w.r.t. a background terminology ⋮ A note on a description logic of concept and role typicality for defeasible reasoning over ontologies ⋮ Towards automating duality ⋮ Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor ⋮ A Modal-Layered Resolution Calculus for K ⋮ Arthur Prior and hybrid logic ⋮ The complexity of concept languages ⋮ ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching ⋮ Using automata theory for characterizing the semantics of terminological cycles ⋮ A description logic based situation calculus ⋮ Querying the Unary Negation Fragment with Regular Path Expressions. ⋮ Reasoning in fuzzy description logics using automata ⋮ Knowledge graph embeddings with ontologies: reification for representing arbitrary relations ⋮ The Probabilistic Description Logic ⋮ Efficient TBox Reasoning with Value Restrictions using the wer Reasoner ⋮ Fuzzy Bisimulations in Fuzzy Description Logics Under the Gödel Semantics ⋮ Symmetric blocking ⋮ Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots ⋮ Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures ⋮ ABox abduction in the description logic \(\mathcal{ALC}\) ⋮ Decidable Description Logics of Context with Rigid Roles ⋮ Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics ⋮ Extending Unification in $\mathcal{EL}$ to Disunification: The Case of Dismatching and Local Disunification ⋮ Modal definability of first-order formulas with free variables and query answering ⋮ A logical framework for privacy-preserving social network publication ⋮ Deciding expressive description logics in the framework of resolution ⋮ On finitely-valued fuzzy description logics ⋮ On the relationship between fuzzy description logics and many-valued modal logics ⋮ Reasoning on UML class diagrams ⋮ A tableau decision procedure for \(\mathcal{SHOIQ}\) ⋮ Automata can show PSpace results for description logics ⋮ Adding the power-set to description logics ⋮ Building decision procedures for modal logics from propositional decision procedures — The case study of modal K ⋮ Tableaux and algorithms for Propositional Dynamic Logic with Converse ⋮ Reasoning and Query Answering in Description Logics ⋮ Algorithms for reasoning in very expressive description logics under infinitely valued Gödel semantics ⋮ Constructive Description Logics Hybrid-Style ⋮ Answering regular path queries in expressive description logics via alternating tree-automata ⋮ A formal framework for description logics with uncertainty ⋮ Deontic Logic for Human Reasoning ⋮ Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\mathcal {FL}_0$$ ⋮ The complexity of finite model reasoning in description logics ⋮ On the failure of the finite model property in some fuzzy description logics ⋮ Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm ⋮ Ontological aspects of the implementation of norms in agent-based electronic institutions ⋮ Unification in the Description Logic $\mathcal{EL}$ without the Top Concept ⋮ Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog ⋮ ExpTime tableaux with global caching for hybrid PDL ⋮ A prover dealing with nominals, binders, transitivity and relation hierarchies ⋮ \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments ⋮ Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition ⋮ Description Logics ⋮ Ontologies and Databases: The DL-Lite Approach ⋮ Enhancing probabilistic model checking with ontologies ⋮ Using model theory to find decidable and tractable description logics with concrete domains ⋮ Towards Contingent World Descriptions in Description Logics ⋮ EXPtime tableaux for ALC ⋮ Description logics with concrete domains and general concept inclusions revisited ⋮ Combining deduction and model checking into tableaux and algorithms for converse-PDL. ⋮ Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\). ⋮ Tractable reasoning via approximation ⋮ Hybrid Logics and Ontology Languages ⋮ A modal perspective on the computational complexity of attribute value grammar ⋮ On the expressivity of feature logics with negation, functional uncertainty, and sort equations ⋮ Expressiveness of concept expressions in first-order description logics ⋮ Combining interval-based temporal reasoning with general TBoxes ⋮ \({\mathcal E}\)-connections of abstract description systems ⋮ On the undecidability of logics with converse, nominals, recursion and counting ⋮ Decidability of SHIQ with complex role inclusion axioms
This page was built for publication:
