Pages that link to "Item:Q1077161"

The following pages link to On sufficient-completeness and related properties of term rewriting systems (Q1077161):

Displaying 43 items.

• Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
• Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
• Proving weak properties of rewriting (Q554217) (← links)
• Reachability analysis over term rewriting systems (Q556686) (← links)
• Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness (Q582891) (← links)
• Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
• Undecidability of ground reducibility for word rewriting systems with variables (Q674184) (← links)
• Testing for the ground (co-)reducibility property in term-rewriting systems (Q685352) (← links)
• Automating inductionless induction using test sets (Q758216) (← links)
• Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications (Q968529) (← links)
• Narrowing based procedures for equational disunification (Q1197097) (← links)
• Extending Bachmair's method for proof by consistency to the final algebra (Q1336767) (← links)
• Proving Ramsey's theory by the cover set induction: A case and comparision study. (Q1353938) (← links)
• Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
• Induction = I-axiomatization + first-order consistency. (Q1854350) (← links)
• Ground reducibility is EXPTIME-complete (Q1887142) (← links)
• Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
• A proof method for local sufficient completeness of term rewriting systems (Q2119990) (← links)
• Stability of termination and sufficient-completeness under pushouts via amalgamation (Q2215962) (← links)
• Sufficient-completeness, ground-reducibility and their complexity (Q2641108) (← links)
• Pumping, cleaning and symbolic constraints solving (Q4632446) (← links)
• Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems (Q4993358) (← links)
• Proving ground confluence and inductive validity in constructor based equational specifications (Q5044723) (← links)
• Computing ground reducibility and inductively complete positions (Q5055712) (← links)
• Inductive proofs by specification transformations (Q5055713) (← links)
• Proofs in parameterized specifications (Q5055758) (← links)
• Program transformation and rewriting (Q5055762) (← links)
• On relationship between term rewriting systems and regular tree languages (Q5055769) (← links)
• Open problems in rewriting (Q5055780) (← links)
• Encompassment properties and automata with constraints (Q5055805) (← links)
• More problems in rewriting (Q5055812) (← links)
• Towards an efficient construction of test sets for deciding ground reducibility (Q5055821) (← links)
• Problems in rewriting III (Q5055847) (← links)
• Equality and disequality constraints on direct subterms in tree automata (Q5096779) (← links)
• Improving rewriting induction approach for proving ground confluence (Q5111302) (← links)
• On the connection between narrowing and proof by consistency (Q5210767) (← links)
• Correctness of Context-Moving Transformations for Term Rewriting Systems (Q5743602) (← links)
• Decidability of regularity and related properties of ground normal form languages (Q5881191) (← links)
• Computing linearizations using test sets (Q5881192) (← links)
• A proof system for conditional algebraic specifications (Q5881266) (← links)
• On sufficient completeness of conditional specifications (Q5881283) (← links)
• Design strategies for rewrite rules (Q5881289) (← links)
• Higher-order proof by consistency (Q6567778) (← links)