Anti-unification and the theory of semirings
From MaRDI portal
Publication:2215964
DOI10.1016/J.TCS.2020.10.020zbMATH Open1464.68138OpenAlexW3094511856MaRDI QIDQ2215964FDOQ2215964
Authors: David M. Cerna
Publication date: 15 December 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.10.020
Recommendations
Cites Work
- Title not available (Why is that?)
- Unification theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars
- Unification in monoidal theories
- A Generic Framework for Higher-Order Generalizations.
- Unification theory
- Complete sets of unifiers and matchers in equational theories
- Unification under associativity and idempotence is of type nullary
- The theory of idempotent semigroups is of unification type zero
- A modular order-sorted equational generalization algorithm
- Higher order generalization and its application in program verification
- Inductive synthesis of functional programs. Universal planning, folding of finite programs, and schema abstraction by analogical reasoning.
- Inductive theorem proving based on tree grammars
- Idempotent anti-unification
- Term-graph anti-unification
- Higher-order pattern anti-unification in linear time
- E-generalization using grammars
- Unification, weak unification, upper bound, lower bound, and generalization problems
Cited In (1)
Uses Software
This page was built for publication: Anti-unification and the theory of semirings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215964)