The following pages link to Term Rewriting and Applications (Q5703869):
Displaying 19 items.
- A pearl on SAT and SMT solving in Prolog (Q428887) (← links)
- Knuth-Bendix completion of theories of commuting group endomorphisms (Q844197) (← links)
- Fast congruence closure and extensions (Q876046) (← links)
- Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
- Computing congruent closures on terms (Q1280915) (← links)
- NP-completeness of small conflict set generation for congruence closure (Q1688538) (← links)
- On rewriting rules in Mizar (Q1945908) (← links)
- Congruence classes with logic variables (Q2708308) (← links)
- Congruence Closure in Intensional Type Theory (Q2817913) (← links)
- Justifying equality (Q2848059) (← links)
- E-matching for fun and profit (Q2864401) (← links)
- \textsf{CC(X)}: semantic combination of congruence closure with solvable theories (Q2864404) (← links)
- Weakly Equivalent Arrays (Q2964457) (← links)
- Modular SMT Proofs for Fast Reflexive Checking Inside Coq (Q3100210) (← links)
- Search-Space Partitioning for Parallelizing SMT Solvers (Q3453241) (← links)
- Ground Interpolation for the Theory of Equality (Q3617772) (← links)
- Artificial Intelligence and Symbolic Computation (Q5464694) (← links)
- Term Rewriting and Applications (Q5703870) (← links)
- Transforming optimization problems into disciplined convex programming form (Q6648168) (← links)
