About: Central points and approximation in residuated lattices     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Given a subset $B$ of a complete residuated lattice, what are its points which are reasonably close to any point of $B$? What are the best such points? In this paper, we seek to answer these questions provided closeness is assessed by means of biresiduum, i.e. the truth function of equivalence in fuzzy logic. In addition, we present two algorithms which output, for a given input set $M$ of points in a residuated lattice, another set $K$ which approximates $M$ to a desired degree. We prove that the algorithms are optimal in that the set $K$ is minimal in terms of the number of its elements. Moreover, we show that the elements of any set $K'$ with such property are bounded from below and from above by the elements produced by the two algorithms.
  • Given a subset $B$ of a complete residuated lattice, what are its points which are reasonably close to any point of $B$? What are the best such points? In this paper, we seek to answer these questions provided closeness is assessed by means of biresiduum, i.e. the truth function of equivalence in fuzzy logic. In addition, we present two algorithms which output, for a given input set $M$ of points in a residuated lattice, another set $K$ which approximates $M$ to a desired degree. We prove that the algorithms are optimal in that the set $K$ is minimal in terms of the number of its elements. Moreover, we show that the elements of any set $K'$ with such property are bounded from below and from above by the elements produced by the two algorithms. (en)
Title
  • Central points and approximation in residuated lattices
  • Central points and approximation in residuated lattices (en)
skos:prefLabel
  • Central points and approximation in residuated lattices
  • Central points and approximation in residuated lattices (en)
skos:notation
  • RIV/61989592:15310/08:00005693!RIV10-MSM-15310___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM6198959214)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 359109
http://linked.open...ai/riv/idVysledku
  • RIV/61989592:15310/08:00005693
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • central point; approximation; residuated lattice (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [1EF47ADFDD24]
http://linked.open...i/riv/mistoVydani
  • Malaga, Španělsko
http://linked.open...i/riv/nazevZdroje
  • Information Processing and Management of Uncertainty in Knowledge-Based Systems
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Bělohlávek, Radim
  • Krupka, Michal
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • University of Malaga
https://schema.org/isbn
  • 978-84-612-3061-7
http://localhost/t...ganizacniJednotka
  • 15310
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software