A four-valued semantics for terminological logics

DOI10.1016/0004-3702(89)90036-2zbMath0664.03024OpenAlexW2064119752MaRDI QIDQ1115428

Peter F. Patel-Schneider

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0004-3702(89)90036-2

zbMATH Keywords

algorithmformal semanticsframessubsumptionterminological logicsinconsistent knowledge

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic of natural languages (03B65) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Natural language processing (68T50)

Related Items

Tractable approximate deduction for OWL ⋮ Peirce algebras ⋮ DESCRIPTION LOGICS OVER LATTICES ⋮ A comment on relevant truth table logic ⋮ Terminological reasoning is inherently intractable ⋮ On the complexity of entailment in propositional multivalued logics ⋮ Carnap, Goguen, and the hyperontologies: logical pluralism and heterogeneous structuring in ontology design ⋮ A sequent calculus for reasoning in four-valued Description Logics ⋮ Measuring Inconsistency for Description Logics Based on Paraconsistent Semantics ⋮ Inconsistency-tolerant description logic. II: A tableau algorithm for \(\mathcal{CALC}^{\mathsf C}\) ⋮ Classic learning ⋮ The KL-ONE family ⋮ Subsumption computed algebraically ⋮ Towards constructive DL for abstraction and refinement ⋮ A nonstandard approach to the logical omniscience problem ⋮ A nonstandard approach to the logical omniscience problem ⋮ Tractable reasoning via approximation

Cites Work

• Computational complexity of terminological reasoning in BACK
• Unnamed Item
• Unnamed Item
• Unnamed Item