Querying Proofs

We motivate and introduce a query language PrQL designed for inspecting machine representations of proofs. PrQL natively supports hiproofs which express proof structure using hierarchical nested labelled trees. The core language presented in this paper is locally structured, with queries built using recursion and patterns over proof structure and rule names. We define the syntax and semantics of locally structured queries, demonstrate their power, and sketch some implementation experiments.

• Type: Journal
• Year: 2012
• Where: LPAR
• Authors: David Aspinall, Ewen Denney, Christoph Lüth
• Keywords: Automated Reasoning, LPAR 2012, Machine Representations, Proof Structure, Syntax And Semantics