Uniform strategies: The CADE-11 theorem proving contest

DOI10.1007/BF00881871zbMath0802.68131OpenAlexW2022463772MaRDI QIDQ1319384

Ewing L. Lusk, William W. McCune

Publication date: 12 April 1994

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

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

zbMATH Keywords

strategyresolutionautomated theorem provingKnuth-Bendix completionparamodulationconference on automated deduction

Mathematics Subject Classification ID

Related Items (1)

Evolving combinators

Uses Software

• OTTER
• AURA
• Roo

Cites Work

• Unnamed Item
• The absence and the presence of fixed point combinators
• Complexity and related enhancements for automated theorem-proving programs
• Automated proofs of equality problems in Overbeek's competition
• Problems and Experiments for and with Automated Theorem-Proving Programs

This page was built for publication: Uniform strategies: The CADE-11 theorem proving contest