Publication:4028788
From MaRDI portal
zbMath0765.68187MaRDI QIDQ4028788
Maurizio Lenzerini, Werner Nutt, Francesco M. Donini, Daniele Nardi
Publication date: 28 March 1993
upper bounds; lower bounds; satisfiability checking; concept languages; subsumption checking; tableau calculus for predicate logic
68Q25: Analysis of algorithms and problem complexity
68T30: Knowledge representation
68T99: Artificial intelligence
Related Items
ZooM: a nested Galois lattices-based system for conceptual clustering, Unification of concept terms in description logics, Natural language syntax and first-order inference, Subsumption computed algebraically, Combining Horn rules and description logics in CARIN, An empirical analysis of terminological representation systems, Peirce algebras, An alternative proof method for possibilistic logic and its application to terminological logics, Consistency checking reduced to satisfiability of concepts in terminological systems, Tarskian set constraints, Tractable reasoning via approximation