Entailment vs. Verification for Partial-assignment Satisfiability and Enumeration

2025-03-03

AI Summary

The foundational concept of “partial assignment satisfying a formula” lacks a unified formal definition in SAT enumeration, leading to ambiguity in reasoning. Method: This paper systematically distinguishes and formalizes two distinct semantics—verification (requiring the formula to evaluate to true under *all* total extensions of the partial assignment) and entailment (requiring *all satisfying* total extensions to satisfy the formula). It analyzes their semantic divergence and complementarity across CNF, non-CNF, and existentially quantified formulas. Contribution/Results: The paper proves that entailment semantics offers superior pruning power, guarantees completeness, and ensures theoretical consistency. Leveraging this insight, it reconstructs partial-assignment inference mechanisms around entailment semantics, yielding significant improvements in both efficiency and reliability of all-solutions enumeration algorithms. This work establishes a new theoretical foundation and practical paradigm for SAT model enumeration.

Technology Category

• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Knowledge Representation and Reasoning: Preferences
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty

Application Category

• Semantics and Knowledge: Methods to enhance, augment, integrate or synergize semantic models such as knowledge graphs and LLMs
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Search and Retrieval-Augmented AI: Web evaluation methodologies and metrics

Abstract

Many procedures for SAT-related problems, in particular for those requiring the complete enumeration of satisfying truth assignments, rely their efficiency and effectiveness on the detection of (possibly small) partial assignments satisfying an input formula. Surprisingly, there seems to be no unique universally-agreed definition of formula satisfaction by a partial assignment in the literature. In this paper we analyze in deep the issue of satisfaction by partial assignments, raising a flag about some ambiguities and subtleties of this concept, and investigating their practical consequences. We identify two alternative notions that are implicitly used in the literature, namely verification and entailment, which coincide if applied to CNF formulas but differ and present complementary properties if applied to non-CNF or to existentially-quantified formulas. We show that, although the former is easier to check and as such is implicitly used by most current search procedures, the latter has better theoretical properties, and can improve the efficiency and effectiveness of enumeration procedures.

Problem

• Analyzes partial assignment satisfaction in SAT problems.
• Identifies ambiguities in partial assignment definitions.
• Compares verification and entailment for formula satisfaction.

Innovation

• Analyzes partial assignment satisfaction ambiguities
• Compares verification and entailment concepts
• Proposes entailment for better enumeration efficiency