Variadic equational matching in associative and commutative theories
type: Item
instance of: scholarly article
title: Variadic equational matching in associative and commutative theories
author: B. Dundua
author: Temur Kutsia
author: Mircea Marin
published in: Journal of Symbolic Computation
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68N15
Mathematics Subject Classification ID: 33F10
zbMATH DE Number: 7354268
zbMATH Keywords: pattern matching
zbMATH Keywords: equational theories
zbMATH Keywords: variadic symbols
zbMATH Keywords: Mathematica
describes a project that uses: Theorema
describes a project that uses: Maude
describes a project that uses: XCentric
describes a project that uses: Mathematica
describes a project that uses: CLP(Flex)
MaRDI profile type: Publication
full work available at URL: j.jsc.2021.01.001
OpenAlex ID: W3121945794
cites work: Unification theory
cites work: Complexity of matching problems
cites work: \textit{Theorema}: Towards computer-aided mathematical theory exploration
cites work: Anti-patterns for rule-based languages
cites work: All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
cites work: Proving termination with multiset orderings
cites work: Q3174559
cites work: CLP(H):Constraint logic programming for hedges
cites work: Variadic equational matching
cites work: Single elementary associative-commutative matching
cites work: Q4447218
cites work: Complete sets of unifiers and matchers in equational theories
cites work: Flexary Operators for Formalized Mathematics
cites work: Regular expression pattern matching for XML
cites work: Q4808726
cites work: Q4447245
cites work: Artificial Intelligence and Symbolic Computation
cites work: Solving equations with sequence variables and sequence functions
cites work: Flat matching
cites work: Regular expression order-sorted unification and matching
cites work: Foundations of the rule-based system ρLog
cites work: Rewriting techniques and applications. 14th international conference, RTA 2003, Valencia, Spain, June 9--11, 2003. Proceedings
cites work: The complexity of satisfiability problems
cites work: Q3157964
DOI: 10.1016/J.JSC.2021.01.001
Recommended article: Variadic equational matching
Recommended article: Q3335752
Recommended article: Complete sets of unifiers and matchers in equational theories
Recommended article: Q4222854
Recommended article: Q4028345
Recommended article: Q4339470
Recommended article: Some Varieties of Equational Logic
Recommended article: Equational theories of varieties defined by P-compatible identities of Boolean algebras
Recommended article: Equational Reasoning with Applicative Functors
Recommended article: Theorem proving using equational matings and rigid E -unification
description: scientific article; zbMATH DE number 7354268