The complexity of existential quantification in concept languages.
DOI10.1016/0004-3702(92)90076-AzbMATH Open1193.68241OpenAlexW2057440130WikidataQ58006991 ScholiaQ58006991MaRDI QIDQ989170FDOQ989170
Authors: F. M. Donini, Maurizio Lenzerini, Daniele Nardi, Bernhard Hollunder, Werner Nutt, Alberto Marchetti-Spaccamela 
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
Recommendations
- scientific article; zbMATH DE number 140381
- The complexity of concept languages
- scientific article; zbMATH DE number 2160560
- scientific article; zbMATH DE number 3981154
- Quantifiers and cognition: logical and computational perspectives
- scientific article; zbMATH DE number 4058877
- scientific article; zbMATH DE number 1342272
- Publication:4508560
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30) Logic in artificial intelligence (68T27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Attributive concept descriptions with complements
- Terminological reasoning is inherently intractable
- Reasoning and revision in hybrid representation systems
- Computational complexity of terminological reasoning in BACK
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (20)
- Generalized satisfiability for the description logic \(\mathcal{ALC}\)
- Unification of concept terms in description logics
- The complexity of satisfiability for fragments of hybrid logic. I.
- Generalized modal satisfiability
- A sequent calculus for reasoning in four-valued description logics
- Title not available (Why is that?)
- CoLab: A hybrid knowledge representation and compilation laboratory
- The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I
- Description Logics
- The complexity of concept languages
- An empirical analysis of terminological representation systems
- Attributive concept descriptions with complements
- Title not available (Why is that?)
- Tractable reasoning via approximation
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)
- Kripke completeness of strictly positive modal logics over meet-semilattices with operators
- Complexity results for modal dependence logic
- Computing the least common subsumer w.r.t. a background terminology
- Consistency checking reduced to satisfiability of concepts in terminological systems
- A refined architecture for terminological systems: Terminology = Schema + Views
This page was built for publication: The complexity of existential quantification in concept languages.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989170)
