The following pages link to (Q5591533):
Displaying 16 items.
- Linearity and regularity with negation normal form (Q703486) (← links)
- Refutational theorem proving using term-rewriting systems (Q802317) (← links)
- Gersten resolution with support (Q1014800) (← links)
- Logic applied to integer programming and integer programming applied to logic (Q1130078) (← links)
- Analytic resolution in theorem proving (Q1233325) (← links)
- Mechanizing \(\omega\)-order type theory through unification (Q1239309) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- A representation of stably compact spaces, and patch topology. (Q1427774) (← links)
- Formalization of the resolution calculus for first-order logic (Q1663242) (← links)
- A syntactical proof of the Marriage Lemma. (Q1853584) (← links)
- Renamable paramodulation for automatic theorem proving with equality (Q2542996) (← links)
- Theorem proving with variable-constrained resolution (Q2554609) (← links)
- (Q4329727) (← links)
- Semantic trees revisited: Some new completeness results (Q4647548) (← links)
- (Q4770509) (← links)
- Complete inference via knowledge Petri nets and resolution rules (Q6564892) (← links)
