The complexity of existential quantification in concept languages.
From MaRDI portal
Publication:989170
DOI10.1016/0004-3702(92)90076-AzbMath1193.68241OpenAlexW2057440130WikidataQ58006991 ScholiaQ58006991MaRDI QIDQ989170
Alberto Marchetti-Spaccamela, Francesco M. Donini, Werner Nutt, Daniele Nardi, Bernhard Hollunder, Maurizio Lenzerini
Publication date: 27 August 2010
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(92)90076-a
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
An empirical analysis of terminological representation systems ⋮ Computing the least common subsumer w.r.t. a background terminology ⋮ CoLab: A hybrid knowledge representation and compilation laboratory ⋮ The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I ⋮ The complexity of concept languages ⋮ Consistency checking reduced to satisfiability of concepts in terminological systems ⋮ A refined architecture for terminological systems: Terminology = Schema + Views ⋮ Generalized satisfiability for the description logic \(\mathcal{ALC}\) ⋮ The complexity of satisfiability for fragments of hybrid logic. I. ⋮ A sequent calculus for reasoning in four-valued Description Logics ⋮ Complexity results for modal dependence logic ⋮ Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ ⋮ Unification of concept terms in description logics ⋮ Generalized modal satisfiability ⋮ Attributive concept descriptions with complements ⋮ KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS ⋮ Description Logics ⋮ Tractable reasoning via approximation
Cites Work
