The complexity of concept languages
From MaRDI portal
Publication:1363785
Recommendations
Cites work
- scientific article; zbMATH DE number 3986613 (Why is no real title available?)
- scientific article; zbMATH DE number 46359 (Why is no real title available?)
- scientific article; zbMATH DE number 67502 (Why is no real title available?)
- scientific article; zbMATH DE number 67503 (Why is no real title available?)
- scientific article; zbMATH DE number 3559512 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 1142327 (Why is no real title available?)
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- A guide to completeness and complexity for modal logics of knowledge and belief
- An empirical analysis of terminological representation systems
- Attributive concept descriptions with complements
- Computational complexity of terminological reasoning in BACK
- Foundations of a functional approach to knowledge representation
- Terminological reasoning is inherently intractable
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- The KL-ONE family
- The complexity of existential quantification in concept languages.
- ``Reducing classic to practice: Knowledge representation theory meets reality
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
- Generalized modal satisfiability
- The complexity of existential quantification in concept languages.
- scientific article; zbMATH DE number 67502 (Why is no real title available?)
- scientific article; zbMATH DE number 140381 (Why is no real title available?)
- Expressiveness of concept expressions in first-order description logics
- Adding clauses to poor man's logic (without increasing the complexity)
- A PARAMETERIZED ALGORITHM TO EXPLORE FORMAL CONTEXTS WITH A TAXONOMY
- Complexity of hyperconcepts
- The complexity of propositional linear temporal logics in simple cases
- EXPtime tableaux for ALC
- Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)
- 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
- scientific article; zbMATH DE number 67503 (Why is no real title available?)
- scientific article; zbMATH DE number 1405451 (Why is no real title available?)
- An epistemic operator for description logics
- Camelis: a logical information system to organise and browse a collection of documents
- scientific article; zbMATH DE number 1869614 (Why is no real title available?)
- scientific article; zbMATH DE number 67970 (Why is no real title available?)
- 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)
