All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Closure structures parameterized by systems of isotone Galois connections

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F17%3A73582746" target="_blank" >RIV/61989592:15310/17:73582746 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.sciencedirect.com/science/article/pii/S0888613X17300233" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0888613X17300233</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ijar.2017.08.013" target="_blank" >10.1016/j.ijar.2017.08.013</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Closure structures parameterized by systems of isotone Galois connections

  • Original language description

    We study properties of classes of closure operators and closure systems parameterized by systems of isotone Galois connections. The parameterizations express stronger requirements on idempotency and monotony conditions of closure operators. The present approach extends previous approaches to fuzzy closure operators which appeared in analysis of object-attribute data with graded attributes and reasoning with if-then rules in graded setting and is also related to analogous results developed in linear temporal logic. In the paper, we present foundations of the operators and include examples of general problems in data analysis where such operators appear.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA14-11585S" target="_blank" >GA14-11585S: Relational Similarity-Based Databases</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    International Journal of Approximate Reasoning

  • ISSN

    0888-613X

  • e-ISSN

  • Volume of the periodical

    91

  • Issue of the periodical within the volume

    DEC

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    21

  • Pages from-to

    1-21

  • UT code for WoS article

    000414818500001

  • EID of the result in the Scopus database

    2-s2.0-85028926662