The complexity of concept languages

DOI10.1006/INCO.1997.2625zbMATH Open0906.68145DBLPjournals/iandc/DoniniLNN97OpenAlexW1980794674WikidataQ58006980 ScholiaQ58006980MaRDI QIDQ1363785FDOQ1363785

Daniele Nardi, Maurizio Lenzerini, F. M. Donini

Publication date: 11 August 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/77f39861a056d42d9ad093112141aacedd26bfd9

Recommendations

• scientific article
• Terminological reasoning is inherently intractable
• Consistency checking reduced to satisfiability of concepts in terminological systems
• scientific article; zbMATH DE number 1149405

zbMATH Keywords

terminological knowledge representation systems

Mathematics Subject Classification ID

Knowledge representation (68T30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• ``Reducing classic to practice: Knowledge representation theory meets reality
• Attributive concept descriptions with complements
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A guide to completeness and complexity for modal logics of knowledge and belief
• Terminological reasoning is inherently intractable
• Title not available (Why is that?)
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• The complexity of existential quantification in concept languages.
• Foundations of a functional approach to knowledge representation
• Computational complexity of terminological reasoning in BACK
• Title not available (Why is that?)
• The KL-ONE family
• Title not available (Why is that?)
• An empirical analysis of terminological representation systems

Cited In (25)

• Generalized satisfiability for the description logic \(\mathcal{ALC}\)
• \(\mathcal{ALCQPI}_{R^+}\): rational grading in an expressive description logic with inverse and transitive roles and counting
• Handling Spatial Relations in Logical Concept Analysis to Explore Geographical Data
• A polynomial space construction of tree-like models for logics with local chains of modal connectives
• Title not available (Why is that?)
• Generalized modal satisfiability
• The complexity of existential quantification in concept languages.
• Title not available (Why is that?)
• Adding clauses to poor man's logic (without increasing the complexity)
• A PARAMETERIZED ALGORITHM TO EXPLORE FORMAL CONTEXTS WITH A TAXONOMY
• Expressiveness of concept expressions in first-order description logics
• Complexity of hyperconcepts
• The complexity of propositional linear temporal logics in simple cases
• EXPtime tableaux for ALC
• Expressivity Hierarchy of Languages for Epistemic Awareness Models
• 2-Exp Time lower bounds for propositional dynamic logics with intersection
• Ontologies and Databases: The DL-Lite Approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Camelis: a logical information system to organise and browse a collection of documents
• An epistemic operator for description logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized Satisfiability for the Description Logic $\mathcal{ALC}$
• A refined architecture for terminological systems: Terminology = Schema + Views

This page was built for publication: The complexity of concept languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363785)