Consistency checking reduced to satisfiability of concepts in terminological systems

DOI10.1007/BF02127745MaRDI QIDQ1380407zbMATH OpenFDO

Authors Bernhard Hollunder

Publication date 22 April 1998

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02127745

zbMATH Keywords

inference problemknowledge representation systems

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• The complexity of concept languages
• scientific article; zbMATH DE number 140381
• scientific article; zbMATH DE number 1980942

Cites work

• Attributive concept descriptions with complements
• Deduction in Concept Languages: from Subsumption to Instance Checking
• scientific article; zbMATH DE number 140381 (Why is no real title available?)
• scientific article; zbMATH DE number 140398 (Why is no real title available?)
• scientific article; zbMATH DE number 6606365 (Why is no real title available?)
• Reasoning and revision in hybrid representation systems
• Terminological reasoning is inherently intractable
• The complexity of existential quantification in concept languages.

Cited in

(8)

• Set containment inference and syllogisms
• The complexity of concept languages
• Reasoning in fuzzy description logics using automata
• Description Logics
• scientific article; zbMATH DE number 67970 (Why is no real title available?)
• scientific article; zbMATH DE number 1292303 (Why is no real title available?)
• Consistency reasoning in lattice-based fuzzy description logics
• Combining interval-based temporal reasoning with general TBoxes

This page was built for publication: Consistency checking reduced to satisfiability of concepts in terminological systems

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