SMT with Uninterpreted Functions and Monotonicity Constraints in Systems Biology
Ond\v{r}ej Huvar, Martin Jon\'a\v{s}, Samuel Pastva

TL;DR
This paper presents an SMT-based method for modeling biological systems using uninterpreted functions with monotonicity constraints, outperforming existing tools in large-scale benchmarks.
Contribution
It introduces a lazy instantiation approach for monotonicity constraints in SMT, improving efficiency over naive and eager methods in systems biology modeling.
Findings
Lazy SMT approach outperforms naive encodings on large instances.
SMT with monotonicity constraints surpasses domain-specific tools like Bonesis and AEON.
Quantifier instantiation-based encodings are more scalable for complex functions.
Abstract
The theory of uninterpreted functions is a key modeling tool for systems with unknown or abstracted components. Some domains such as systems biology impose further restrictions regarding monotonicity on these components, requiring specific inputs to have a consistently positive or negative effect on the output. In this paper, we tackle the model inference problem for biological systems by applying the theory of uninterpreted functions with monotonicity constraints. We compare the performance of naive quantified encodings of the problem and the performance of the existing approach based on eager quantifier instantiation, which is based on the fact that a finite set of quantifier-free monotonicity lemmas is sufficient to encode the monotonicity of uninterpreted functions. Additionally, we consider a lazy variant of the approach that introduces the monotonicity lemmas on demand. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
