Terminological reasoning is inherently intractable

DOI10.1016/0004-3702(90)90087-GzbMATH Open0717.68089OpenAlexW2057513565MaRDI QIDQ2638816FDOQ2638816

Authors: Bernhard Nebel 

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0004-3702(90)90087-g

Recommendations

• scientific article; zbMATH DE number 1405451
• scientific article; zbMATH DE number 847979
• scientific article; zbMATH DE number 823628
• Justified terminological reasoning
• scientific article; zbMATH DE number 1292303
• scientific article; zbMATH DE number 5364052
• Syntactic analogies and impossible extensions
• Incompleteness results in Kripke semantics
• The logic of inexact concepts

zbMATH Keywords

terminological reasoningterminological representation languages

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A four-valued semantics for terminological logics
• Linear unification
• An Efficient Unification Algorithm
• Computational complexity of terminological reasoning in BACK
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (36)

• Generalized satisfiability for the description logic \(\mathcal{ALC}\)
• Pattern associativity and the retrieval of semantic networks
• Unification of concept terms in description logics
• Efficient TBox Reasoning with Value Restrictions using the wer Reasoner
• The complexity of existential quantification in concept languages.
• Reasoning within intuitionistic fuzzy rough description logics
• Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures
• Description Logics
• The complexity of concept languages
• Using automata theory for characterizing the semantics of terminological cycles
• An empirical analysis of terminological representation systems
• The data complexity of the syllogistic fragments of English
• Attributive concept descriptions with complements
• Reasoning with ontologies
• Tractable reasoning via approximation
• Acquisition and validation of complex object database schemata supporting multiple inheritance
• ``Reducing classic to practice: Knowledge representation theory meets reality
• Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)
• Reasoning and query answering in description logics
• Reasoning within expressive fuzzy rough description logics
• The F-logic approach for description languages
• Debugging incoherent terminologies
• Human rationality challenges universal logic
• Computing the least common subsumer w.r.t. a background terminology
• Title not available (Why is that?)
• Planning from second principles
• The fuzzy description logic \(\mathsf{G}\)-\({\mathcal{FL}_0}\) with greatest fixed-point semantics
• An epistemic operator for description logics
• PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\)
• Consistency checking reduced to satisfiability of concepts in terminological systems
• Automata can show PSpace results for description logics
• Complexity of Planning in Action Formalisms Based on Description Logics
• Prototypes in a hybrid language with primitive descriptions
• Subsumption computed algebraically
• Fuzzy description logics with general t-norms and datatypes
• A refined architecture for terminological systems: Terminology = Schema + Views

This page was built for publication: Terminological reasoning is inherently intractable

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