Pages that link to "Item:Q420848"

The following pages link to Sufficient completeness verification for conditional and constrained TRS (Q420848):

Displaying 5 items.

• Rewriting modulo SMT and open system analysis (Q347384) (← links)
• Proving weak properties of rewriting (Q554217) (← links)
• On transforming cut- and quantifier-free cyclic proofs into rewriting-induction proofs (Q2163179) (← links)
• Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems (Q4993358) (← links)
• Incremental Proofs of Termination, Confluence and Sufficient Completeness of OBJ Specifications (Q5403069) (← links)