Subsumption computed algebraically

DOI10.1016/0898-1221(92)90146-9zbMath0825.68604OpenAlexW2003040898MaRDI QIDQ1202639

Renate A. Schmidt, Chris Brink

Publication date: 19 April 1993

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(92)90146-9

zbMATH Keywords

subsumptionknowledge representation systemsterminological representation languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Knowledge representation (68T30) General logic (03B99)

Related Items

Peirce algebras, Towards automating duality, A modal perspective on the computational complexity of attribute value grammar

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Attributive concept descriptions with complements
• Varieties of relation algebras
• Refutational theorem proving using term-rewriting systems
• Frege against the Booleans
• Computational complexity of terminological reasoning in BACK
• A four-valued semantics for terminological logics
• Boolean modules
• Peirce the logician
• Terminological reasoning is inherently intractable
• The contributions of Alfred Tarski to algebraic logic
• Augustus De Morgan's Algebraic Work: The Three Stages
• Feature-constraint logics for unification grammars
• Nonfinite axiomatizability results for cylindric and relation algebras
• New Sets of Independent Postulates for the Algebra of Logic, With Special Reference to Whitehead and Russell's Principia Mathematica
• The Theory of Representation for Boolean Algebras