L.P.L. A fuzzy programming language. I: Syntactic aspects
From MaRDI portal
Publication:1136234
DOI10.1016/0165-0114(80)90052-4zbMath0426.68062OpenAlexW4240161099MaRDI QIDQ1136234
Publication date: 1980
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0165-0114(80)90052-4
Related Items
Fuzzy decision trees, Some applications of the L.P.L. language to combinatorial programming, A fuzzy language., Semantics of non-deterministic possibility computation, A family of fuzzy programming languages, Pragmatic aspect of fuzzy programming, Control problems in fuzzy systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some applications of the L.P.L. language to combinatorial programming
- Vagueness, truth and logic
- Fuzzy and probabilistic programs
- The concept of a linguistic variable and its application to approximate reasoning. III
- L-fuzzy sets
- The logic of inexact concepts
- Algebraic properties of fuzzy sets
- Quantitative fuzzy semantics
- Foundational aspects of theories of measurement
- An experiment in linguistic synthesis with a fuzzy logic controller
- The Representation of Fuzzy Knowledge
- Concept representation in natural and artificial languages: Axioms, extensions and applications for fuzzy sets
- On the Complexity of Causal Models
- The denotational semantics of programming languages
- Advances in the linguistic synthesis of fuzzy controllers
- Fuzzy Decision Tree Algorithms
- APPLICATION OF FUZZY SET THEORY TO ECONOMICS
- PRUF—a meaning representation language for natural languages
- Outline of a New Approach to the Analysis of Complex Systems and Decision Processes
- Fuzzy sets
- Nondeterministic Algorithms
- An axiomatic basis for computer programming
- Decision-Making in a Fuzzy Environment
- On the Execution of Fuzzy Programs Using Finite-State Machines