Bounding Fixed Points of Non-Monotone Processes: Theory to Practice

2026-05-07

AI Summary

Computing fixed points of non-monotonic operators—such as those arising from negation-as-failure or hypothetical updates—is notoriously challenging, as traditional monotonic methods do not apply and existing approximation techniques are either imprecise or computationally expensive. This work introduces, for the first time, controlled incompleteness into approximate fixed-point computation, integrating abstract interpretation, Approximation Fixpoint Theory (AFT), lattice theory, and partitioning-based optimization to devise a practical algorithm. The proposed method guarantees termination, polynomial-time complexity, and soundness over finite lattices while substantially improving approximation precision. Empirical evaluations demonstrate its effectiveness: deployed as an accelerating preprocessor in Answer Set Programming and applied to speculative program analysis, it significantly reduces rollback frequency, thereby validating both its efficiency and practical utility.

Abstract

Many modern solvers and program analyzers rely on non-monotone reasoning (e.g. negation-as-failure, speculative updates, backtracking) for which classical monotone fixed-point methods do not apply. The general problem of finding the fixed points of these processes is a difficult one. For this reason, there have been theoretical efforts in existing Approximation Fixpoint Theory (AFT) from the domain of logic programming to approximate fixed points of non-monotone operators. Tight approximations of these fixed points are highly useful for accelerating non-monotonic computations by restricting the search space. In practice, however, even the best approximations obtained through AFT can be coarse and computationally expensive. We aim to address both issues to make AFT approximation methods practical for use in programming languages (PL) settings. To mitigate inefficiency, we prove the soundness of an abstract interpretation for approximating operators. To improve upon coarse approximations, we carefully introduce controlled unsoundness to design an effective yet practical algorithm for partitioning and tightening AFT's best approximations. This algorithm is sound, anytime, and guarantees termination on finite-height lattices. We further present a modification that ensures polynomial-time complexity. We instantiate these methods in two settings: (1) answer set programming, where it serves as a convergence-accelerating pre-processor, and (2) speculative program analysis, where it reduces rollback while preserving soundness. In both settings, we focus on implementation-level details to demonstrate the practical applicability of our methods.

Problem

• non-monotone processes
• fixed points
• approximation
• program analysis
• answer set programming

Innovation

• Approximation Fixpoint Theory
• non-monotone reasoning
• abstract interpretation
• controlled unsoundness
• polynomial-time algorithm