E-generalization using grammars
From MaRDI portal
Publication:2457667
DOI10.1016/j.artint.2005.01.008zbMath1132.68723arXiv1403.8118OpenAlexW2028789575MaRDI QIDQ2457667
Publication date: 23 October 2007
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.8118
Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27) Grammars and rewriting systems (68Q42) Logic programming (68N17) Equational classes, universal algebra in model theory (03C05)
Related Items (8)
Higher-order pattern anti-unification in linear time ⋮ Unranked second-order anti-unification ⋮ A Library of Anti-unification Algorithms ⋮ Anti-unification in Constraint Logic Programming ⋮ Variant-based equational anti-unification ⋮ A modular order-sorted equational generalization algorithm ⋮ Anti-unification and the theory of semirings ⋮ Anti-unification for unranked terms and hedges
Uses Software
Cites Work
- Complete sets of transformations for general E-unification
- Recent advances of grammatical inference
- Untersuchungen über das logische Schliessen. I
- Automata for reduction properties solving
- Inductive Logic Programming: Issues, results and the challenge of Learning Language in Logic
- A theory of the learnable
- Variations on the Common Subexpression Problem
- Pumping, cleaning and symbolic constraints solving
- Unification, weak unification, upper bound, lower bound, and generalization problems
- Equality and disequality constraints on direct subterms in tree automata
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Language identification in the limit
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: E-generalization using grammars
