Special properties, closures and interiors of crisp and fuzzy relations (Q1115436): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q209768 |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Ladislav J. Kohout / 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/0165-0114(88)90126-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1978933272 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fuzzy power sets and fuzzy implication operators / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3265688 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4096943 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5582292 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Similarity relations and fuzzy orderings / rank | |||
Normal rank |
Latest revision as of 12:57, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Special properties, closures and interiors of crisp and fuzzy relations |
scientific article |
Statements
Special properties, closures and interiors of crisp and fuzzy relations (English)
0 references
1988
0 references
This paper offers optimal definitions of the special properties which relations on a set may possess, and which combine to define the classically important types of preorders, both kinds of orders, tolerances and equivalences. The useful concept of local properties is introduced. The concepts of closure and interior of a relation with respect to a property are defined. Finally, fast algorithms are given for the computer calculation of the more troublesome closures, and a standardized procedure for the analysis of local orders is presented.
0 references
similarity
0 references
relations
0 references
preorders
0 references
tolerances
0 references
equivalences
0 references
local properties
0 references
closure
0 references
interior
0 references
fast algorithms
0 references
local orders
0 references