Entailing generalization boosts enumeration

DOI10.4230/LIPICS.SAT.2024.13MaRDI QIDQ6864431zbMATH OpenFDO

Authors Dror Fried, Alexander Nadel, Roberto Sebastiani, Yogev Shalmon

Publication date 3 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SAT.2024.13

zbMATH Keywords

AllSATcircuitsgeneralizationminimizationprime implicantSAT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• A New Algorithm for Generating Prime Implicants
• AllSAT for combinational circuits
• An incremental method for generating prime implicants/implicates
• Efficient SAT solving under assumptions
• Four flavors of entailment
• scientific article; zbMATH DE number 3904558 (Why is no real title available?)
• Implementing efficient All solutions SAT solvers
• Introducing Intel\(\circledR\) SAT solver
• Introduction to a general theory of elementary propositions.
• On CNF conversion for disjoint SAT enumeration
• Polarity and variable selection heuristics for SAT-based anytime MaxSAT
• SAT-Based Model Checking without Unrolling
• The \textsc{MergeSat} solver
• The Problem of Simplifying Truth Functions
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(3)

• Exploiting partial-assignment enumeration in optimization modulo theories
• Entailment vs. verification for partial-assignment satisfiability and enumeration
• On CNF conversion for SAT and SMT enumeration

This page was built for publication: Entailing generalization boosts enumeration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864431)