Computational complexity of terminological reasoning in BACK

DOI10.1016/0004-3702(88)90066-5zbMath0646.68110OpenAlexW1974136241MaRDI QIDQ1104128

Bernhard Nebel

Publication date: 1988

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(88)90066-5

zbMATH Keywords

computational complexitysubsumptionBACKBerlin advanced computational knowledge representation systemintractable complete inference algorithmknowledge representation systemsnontrivial description languageterminological reasoning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99)

Related Items

An empirical analysis of terminological representation systems ⋮ Terminological reasoning is inherently intractable ⋮ The complexity of concept languages ⋮ A four-valued semantics for terminological logics ⋮ The F-logic approach for description languages ⋮ Natural language syntax and first-order inference ⋮ The KL-ONE family ⋮ Subsumption computed algebraically ⋮ The descriptive component of a hybrid knowledge representation language ⋮ Unification of concept terms in description logics ⋮ The complexity of existential quantification in concept languages. ⋮ Attributive concept descriptions with complements ⋮ Ontologies and Databases: The DL-Lite Approach ⋮ EXPtime tableaux for ALC ⋮ The approximation of implicates and explanations

Cites Work

• Maintaining knowledge about temporal intervals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item