Pages that link to "Item:Q758216"
From MaRDI portal
The following pages link to Automating inductionless induction using test sets (Q758216):
Displaying 12 items.
- Deciding quasi-reducibility using witnessed test sets (Q1288435) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- Observational proofs by rewriting. (Q1607227) (← links)
- Induction using term orders (Q1915132) (← links)
- AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS (Q3021959) (← links)
- Superposition for Fixed Domains (Q3540186) (← links)
- Deciding the Inductive Validity of ∀ ∃ * Queries (Q3644758) (← links)
- Proving ground confluence and inductive validity in constructor based equational specifications (Q5044723) (← links)
- Towards an efficient construction of test sets for deciding ground reducibility (Q5055821) (← links)
- Induction using term orderings (Q5210765) (← links)
- A general framework to build contextual cover set induction provers (Q5950934) (← links)
