Terminological reasoning is inherently intractable
From MaRDI portal
Publication:2638816
DOI10.1016/0004-3702(90)90087-GzbMath0717.68089MaRDI QIDQ2638816
Publication date: 1990
Published in: Artificial Intelligence (Search for Journal in Brave)
Related Items
Unification of concept terms in description logics, Attributive concept descriptions with complements, Automata can show PSpace results for description logics, A refined architecture for terminological systems: Terminology = Schema + Views, An epistemic operator for description logics, Subsumption computed algebraically, Prototypes in a hybrid language with primitive descriptions, Pattern associativity and the retrieval of semantic networks, Acquisition and validation of complex object database schemata supporting multiple inheritance, An empirical analysis of terminological representation systems, The complexity of concept languages, Consistency checking reduced to satisfiability of concepts in terminological systems, Using automata theory for characterizing the semantics of terminological cycles, Tractable reasoning via approximation, The F-logic approach for description languages, ``Reducing classic to practice: Knowledge representation theory meets reality, Computing the least common subsumer w.r.t. a background terminology, Debugging incoherent terminologies, Complexity of Planning in Action Formalisms Based on Description Logics
Cites Work
