Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem.
Adriano BarileStefano BerardiLuca RoversiPublished in: CoRR (2024)
Keyphrases
- termination analysis
- real valued
- presburger arithmetic
- boolean functions
- cellular automata
- active rules
- database systems
- high speed
- truth table
- vlsi circuits
- logic synthesis
- rewrite rules
- rewrite systems
- analog vlsi
- delay insensitive
- electronic circuits
- database
- analog circuits
- multi valued
- active databases
- conjunctive queries
- rewriting rules
- quantum computing
- term rewriting
- object categories
- databases