A Modular Equational Generalization Algorithm
From MaRDI portal
Publication:3617428
DOI10.1007/978-3-642-00515-2_3zbMath1185.68219OpenAlexW2172096803WikidataQ57978178 ScholiaQ57978178MaRDI QIDQ3617428
José Meseguer, Santiago Escobar, Pedro Ojeda, María Alpuente
Publication date: 24 March 2009
Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00515-2_3
Related Items (11)
Order-sorted equational generalization algorithm revisited ⋮ ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance ⋮ Optimization of rewrite theories by equational partial evaluation ⋮ Algebraic Reinforcement Learning ⋮ Twenty years of rewriting logic ⋮ Symbolic Specialization of Rewriting Logic Theories with Presto ⋮ A modular order-sorted equational generalization algorithm ⋮ A partial evaluation framework for order-sorted equational programs modulo axioms ⋮ Debugging Maude programs via runtime assertion checking and trace slicing ⋮ Order-Sorted Generalization ⋮ Anti-unification for unranked terms and hedges
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Unification theory
- Conditional rewriting logic as a unified model of concurrency
- ELAN from a rewriting logic point of view
- The origins of structural operational semantics
- Inductive Logic Programming: Issues, results and the challenge of Learning Language in Logic
- Narrowing and Rewriting Logic: from Foundations to Applications
- Specialization of functional logic programs based on needed narrowing
- Order-Sorted Generalization
This page was built for publication: A Modular Equational Generalization Algorithm
