Anti-patterns for rule-based languages

DOI10.1016/j.jsc.2010.01.007zbMath1192.68563MaRDI QIDQ968527

Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pierre-Etienne Moreau

Publication date: 5 May 2010

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2010.01.007

zbMATH Keywords

associativity; pattern matching; pattern-based language; equational theory; disunification; complement problem; anti-pattern; equational problem; list matching; rule-based language

Mathematics Subject Classification ID

68T10: Pattern recognition, speech recognition

Uses Software

• Mathematica
• Stratego
• OCaml
• Scala
• Tom
• ASF+SDF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete and recursive feature theory
• Flat matching
• Complexity of matching problems
• Explicit representation of terms defined by counter examples
• Equational problems and disunification
• Combining matching algorithms: The regular case
• A new method for undecidability proofs of first order theories
• On the expressivity of feature logics with negation, functional uncertainty, and sort equations
• A feature constraint system for logic programming with entailment
• Decidability of systems of set constraints with negative constraints
• The complexity of counting problems in equational matching
• Combining decision algorithms for matching in the union of disjoint equational theories
• Solving equations with sequence variables and sequence functions
• Normalized rewriting: An alternative to rewriting modulo a set of equations
• Anti-pattern Matching Modulo
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• TQL: a query language for semistructured data based on the ambient logic
• Anti-pattern Matching