Communications of the ACM
Complete sets of transformations for general E-unification
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Handbook of theoretical computer science (vol. B)
The replay of program derivations
The replay of program derivations
Automata for reduction properties solving
Journal of Symbolic Computation
Inductive logic programming and knowledge discovery in databases
Advances in knowledge discovery and data mining
Recent advances of grammatical inference
Theoretical Computer Science - Special issue on algorithmic learning theory
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
Inductive logic programming: issues, results and the challenge of learning language in logic
Artificial Intelligence - Special issue on applications of artificial intelligence
Inductive Logic Programming: Techniques and Applications
Inductive Logic Programming: Techniques and Applications
Pumping, Cleaning and Symbolic Constraints Solving
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Equality and Disequality Constraints on Direct Subterms in Tree Automata
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization Problems
RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Axiomatization of Finite Algebras
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
A Model of the "Redescription" Process in the Context of Geometric Proportional Analogy Problems
AII '92 Proceedings of the International Workshop on Analogical and Inductive Inference
Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs
Proceedings of the 10th International Conference on Automated Deduction
Sorted Unification Using Set Constraints
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Determining detailed structural correspondence for generalization tasks
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Semi-automating small-scale source code reuse via structural correspondence
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Symbolic program analysis using term rewriting and generalization
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
The re-representation problem in a logic-based framework for analogy making
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
| Hi-index | 0.00 |
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. We present a framework to combine Inductive Logic Programming and E-generalization that includes an extension of Plotkin's lgg theorem to the equational case. We demonstrate the potential power of E-generalization by three example applications: computation of suggestions for auxiliary lemmas in equational inductive proofs, computation of construction laws for given term sequences, and learning of screen editor command sequences.