Solving Set Constraints with Comprehensions and Bounded Quantifiers

2025-08-11

AI Summary

SMT solvers exhibit poor efficiency on quantified formulas arising from real-world applications—especially when formulas are easily encodable yet computationally expensive to solve. This paper introduces a novel quantification mechanism based on set-bounded quantifiers, where variable domains are restricted to finite sets, and integrates quantifier elimination with filtering operators from finite relational theory. Our contributions are threefold: (1) We define a decidable fragment of constraints wherein bounded quantification is realized via constrained set derivation; (2) we identify the fundamental cause of undecidability in unrestricted filtering operations; and (3) we establish a formal framework unifying quantifier-free logic with filtering operators. Experiments demonstrate that our approach significantly outperforms state-of-the-art quantification techniques on the satisfiable SLEEC benchmark, while matching the performance of the specialized solver LEGOS on unsatisfiable benchmarks.

Technology Category

• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Knowledge Representation and Reasoning: Qualitative Reasoning
• Machine Learning: Calibration & Uncertainty Quantification

Application Category

• Search and Retrieval-Augmented AI: Web evaluation methodologies and metrics
• Graph Algorithms and Modeling for the Web: Querying, indexing, and retrieval in Web-related graphs
• Economics, Online Markets and Human Computation: Data quality aspects of human-annotated datasets

Abstract

Many real applications problems can be encoded easily as quantified formulas in SMT. However, this simplicity comes at the cost of difficulty during solving by SMT solvers. Different strategies and quantifier instantiation techniques have been developed to tackle this. However, SMT solvers still struggle with quantified formulas generated by some applications. In this paper, we discuss the use of set-bounded quantifiers, quantifiers whose variable ranges over a finite set. These quantifiers can be implemented using quantifier-free fragment of the theory of finite relations with a filter operator, a form of restricted comprehension, that constructs a subset from a finite set using a predicate. We show that this approach outperforms other quantification techniques in satisfiable problems generated by the SLEEC tool, and is very competitive on unsatisfiable benchmarks compared to LEGOS, a specialized solver for SLEEC. We also identify a decidable class of constraints with restricted applications of the filter operator, while showing that unrestricted applications lead to undecidability.

Problem

• SMT solvers struggle with quantified formulas from applications
• Set-bounded quantifiers improve solving performance in satisfiable problems
• Unrestricted filter operator applications lead to undecidable constraints

Innovation

• Set-bounded quantifiers for SMT formulas
• Filter operator in finite relation theory
• Decidable class with restricted filter use