Pages that link to "Item:Q5901568"
From MaRDI portal
The following pages link to Rewriting Techniques and Applications (Q5901568):
Displaying 10 items.
- A rewriting approach to satisfiability procedures. (Q1401930) (← links)
- Use of logical models for proving infeasibility in term rewriting (Q1751429) (← links)
- Towards more precise rewriting approximations (Q2424681) (← links)
- Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems (Q2827837) (← links)
- Certifying term rewriting proofs in ELAN (Q2841249) (← links)
- Characterization Theorems for Revision of Logic Programs (Q2851279) (← links)
- Verifying Reachability-Logic Properties on Rewriting-Logic Specifications (Q2945720) (← links)
- Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs (Q5403086) (← links)
- Conditional term rewriting and first-order theorem proving (Q5881190) (← links)
- A general theory of confluent rewriting systems for logic programming and its applications (Q5935989) (← links)