A four-valued semantics for terminological logics (Q1115428): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q469832
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Luminita State / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0004-3702(89)90036-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064119752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of terminological reasoning in BACK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5740451 / rank
 
Normal rank

Latest revision as of 12:57, 19 June 2024

scientific article
Language Label Description Also known as
English
A four-valued semantics for terminological logics
scientific article

    Statements

    A four-valued semantics for terminological logics (English)
    0 references
    1989
    0 references
    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.
    0 references
    formal semantics
    0 references
    terminological logics
    0 references
    frames
    0 references
    inconsistent knowledge
    0 references
    subsumption
    0 references
    algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references