@inproceedings{pub5817,
    series = {Lecture Notes in Computer Science, LNCS},
    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.
},
    year = {2012},
    title = {Querying Proofs},
    booktitle = {18th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-18). International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-18), 18th International Conference on Logic for Programming,  Artificial Intelligence and Reasoning, March 10-15, Merida, Venezuela},
    volume = {7180},
    pages = {92-106},
    publisher = {Springer Verlag, Berlin Heidelberg},
    author = {David Aspinall and Ewen Denney and Christoph LĂĽth},
    keywords = {proofs, query languages, theorem proving},
    url = {http://www.dfki.de/web/forschung/publikationen/renameFileForDownload?filename=lpar2012.pdf&file_id=uploads_1270}
}