Pages that link to "Item:Q5541352"
From MaRDI portal
The following pages link to Theorem-Proving for Computers: Some Results on Resolution and Renaming (Q5541352):
Displaying 13 items.
- Parsing as non-Horn deduction (Q688151) (← links)
- Completeness of resolution revisited (Q914411) (← links)
- Experimental tests of resolution-based theorem-proving strategies (Q1230669) (← links)
- A linear algorithm for renaming a set of clauses as a Horn set (Q1318709) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)
- Renamable paramodulation for automatic theorem proving with equality (Q2542996) (← links)
- Finding resolution proofs and using duplicate goals in AND/OR trees (Q2549243) (← links)
- Theorem proving with variable-constrained resolution (Q2554609) (← links)
- Beweisalgorithmen für die Prädikatenlogik (Q2558006) (← links)
- Struktursätze der Algebra und Kompliziertheit logischer Schemata. III Algebraische Theorien und Verallgemeinerungen (Q4067159) (← links)
- Négation constructive et axiomatique interne (Q4385672) (← links)
- MRPPS?An interactive refutation proof procedure system for question-answering (Q4766066) (← links)
