The applicability of logic program analysis and transformation to theorem proving

DOI10.1007/3-540-58156-1_15zbMath1433.68543OpenAlexW1487533857MaRDI QIDQ5210773

John P. Gallagher, D. A. de Waal

Publication date: 21 January 2020

Published in: Automated Deduction — CADE-12 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58156-1_15

Mathematics Subject Classification ID

Logic programming (68N17) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items

Symbolic Specialization of Rewriting Logic Theories with Presto, The applicability of logic program analysis and transformation to theorem proving

Uses Software

• TPTP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Near-Horn prolog and beyond
• Most specific logic programs
• Partial evaluation in logic programming
• A framework for defining logics
• Type analysis of prolog using type graphs
• Knowledge compilation and theory approximation
• The applicability of logic program analysis and transformation to theorem proving
• The TPTP problem library