This paper addresses the task of comparing two rule sets induced within the same feature space for measuring the knowledge entailed jointly by the two. A procedure that quantifies the similarity of knowledge entailed by two separate rule sets in a given feature space is proposed. A formalized description of the proposed procedure along with its computational complexity analysis, applicability a...

A procedure is given for recognizing sets of inference rules that generate polynomial time decidable inference relations. The procedure can automatically recognize the tractability of the inference rules underlying congruence closure. The recognition of tractability for that particular rule set constitutes mechanical veriication of a theorem originally proved independently by Kozen and Shostak....

We hypothesize that it is possible to obtain significant gains in operational efficiency through the application of simple analysis techniques to firewall rule sets. This paper describes our experiences with a firewall analysis tool and metrics that we have designed and used to help manage large production rule sets. Firewall rule sets typically become increasingly unwieldy over time. It is com...

In reply to Péter Majlender, the connection between the (maximum spread) equidifferent OWA operator weights and the analytical method for the minimum variance OWA operator problem [R. Fullér, P. Majlender, On obtaining minimal variability OWA operator weights, Fuzzy Sets and Systems 136 (2003) 203–215] is pointed out and the differences between them are clarified. 2006 Elsevier Inc. All rights ...

One advantage of evolutionary multiobjective optimization (EMO) algorithms over classical approaches is that many non-dominated solutions can be simultaneously obtained by their single run. This paper shows how this advantage can be utilized in genetic rule selection for the design of fuzzy rulebased classification systems. Our genetic rule selection is a two-stage approach. In the first stage,...

The paper proposes a linear representation of tree structures in order to evolve complex fuzzy rule sets for solving classification problems. In particular, linguistic rules are evolved, where the condition part of a rule can have an arbitrary structure of conjunctions and disjunctions. We describe an efficient rule representation scheme, which uses a genetic algorithm. The method is tested wit...

We reformulate Mesiar’s hypothesis [Possibility measures, integration and fuzzy possibility measures, Fuzzy Sets and Systems 92 (1997) 191196], which as such was shown to be untrue by Murofushi [Two-valued possibility measures induced by σ-finite σ-additive measures, Fuzzy Sets and Systems 126 (2002) 265268]. We prove that a two-valued σ-maxitive measure can be induced by a σ-additive measure u...

It is shown that, for any spatial frame L (i.e., L is a complete lattice generated by the set of all prime elements), both the specialization L-preorder of L-topological spaces introduced by Lai and Zhang [Fuzzy preorder and fuzzy topology, Fuzzy Sets and Systems 157 (2006) 1865–1885] and that of L-fuzzifying topological spaces introduced by Fang and Qiu [Fuzzy orders and fuzzifying topologies,...