Search

Possibility distribution provides an alternative explanation of linguistic terms in an hesitant fuzzy linguistic term set (HFLTS). It is generated from a given HFLTS based on the assumption that all linguistic terms in an HFLTS follow a uniform distribution. In decision making contexts, linguistic terms in each HFLTS are assumed to exhibit the same possibility to represent the decision-maker(DM)’s assessment rating. However, DMs may give ratings based on different assessing attitudes because of individual differences in cognitive styles. In practice, comparative linguistic expressions are generally converted into HFLTSs through the transformation process as DMs usually use comparative linguistic expressions instead of HFLTSs when giving ratings. The transformed HFLTSs likewise exclude the DMs’ assessing attitudes. To enhance the interpretability of generated possibility distributions, this paper relaxes the original assumption of uniform distribution and incorporates an attitudinal dimension into the transformation process that converts comparative linguistic expressions to HFLTSs. With these modified conditions for possibility distribution generation, an assessing attitude-driven approach is proposed based on probability density functions (PDFs) to generate HFLTS possibility distributions. The proposed PDF-based HFLTS possibility distributions personalize individual semantics and further facilitate the process of computing with words to obtain assessing attitude-embedded accurate linguistic results that are easy for individuals to interpret and understand. [ABSTRACT FROM AUTHOR]

Abstract: The complexity and impact of many real world decision making problems lead to the necessity of considering multiple points of view, building group decision making problems in which a group of experts provide their preferences to achieve a solution. In such complex problems uncertainty is often present and although the use of linguistic information has provided successful results in managing it, these are sometimes limited because the linguistic models use single-valued and predefined terms that restrict the richness of freely eliciting the preferences of the experts. Usually, experts may doubt between different linguistic terms and require richer expressions to express their knowledge more accurately. However, linguistic group decision making approaches do not provide any model to make more flexible the elicitation of linguistic preferences in such hesitant situations. In this paper is proposed a new linguistic group decision model that facilitates the elicitation of flexible and rich linguistic expressions, in particular through the use of comparative linguistic expressions, close to human beings’ cognitive models for expressing linguistic preferences based on hesitant fuzzy linguistic term sets and context-free grammars. This model defines the group decision process and the necessary operators and tools to manage such linguistic expressions. [Copyright &y& Elsevier]

Abstract: This paper presents a method to generate test cases for sequential programs and concurrent programs written in a flow based program language. Test cases of sequential programs are generated based on condition calculation, and can be combined together to form SYN-sequences for concurrent program testing. Semantics of the language provides an infrastructure for the test case generation, and thus our method may be considered as a rigorous and systematic approach to the program testing. Compared with some formal testing methods, our method can avoid hitting state explosion problem in the test formation. Besides, the complexity analysis reveals that our method is time saving. Our method has been applied to generate test cases for PPP over ATM, a subsystem of IAD that runs data and voice over DSL. [Copyright &y& Elsevier]

Abstract: The purpose of this paper is to introduce a kind of computational model, called possibility computation, to deal with non-determinism. Both its denotational and logical semantics in the framework of domain theory are established and their equivalence is verified. In this approach, the denotational semantics will be set up by assigning to programs possibility state transformers, i.e., Scott-continuous functions from the domain of input states to the possibility powerdomain of the codomain of final states. This possibility powerdomain of a dcpo will consist of all possibility valuations, ordered pointwise, of this dcpo. The logical semantics will be given by fuzzy predicate transformers introduced by the first author and Jung following Dijkstra’s predicate transformers. Two semantics equivalence will be verified in terms of the integration of fuzzy predicates with respect to possibility valuations. The categorical monad of the possibility powerdomain will be investigated. [Copyright &y& Elsevier]

Abstract: From the viewpoint of semantics, lattice implication algebras provide a basis to establish lattice-valued logic with truth value in a relatively general lattice. In this paper, we first introduce two notions of lattice implication n-ordered semigroup and lattice implication p-ordered semigroup, which induced by lattice implication algebras. Secondly, we study some of their basic properties and prove that a lattice implication n-ordered semigroup is a residuated semigroup, and a lattice implication p-ordered semigroup is an arithmetic lattice ordered semigroup. We also define the homomorphism mapping between lattice implication n-ordered semigroups. Finally, we discuss some properties of filters and sl ideals in lattice implication n-ordered semigroups and lattice implication p-ordered semigroups. [Copyright &y& Elsevier]