Name
Abstract | ||
|---|---|---|
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 recent work, the notion of term was extended to the one of anti-term, i.e. terms that may contain complement symbols. Here we generalize the syntactic anti-pattern matching to anti-pattern matching modulo an arbitrary equational theory E, and we study the specic 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 toAU. This algorithm is then used to solveAU anti-pattern matching problems. This allows us to be generic enough so that for instance, the AllDi 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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-88282-4_26 | language and automata theory and applications |
Keywords | Field | DocType |
anti-pattern matching modulo,negative condition,rule-based associative,alldiffstandard predicate,constraint programming,syntacticnessof associativity,syntactic anti-pattern,recent work,human thinking,moduloan arbitrary equational theory,anti-pattern matching problem,pattern matching,rule based,use case | Discrete mathematics,Combinatorics,Associative property,Negation,Modulo,Constraint programming,Predicate (grammar),Anti-pattern,Syntax,Blossom algorithm,Mathematics | Conference |
Volume | ISSN | Citations |
5196 | 0302-9743 | 3 |
PageRank | References | Authors |
0.40 | 22 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Claude Kirchner | 1 | 5 | 1.15 |
| Radu Kopetz | 2 | 98 | 4.42 |
| Pierre-etienne Moreau | 3 | 598 | 40.40 |