Statistical distribution of chemical fingerprints p. 11 Fuzzy transforms and their applications to image compression p. 19 Development of neuro-fuzzy system for image mining p. 32 Reinforcement distribution in continuous state action space fuzzy Q-learning : a novel approach p. 40 A possibilistic approach to combinatorial optimization problems on fuzzy-valued matroids p. 46 Possibilistic planni...

Implicit discourse relation recognition is difficult due to the absence of explicit discourse connectives between arbitrary spans of text. In this paper, we use language models to predict the discourse connectives between the arguments pair. We present two methods to apply the predicted connectives to implicit discourse relation recognition. One is to use the sense frequency of the specific con...

Discourse relation classification is an important component for automatic discourse parsing and natural language understanding. The performance bottleneck of a discourse parser comes from implicit discourse relations, whose discourse connectives are not overtly present. Explicit discourse connectives can potentially be exploited to collect more training data to collect more data and boost the p...

We present an approach to automatically identifying the arguments of discourse connectives based on data from the Penn Discourse Treebank. Of the two arguments of connectives, called Arg1 and Arg2, we focus on Arg1, which has proven more challenging to identify. Our approach employs a sentence-based representation of arguments, and distinguishes intra-sentential connectives, which take both the...

Arguments have always played a central role within logic and philosophy. But little attention has been paid to arguments as distinctive kind of discourse, with its own semantics pragmatics. The goal this essay is study the mechanisms by means which we make in starting from argument connectives such ‘therefore’. While some proposals made literature, they fail account for anaphoric behavior ‘ther...

Contingency tables often arise from collecting patient data and from lab experiments. A typical question to be answered based on a contingency table is whether the rows or the columns show a significant difference. Median Polish (MP) is fast becoming a prefered way to analyse contingency tables based on a simple additive model. Often, the data need to be transformed before applying the MP algor...

We propose an approach to approximate reasoning by systems of intelligent agents based on the paradigm of rough mereology. In this approach, the knowledge of each agent is formalized as an information system (a data table) from which similarity measures on objects manipulated by this agent are inferred. These similarity measures are based on rough mereological inclusions which formally render d...

In previous studies, we have shown that an Adaboost-based fitness can be successfully combined with a Genetic Algorithm to iteratively learn fuzzy rules from examples in classification problems. Unfortunately, some restrictive constrains in the implementation of the logical connectives and the inference method were assumed. Alas, the knowledge bases Adaboost produce are only compatible with an ...

Among various approaches to fuzzy logics, we have chosen two of them, which are built up in a similar way. Although starting from diierent basic logical connectives, they both use interpretations based on Frank t-norms. Diierent interpretations of the implication lead to diierent axiomatizations, but most logics studied here are complete. We compare the properties, advantages and disadvantages ...