Anti-Pattern Matching Modulo - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Anti-Pattern Matching Modulo


Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. In a previous work, we have extended the notion of term to the one of anti-term that may contain complement symbols. Matching such anti-terms against terms has the nice property of being unitary. Here we generalize the syntactic anti-pattern matching to anti-pattern matching modulo an arbitrary equational theory E, and we study the specific and practically very useful case of associativity, possibly with a unity (AU). To this end, based on the syntacticness of associativity, we present a rule-based associative matching algorithm, and we extend it to AU. This algorithm is then used to solve AU anti-pattern matching problems. This allows us to be generic enough so that for instance, the AllDiff standard predicate of constraint programming becomes simply expressible in this framework. AU anti-patterns are implemented in the Tom language and we show some examples of their usage.
Fichier principal
Vignette du fichier
antiPatternsModulo.pdf (281.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00176055 , version 1 (02-10-2007)


  • HAL Id : inria-00176055 , version 1


Claude Kirchner, Radu Kopetz, Pierre-Etienne Moreau. Anti-Pattern Matching Modulo. 21th International Workshop on Unification - UNIF'07, 2007, Paris, France. ⟨inria-00176055⟩
68 View
118 Download


Gmail Facebook X LinkedIn More