Fuzzy Reasoning with Continuous Piecewise Linear Membership Functions

P.M. van den Broek

doi:10.1109/NAFIPS.1997.624069

Fuzzy Reasoning with Continuous Piecewise Linear Membership Functions

P.M. van den Broek

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Professional

4 Citations (Scopus)

142 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 language	Undefined
Title of host publication	Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS)
Editors	C. Isik, V. Cross
Place of Publication	Syracuse, USA
Publisher	North American Fuzzy Information Processing Society
Pages	371-376
Number of pages	6
ISBN (Print)	0780340787
DOIs	https://doi.org/10.1109/NAFIPS.1997.624069
Publication status	Published - Sep 1997
Event	Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS) - Syracuse, NY, USA Duration: 21 Sep 1997 → 24 Sep 1997

Publication series

Name
Publisher	IEEE

Conference

Conference	Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS)
Period	21/09/97 → 24/09/97
Other	21-24 September 1997

Keywords

EWI-10081
METIS-122305
IR-20305

Access to Document

10.1109/NAFIPS.1997.624069

0125nafips97
open

Cite this

@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; null ; Conference date: 21-09-1997 Through 24-09-1997",

year = "1997",

month = sep,

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, Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS), 21/09/97. 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 proceeding › Conference contribution › Professional

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

Y2 - 21 September 1997 through 24 September 1997

ER -