The following pages link to Graham Wrightson (Q820147):
Displayed 14 items.
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- A truncation technique for clausal analytic tableaux (Q1198076) (← links)
- Paramodulated connection graphs (Q1257912) (← links)
- (Q2753606) (← links)
- (Q2785438) (← links)
- a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution (Q2947006) (← links)
- (Q3338217) (← links)
- (Q3344174) (← links)
- (Q3944043) (← links)
- (Q4499290) (← links)
- An open research problem: strong completeness of R Kowalski's connection graph proof procedure (Q4532365) (← links)
- (Q4707767) (← links)
- (Q4860660) (← links)
- Parameterized and Exact Computation (Q5311515) (← links)