Search Results for author:
Found 5 papers, 0 papers with code
An Algebra of Properties of Binary Relations
We consider all 16 unary operations that, given a homogeneous binary relation R, define a new one by a boolean combination of xRy and yRx.
Logic Discrete Mathematics 03E20, 08A02 F.4
A Scheme-Driven Approach to Learning Programs from Input/Output Equations
We describe an approach to learn, in a term-rewriting setting, function definitions from input/output equations.
An Improved Algorithm for E-Generalization
E-generalization computes common generalizations of given ground terms w. r. t.
Implementing Anti-Unification Modulo Equational Theory
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 modulo equational theories.
E-Generalization Using Grammars
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 sets.
