Monotonicity Inference for Higher-Order Formulas
- 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
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.
Unable to display preview. Download preview PDF.