Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
This paper presents a hybrid, extensional and asymmetric matching approach designed to find out semantic relations (equivalence and subsumption) between entities issued from two ...
Exception rules have been previously defined as rules with low interest and high confidence. In this paper a new approach to mine exception rules will be proposed and evaluated. In...
—applying the association rule into classification can improve the accuracy and obtain some valuable rules and information that cannot be captured by other classification approac...