Querying proofs

Authors:
David Aspinall;Ewen Denney;Christoph Lüth
Affiliations:
LFCS, School of Informatics, University of Edinburgh, Edinburgh, Scotland;SGT, NASA Ames Research Center, Moffett Field, CA;Deutsches Forschungszentrum für Künstliche Intelligenz, Bremen, Germany
Venue:
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2012

Citing 13
Cited 2

Design of Flexible Static Program Analyzers with PQL

IEEE Transactions on Software Engineering
A Skeptic’s Approach to Combining HOL and Maple

Journal of Automated Reasoning
A Spatial Logic for Querying Graphs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Proof Terms for Simply Typed Higher Order Logic

TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
A Prototype Proof Translator from HOL to Coq

TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Proof Generation in the Touchstone Theorem Prover

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
UnQL: a query language and algebra for semistructured data based on structural recursion

The VLDB Journal — The International Journal on Very Large Data Bases
ASTLOG: a language for examining abstract syntax trees

DSL'97 Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997
Survey of graph database models

ACM Computing Surveys (CSUR)
Hiproofs: A Hierarchical Notion of Proof Tree

Electronic Notes in Theoretical Computer Science (ENTCS)
A proof markup language for Semantic Web services

Information Systems
Using the TPTP language for writing derivations and finite interpretations

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Web and semantic web query languages: a survey

Proceedings of the First international conference on Reasoning Web

A query language for formal mathematical libraries

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Capturing hiproofs in HOL light

CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.