Anti-patterns for rule-based languages
From MaRDI portal
Publication:968527
DOI10.1016/j.jsc.2010.01.007zbMath1192.68563OpenAlexW2075433022MaRDI QIDQ968527
Claude Kirchner, Horatiu Cirstea, Pierre-Etienne Moreau, Radu Kopetz
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
associativitypattern matchingpattern-based languageequational theorydisunificationcomplement problemanti-patternequational problemlist matchingrule-based language
Related Items
Variadic equational matching in associative and commutative theories, Anti-unification for unranked terms and hedges
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
