A resolution rule for well-formed formulae

DOI10.1016/0304-3975(91)90192-5zbMath0731.68090OpenAlexW2094992993MaRDI QIDQ808295

Harish Karnick, K. S. H. S. R. Bhatta

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90192-5

zbMATH Keywords

interactive theorem provingQ-unificationWFF-resolution

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Seventy-five problems for testing automatic theorem provers
• Completely non-clausal theorem proving
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A resolution rule for well-formed formulae