scientific article
From MaRDI portal
Publication:4028788
zbMath0765.68187MaRDI QIDQ4028788
Francesco M. Donini, Werner Nutt, Maurizio Lenzerini, Daniele Nardi
Publication date: 28 March 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
upper boundslower boundssatisfiability checkingconcept languagessubsumption checkingtableau calculus for predicate logic
Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Artificial intelligence (68T99)
Related Items
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, Natural language syntax and first-order inference, Subsumption computed algebraically, Unification of concept terms in description logics, ZooM: a nested Galois lattices-based system for conceptual clustering, The complexity of existential quantification in concept languages., Description Logics, Combining Horn rules and description logics in CARIN, Tarskian set constraints, Tractable reasoning via approximation