arXiv (All)
open access
Equality saturation theory exploration à la carte
Rewrite rules are critical in equality saturation, an increasingly popular technique in optimizing compilers, synthesizers, and verifiers. Unfortunately, developing high-quality rulesets is difficult and error-prone. Recent work to automatically infer rewrite rules does not scale to large terms or g
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Augmenting Rewrite Rule Sets via Knuth-Bendix Completion#1156518
- Escaping Brittleness : The Possibilities of General Purpose Machine Learning Algorithms Applied To Parallel Rule-Based Systems#478142
- String Rewriting Systems: Brief Introduction and Sample of Open Problems#973320
- COEVO: Co-Evolutionary Framework for Joint Functional Correctness and PPA Optimization in LLM-Based RTL Generation#19065
- LASER: A Data-Centric Method for Low-Cost and Efficient SQL Rewriting based on SQL-GRPO#2752
Record · ID 1035611
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive