Results 1  10
of
132,235
On Interpreting Fuzzy IFTHEN Rule Bases by . . .
, 1998
"... Starting with ZADEH's fundamental paper "The Calculus of Fuzzy IFTHEN Rules" we mention five possible interpretations of a Fuzzy IFTHEN Rule Base. The interpretation of a given Fuzzy IFTHEN Rule Base strongly depends on the area where it is to be applied. In the paper presented we ..."
Abstract
 Add to MetaCart
restrict this area to fuzzy control and approximate reasoning. Consequently, we interpret a Fuzzy IFTHEN Rule Base as a system of functional equations for determining a special functional operator. Then using the concepts of functional analysis and metric spaces we introduce the principles FATI and FITA
A Structural Approach to Operational Semantics
, 1981
"... Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can be ..."
Abstract

Cited by 1541 (3 self)
 Add to MetaCart
Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can be taken as given: Truthvalues This is the set T = ftt; ffg and is ranged over by (the metavariable) t (and we also happily employ for this (and any other) metavariable sub and superscripts to generate other metavariables: t ; t 0 ; t 1k ).
A Syntactic Approach to Type Soundness
 INFORMATION AND COMPUTATION
, 1992
"... We present a new approach to proving type soundness for Hindley/Milnerstyle polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification of the la ..."
Abstract

Cited by 634 (25 self)
 Add to MetaCart
We present a new approach to proving type soundness for Hindley/Milnerstyle polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification
Nested Transactions: An Approach to Reliable Distributed Computing
, 1981
"... Distributed computing systems are being built and used more and more frequently. This distributod computing revolution makes the reliability of distributed systems an important concern. It is fairly wellunderstood how to connect hardware so that most components can continue to work when others are ..."
Fuzzy ifthen rulebased nonlinear classifier
 INT. J. APPL. MATH. COMPUT. SCI
, 2003
"... This paper introduces a new classifier design method that is based on a modification of the classical HoKashyap procedure. The proposed method uses the absolute error, rather than the squared error, to design a linear classifier. Additionally, easy control of the generalization ability and robustne ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
and robustness to outliers are obtained. Next, an extension to a nonlinear classifier by the mixtureofexperts technique is presented. Each expert is represented by a fuzzy ifthen rule in the TakagiSugenoKang form. Finally, examples are given to demonstrate the validity of the introduced method.
A Field Study of the Software Design Process for Large Systems
 Communications of the ACM
, 1988
"... The problems of designing large software systems were studied through interviewing personnel from 17 large projects. A layered behavioral model is used to analyze how three lgf these problemsthe thin spread of application domain knowledge, fluctuating and conflicting requirements, and communication ..."
Abstract

Cited by 663 (2 self)
 Add to MetaCart
The problems of designing large software systems were studied through interviewing personnel from 17 large projects. A layered behavioral model is used to analyze how three lgf these problemsthe thin spread of application domain knowledge, fluctuating and conflicting requirements
A Survey of Program Slicing Techniques
 JOURNAL OF PROGRAMMING LANGUAGES
, 1995
"... A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser in 197 ..."
Abstract

Cited by 777 (8 self)
 Add to MetaCart
in 1979. Since then, various slightly different notions of program slices have been proposed, as well as a number of methods to compute them. An important distinction is that between a static and a dynamic slice. The former notion is computed without making assumptions regarding a program's input
Verb Semantics And Lexical Selection
, 1994
"... ... structure. As Levin has addressed (Levin 1985), the decomposition of verbs is proposed for the purposes of accounting for systematic semanticsyntactic correspondences. This results in a series of problems for MT systems: inflexible verb sense definitions; difficulty in handling metaphor and new ..."
Abstract

Cited by 520 (4 self)
 Add to MetaCart
and new usages; imprecise lexical selection and insufficient system coverage. It seems one approach is to apply probability methods and statistical models for some of these problems. However, the question reminds: has PSR exhausted the potential of the knowledgebased approach? If not, are there any
Results 1  10
of
132,235