The following pages link to (Q3789100):
Displaying 22 items.
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Using forcing to prove completeness of resolution and paramodulation (Q757093) (← links)
- Conditional narrowing modulo a set of equations (Q1261194) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Proving Ramsey's theory by the cover set induction: A case and comparision study. (Q1353938) (← links)
- Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315) (← links)
- Cancellative Abelian monoids and related structures in refutational theorem proving. I (Q1864898) (← links)
- Cancellative Abelian monoids and related structures in refutational theorem proving. II (Q1864899) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- Predicate Elimination for Preprocessing in First-Order Theorem Proving (Q2818027) (← links)
- Harald Ganzinger’s Legacy: Contributions to Logics and Programming (Q4916069) (← links)
- From Search to Computation: Redundancy Criteria and Simplification at Work (Q4916077) (← links)
- Proof normalization for resolution and paramodulation (Q5055708) (← links)
- Reduction techniques for first-order reasoning (Q5881189) (← links)
- Conditional term rewriting and first-order theorem proving (Q5881190) (← links)
- Proving group isomorphism theorems (Q5881193) (← links)
- Implementing contextual rewriting (Q5881200) (← links)
- Conditional rewriting in focus (Q5881263) (← links)
- A maximal-literal unit strategy for horn clauses (Q5881264) (← links)
- Completion procedures as semidecision procedures (Q5881279) (← links)
- Formalizing Bachmair and Ganzinger's ordered resolution prover (Q5919011) (← links)
- On restrictions of ordered paramodulation with simplification (Q6488549) (← links)
