Fuzzy Reasoning with Continuous Piecewise Linear Membership Functions

P.M. van den Broek

Research output: Chapter in Book/Report/Conference proceedingConference contributionProfessional

4 Citations (Scopus)
82 Downloads (Pure)

Abstract

It is shown that, for some intersection and implication functions, the complexity of the computation of inference results with generalised modus ponens can be reduced considerably when membership functions are restricted to functions which are continuous and piecewise linear. Algorithms for computing inference results are given in the functional language Miranda.
Original languageUndefined
Title of host publicationAnnual Meeting of the North American Fuzzy Information Processing Society (NAFIPS)
EditorsC. Isik, V. Cross
Place of PublicationSyracuse, USA
PublisherNorth American Fuzzy Information Processing Society
Pages371-376
Number of pages6
ISBN (Print)0780340787
DOIs
Publication statusPublished - Sep 1997

Publication series

Name
PublisherIEEE

Keywords

  • EWI-10081
  • METIS-122305
  • IR-20305

Cite this

van den Broek, P. M. (1997). Fuzzy Reasoning with Continuous Piecewise Linear Membership Functions. In C. Isik, & V. Cross (Eds.), Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS) (pp. 371-376). Syracuse, USA: North American Fuzzy Information Processing Society. https://doi.org/10.1109/NAFIPS.1997.624069
van den Broek, P.M. / Fuzzy Reasoning with Continuous Piecewise Linear Membership Functions. Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS). editor / C. Isik ; V. Cross. Syracuse, USA : North American Fuzzy Information Processing Society, 1997. pp. 371-376
@inproceedings{9f5000eb04f84cea941e6ab275237dc5,
title = "Fuzzy Reasoning with Continuous Piecewise Linear Membership Functions",
abstract = "It is shown that, for some intersection and implication functions, the complexity of the computation of inference results with generalised modus ponens can be reduced considerably when membership functions are restricted to functions which are continuous and piecewise linear. Algorithms for computing inference results are given in the functional language Miranda.",
keywords = "EWI-10081, METIS-122305, IR-20305",
author = "{van den Broek}, P.M.",
note = "IEEE Catalog Number 97TH8297",
year = "1997",
month = "9",
doi = "10.1109/NAFIPS.1997.624069",
language = "Undefined",
isbn = "0780340787",
publisher = "North American Fuzzy Information Processing Society",
pages = "371--376",
editor = "C. Isik and V. Cross",
booktitle = "Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS)",

}

van den Broek, PM 1997, Fuzzy Reasoning with Continuous Piecewise Linear Membership Functions. in C Isik & V Cross (eds), Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS). North American Fuzzy Information Processing Society, Syracuse, USA, pp. 371-376. https://doi.org/10.1109/NAFIPS.1997.624069

Fuzzy Reasoning with Continuous Piecewise Linear Membership Functions. / van den Broek, P.M.

Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS). ed. / C. Isik; V. Cross. Syracuse, USA : North American Fuzzy Information Processing Society, 1997. p. 371-376.

Research output: Chapter in Book/Report/Conference proceedingConference contributionProfessional

TY - GEN

T1 - Fuzzy Reasoning with Continuous Piecewise Linear Membership Functions

AU - van den Broek, P.M.

N1 - IEEE Catalog Number 97TH8297

PY - 1997/9

Y1 - 1997/9

N2 - It is shown that, for some intersection and implication functions, the complexity of the computation of inference results with generalised modus ponens can be reduced considerably when membership functions are restricted to functions which are continuous and piecewise linear. Algorithms for computing inference results are given in the functional language Miranda.

AB - It is shown that, for some intersection and implication functions, the complexity of the computation of inference results with generalised modus ponens can be reduced considerably when membership functions are restricted to functions which are continuous and piecewise linear. Algorithms for computing inference results are given in the functional language Miranda.

KW - EWI-10081

KW - METIS-122305

KW - IR-20305

U2 - 10.1109/NAFIPS.1997.624069

DO - 10.1109/NAFIPS.1997.624069

M3 - Conference contribution

SN - 0780340787

SP - 371

EP - 376

BT - Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS)

A2 - Isik, C.

A2 - Cross, V.

PB - North American Fuzzy Information Processing Society

CY - Syracuse, USA

ER -

van den Broek PM. Fuzzy Reasoning with Continuous Piecewise Linear Membership Functions. In Isik C, Cross V, editors, Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS). Syracuse, USA: North American Fuzzy Information Processing Society. 1997. p. 371-376 https://doi.org/10.1109/NAFIPS.1997.624069