Monotonicity Inference for Higher-Order Formulas

  • Jasmin Christian Blanchette
  • Alexander Krauss
Conference paper

DOI: 10.1007/978-3-642-14203-1_8

Volume 6173 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Blanchette J.C., Krauss A. (2010) Monotonicity Inference for Higher-Order Formulas. In: Giesl J., Hähnle R. (eds) Automated Reasoning. IJCAR 2010. Lecture Notes in Computer Science, vol 6173. Springer, Berlin, Heidelberg

Abstract

Formulas are often monotonic in the sense that if the formula is satisfiable for given domains of discourse, it is also satisfiable for all larger domains. Monotonicity is undecidable in general, but we devised two calculi that infer it in many cases for higher-order logic. The stronger calculus has been implemented in Isabelle’s model finder Nitpick, where it is used to prune the search space, leading to dramatic speed improvements for formulas involving many atomic types.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jasmin Christian Blanchette
    • 1
  • Alexander Krauss
    • 1
  1. 1.Institut für InformatikTechnische Universität MünchenGermany