An empirical analysis of terminological representation systems

DOI10.1016/0004-3702(94)90071-XzbMath0812.68113OpenAlexW2062868856MaRDI QIDQ1332849

Daniel Kudenko, Hans-Jürgen Profitlich, Bernhard Nebel, Jochen Heinsohn

Publication date: 14 May 1995

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

Full work available at URL: https://doi.org/10.1016/0004-3702(94)90071-x

zbMATH Keywords

computational complexitytaxonomic representation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30)

Related Items (6)

Acquisition and validation of complex object database schemata supporting multiple inheritance ⋮ The complexity of concept languages ⋮ A family of dynamic description logics for representing and reasoning about actions ⋮ Concurrency and knowledge-level communication in agent languages ⋮ Unnamed Item ⋮ On the computational complexity of temporal projection, planning, and plan validation

Cites Work

• Attributive concept descriptions with complements
• The complexity of existential quantification in concept languages.
• Computational complexity of terminological reasoning in BACK
• Terminological reasoning is inherently intractable
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An empirical analysis of terminological representation systems