×

zbMATH — the first resource for mathematics

A four-valued semantics for terminological logics. (English) Zbl 0664.03024
A certain formal semantics for terminological logics formalizing the notion of frames is proposed. The four-valued semantics considered here includes the possibility to have inconsistent knowledge about some proposition without being totally inconsistent. A detailed discussion concerning the proposed semantics is given in the fourth section of the paper. For concepts and roles in canonical form, Theorem 1 in the fifth section gives a sound and complete characterization of subsumption. Next, an algorithm for subsumption for canonical form concepts and roles is derived from the given characterization. Technical results, mainly the proofs of the asserted properties as soundness and completeness corresponding to the proposed algorithm, are given in Appendix A.
Reviewer: L.State

MSC:
03B60 Other nonclassical logic
03B65 Logic of natural languages
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68T50 Natural language processing
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Belnap, N.D., How a computer should think, (), 30-56
[2] Belnap, N.D., A useful four-valued logic, () · Zbl 0417.03009
[3] Brachman, R.J.; Fikes, R.E.; Levesque, H.J., KRYPTON: A functional approach to knowledge representation, IEEE computer, 16, 10, 67-73, (1983)
[4] Brachman, R.J.; Gilbert, V.P.; Levesque, H.J., An essential hybrid reasoning system: knowledge and symbol level accounts of KRYPTON, (), 532-539
[5] Brachman, R.J.; Schmolze, J.G., An overview of the KL-ONE knowledge representation system, Cognitive sci., 9, 2, 171-216, (1985)
[6] Shimon, E., ()
[7] Frisch, A.M., Using model theory to specify AI programs, (), 148-154
[8] Frisch, A.M., Inference without chaining, (), 515-519
[9] International Joint Committee on Artificial Intelligence, ()
[10] Kaczmarek, T.S.; Bates, R.; Robbins, G., Recent developments in NIKL, (), 978-985
[11] Levesque, H.J., A logic of implicit and explicit belief, (), 198-202
[12] Levesque, H.J.; Brachman, R.J., Expressiveness and tractability in knowledge representation and reasoning, Computational intelligence, 3, 2, 78-93, (1987)
[13] MacGregor, R.M.; Bates, R., The loom knowledge representation language, ()
[14] Moser, M.G., An overview of NIKL, the new implementation of KL-ONE, (), Part of a collection entitled “Research in Knowledge Representation for Natural Language Understanding—Annual Report, 1 September 1982-31 August 1983”
[15] Nebel, B., Computational complexity of terminological reasoning in BACK, Artificial intelligence, 34, 371-383, (1988) · Zbl 0646.68110
[16] Patel-Schneider, P.F., Small can be beautiful in knowledge representation, (), 11-16
[17] Patel-Schneider, P.F., Undecidability of subsumption in NIKL, Artificial intelligence, 39, (1989)
[18] Patel-Schneider, P.F., A decidable first-order logic for knowledge representation. J. Autom. Reasoning, to appear. · Zbl 1341.03037
[19] Patel-Schneider, P.F.; Brachman, R.J.; Levesque, H.J., ARGON: knowledge representation meets information retrieval, (), 280-286
[20] Robins, G., The NIKL manual, ()
[21] Schmolze, J.G.; Israel, D.J., KL-ONE: semantics and classification, (), Part of a collection entitled “Research in Knowledge Representation for Natural Language Understanding—Annual Report, 1 September 1982-31 August 1983”
[22] von Luck, K.; Peltason, C.; Nebel, B.; Schmiedel, A., The anatomy of the BACK system, ()
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.