Pages that link to "Item:Q914411"
From MaRDI portal
The following pages link to Completeness of resolution revisited (Q914411):
Displaying 15 items.
- Meta-resolution: An algorithmic formalisation (Q671650) (← links)
- Using forcing to prove completeness of resolution and paramodulation (Q757093) (← links)
- On the relation between resolution based and completion based theorem proving (Q758218) (← links)
- Resolvability vs. almost resolvability (Q1030207) (← links)
- Completeness of hyper-resolution via the semantics of disjunctive logic programs (Q1041788) (← links)
- Ideal resolvability (Q1292727) (← links)
- Generalized resolution and NC-resolution (Q1331227) (← links)
- Understanding PPA-completeness (Q2208253) (← links)
- On the Relative Strength of Pebbling and Resolution (Q2946664) (← links)
- (Q3079708) (← links)
- Another technique for proving completeness of ground resolution (Q3971269) (← links)
- (Q4027537) (← links)
- (Q4229110) (← links)
- Understanding PPA-completeness (Q5368757) (← links)
- Set-of-support strategy for higher-order logic (Q5881215) (← links)