Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic for Programming Artificial Intelligence and Reasoning

LPAR 2012: Logic for Programming, Artificial Intelligence, and Reasoning pp 92–106Cite as

Querying Proofs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7180))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Denney, E., Power, J., Tourlas, K.: Hiproofs: A hierarchical notion of proof tree. Electr. Notes Theor. Comput. Sci. 155, 341–359 (2006)

    Article  Google Scholar 

  2. Aspinall, D., Denney, E., Lüth, C.: Tactics for hierarchical proof. Mathematics in Computer Science 3(3), 309–330 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Angles, R., Gutierrez, C.: Survey of graph database models. ACM Comput. Surv. 40 (February 2008)

    Google Scholar 

  4. Bailey, J., Bry, F., Furche, T., Schaffert, S.: Web and Semantic Web Query Languages: A Survey. In: Eisinger, N., Małuszyński, J. (eds.) Reasoning Web. LNCS, vol. 3564, pp. 35–133. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Buneman, P., Fernandez, M., Suciu, D.: UnQL: a query language and algebra for semistructured data based on structural recursion. The VLDB Journal 9(1), 76–110 (2000)

    Article  Google Scholar 

  6. Berghofer, S., Nipkow, T.: Proof Terms for Simply Typed Higher Order Logic. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol. 1869, pp. 38–52. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Harrison, J., Théry, L.: A skeptic’s approach to combining HOL and Maple. Journal of Automated Reasoning 21, 279–294 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  8. Sutcliffe, G., Schulz, S., Claessen, K., Van Gelder, A.: Using the TPTP Language for Writing Derivations and Finite Interpretations. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 67–81. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Allen, S.F., Bickford, M., Constable, R.L., Eaton, R., Kreitz, C., Lorigo, L., Moran, E.: Innovations in computational type theory using Nuprl. Journal of Applied Logic 4(4), 428–469 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Necula, G., Lee, P.: Proof Generation in the Touchstone Theorem Prover. In: McAllester, D. (ed.) CADE-17. LNCS (LNAI), vol. 1831, pp. 25–44. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Denney, E.: A Prototype Proof Translator from HOL to Coq. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol. 1869, pp. 108–125. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Pons, O., Bertot, Y., Rideau, L.: Notions of dependency in proof assistants. In: Proc. User Interfaces for Theorem Provers, UITP 1998 (1998)

    Google Scholar 

  13. Urban, J.: MizarMode - an integrated proof assistance tool for the Mizar way of formalizing mathematics. J. Applied Logic 4(4), 414–427 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Sutcliffe, G., Suttner, C.: The TPTP problem library for automated theorem proving, Homepage and online tools, http://www.tptp.org (visited November 2011)

  15. da Silva, P.P., Sutcliffe, G., Chang, C., Ding, L., Rio, N.D., McGuinness, D.L.: Presenting TSTP proofs with inference web tools. In: Konev, B., Schmidt, R.A., Schulz, S. (eds.) PAAR/ESHOL. CEUR Workshop Proceedings, vol. 373. CEUR-WS.org (2008)

    Google Scholar 

  16. da Silva, P.P., McGuinness, D., Fikes, R.: A proof markup language for semantic web services. Information Systems 31(4-5), 381–395 (2006)

    Article  Google Scholar 

  17. Cardelli, L., Gardner, P., Ghelli, G.: A Spatial Logic for Querying Graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 597–610. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  18. Crew, R.F.: ASTLOG: A language for examining abstract syntax trees. In: DSL, USENIX (1997)

    Google Scholar 

  19. Jarzabek, S.: Design of flexible static program analyzers with PQL. IEEE Trans. Software Eng. 24(3), 197–215 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LFCS, School of Informatics, University of Edinburgh, Edinburgh, EH8 9AB, Scotland

    David Aspinall

  2. SGT, NASA Ames Research Center, Moffett Field, CA, 94035, USA

    Ewen Denney

  3. Deutsches Forschungszentrum für Künstliche Intelligenz, Bremen, Germany

    Christoph Lüth

Authors
  1. David Aspinall
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ewen Denney
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christoph Lüth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research, One Microsoft Way, 98052-6399, Redmond, WA, USA

    Nikolaj Bjørner

  2. School of computer Science, University of Manchester, Kilburn Building, Oxford Road, MP13 9PL, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aspinall, D., Denney, E., Lüth, C. (2012). Querying Proofs. In: Bjørner, N., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2012. Lecture Notes in Computer Science, vol 7180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28717-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28717-6_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28716-9

  • Online ISBN: 978-3-642-28717-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation