Cited in
(11)- Automatically Proving and Disproving Feasibility Conditions
- Formalizing soundness and completeness of unravelings
- Certifying confluence of almost orthogonal CTRSs via exact tree automata completion
- TALP
- CSI
- Saigawa
- Conditional Confluence
- CO3
- FORT
- AGES
- Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems
This page was built for software: ConCon
