3 citations · 8 across the 12 of their papers we have counts for
Showing 2014 · cs.LOShow all
3 papers · 2 filters
cs.LO2014★ 3 cited
Implementing Anti-Unification Modulo Equational Theory
Jochen Burghardt, Birgit Heinz
We present an implementation of E-anti-unification as defined in Heinz (1995), where tree-grammar descriptions of equivalence classes of terms are used to compute generalizations m…
cs.LO2014
Axiomatization of Finite Algebras
Jochen Burghardt
We show that the set of all formulas in n variables valid in a finite class A of finite algebras is always a regular tree language, and compute a finite axiom set for A. We give a…
cs.LO2014
E-Generalization Using Grammars
Jochen Burghardt
We extend the notion of anti-unification to cover equational theories and present a method based on regular tree grammars to compute a finite representation of E-generalization set…