Rule-based specifications in Datalog are used in a number of application areas, such as configuration management, access control and trust management, decision making, etc. However, rules sets are typically hard to maintain; the rules often interact in subtle ways, making them difficult to understand and reason about. This has impeded the wide-spread adoption of rule-based computing. This paper...

The novel connection between Raynaud dise ase and fish oils was uncovered from two disjointed biomedical literature sets by Swanson in 1986. Since then, there have been many approaches to uncover novel connections by mining the biomedical literature. One of the popular approaches is to adapt the Association Rule (AR) method to automatically identify implicit novel connections between concept A ...

Fast Paxos is an algorithm for consensus that works by a succession of rounds, where each round tries to decide a value v that is consistent with all past rounds. Rounds are started by a coordinator process and consistency is guaranteed by the rule used by this process for the selection of v and by the properties of process sets called quorums. We show a simplified version of this rule for the ...

The distributed evolutionary computation platform EC-Star is extended in this paper to probabilistic classifiers. This extension, called PRETSL, allows the distributed age-layered evolution of probabilistic rule sets, which in turn makes more fine-grained decisions possible. The method is tested on 20 UCI data problems, as well as a larger dataset of arterial blood pressure waveforms. The Resul...

We consider a general format for sequent rules for not necessarily normal modal logics based on classical or intuitionistic propositional logic and provide relatively simple local conditions ensuring cut elimination for such rule sets. The rule format encompasses e.g. rules for the boolean connectives and transitive modal logics such as S4 or its constructive version. We also adapt the method o...

This paper discusses context-free rewriting systems in which there exist two disjoint finite sets of rules, and a symbol, referred to as a condition of applicability, is attached to each rule in either of these two sets. In one set, a rule with a symbol attached to it is applicable if the attached symbol occurs in the current rewritten string while in the other set, such a rule is applicable if...

Rule weights often have been used to improve the classification accuracy without changing the position of antecedent fuzzy sets. Recently, fuzzy versions of confidence and support merits from the field of data mining have been widely used for rules weighting in fuzzy rule based classifiers. This paper proposes an evolutionary approach for learning rule weights and uses more flexible equations, ...

Contrast set learning is important to discover control variables that can distinguish different groups in a dataset. Association rule mining has an inherent connection to the contrast set learning problem and has also been used to address it. All of the association rule based contrast set learning techniques use support-confidence based methods and inherit their limitations. In recent years sta...

In this paper, we present an approach for compressing a rule-based pairwise classifier ensemble into a single rule set that can be directly used for classification. The key idea is to re-encode the training examples using information about which of the original ruler covers the example, and to use them for training a rule-based meta-level classifier. We not only show that this approach is more ...