The following pages link to (Q4411848):
Displaying 7 items.
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- Automated theorem proving in temporal logic: \(T\)-resolution (Q1322389) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
- Automated theorem proving by resolution in non-classical logics (Q2385426) (← links)
- Automating algebraic proof systems is NP-hard (Q6086995) (← links)
