Resolution on formula-trees

DOI10.1007/BF02737109zbMath0637.68102OpenAlexW2079688484WikidataQ56459095 ScholiaQ56459095MaRDI QIDQ1098648

Ulf R. Schmerl

Publication date: 1988

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02737109

zbMATH Keywords

formula-treesnonclausal resolution calculus

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Cites Work

• Seventy-five problems for testing automatic theorem provers
• Completely non-clausal theorem proving
• Untersuchungen über das logische Schliessen. I
• An improved proof procedure1
• Special relations in automated deduction
• A Machine-Oriented Logic Based on the Resolution Principle
• Proof theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Resolution on formula-trees