Computing congruent closures on terms
type: Item
instance of: scholarly article
title: Computing congruent closures on terms
zbMATH Open document ID: 0915.68095
DOI: 10.1007/BF02733112
author: K. Appert
published in: Cybernetics and Systems Analysis
publication date: 1999-04-28T00:00:00Z
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 1262978
zbMATH Keywords: symbolic computation
zbMATH Keywords: computer algebra
MaRDI profile type: Publication
cites work: Variations on the Common Subexpression Problem
cites work: Q5829025
Recommended article: Artificial Intelligence and Symbolic Computation
Recommended article: Congruence Closure of Compressed Terms in Polynomial Time
Recommended article: Abstract congruence closure
Recommended article: Computations with finite closure systems and implications
Recommended article: Fast congruence closure and extensions
Recommended article: Term Rewriting and Applications
Recommended article: Computing congruence lattices of finite lattices
Recommended article: Closed congruences on semigroups
Recommended article: On computable aspects of algebraic and definable closure
Recommended article: Congruence Closure with Free Variables
description: scientific article; zbMATH DE number 1262978