2 citations · 2 across the 2 of their papers we have counts for
6 papers
An Algebra of Properties of Binary Relations
Jochen Burghardt
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. Operations can be composed, and connected…
Simple Laws about Nonprominent Properties of Binary Relations
Jochen Burghardt
We checked each binary relation on a 5-element set for a given set of properties, including usual ones like asymmetry and less known ones like Euclideanness. Using a poor man's Qui…
A Scheme-Driven Approach to Learning Programs from Input/Output Equations
Jochen Burghardt
We describe an approach to learn, in a term-rewriting setting, function definitions from input/output equations. By confining ourselves to structurally recursive definitions we obt…
An Improved Algorithm for E-Generalization
Jochen Burghardt
E-generalization computes common generalizations of given ground terms w.r.t. a given equational background theory E. In 2005 [arXiv:1403.8118], we had presented a computation appr…
Weight Computation of Regular Tree Languages
Jochen Burghardt
We present a general framework to define an application-dependent weight measure on terms that subsumes e.g. total simplification orderings, and an O(n log n) algorithm for the sim…
Repetition-Free Derivability from a Regular Grammar is NP-Hard
Jochen Burghardt
We prove the NP-hardness of the problem whether a given word can be derived from a given regular grammar without repeated occurrence of any nonterminal.