Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5

Huang, Pei; Li, Rundong; Liu, Minghao; Ma, Feifei; Zhang, Jian

doi:10.1007/978-3-030-80223-3_16

Cited by 2 publications

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(1) Unfavorable speed-quality trade-off: Many constrained scheduling problems can be solved exactly using integer linear programming (ILP) (Hwang et al, 1991;Floudas & Lin, 2005;Steiner et al, 2022;Yin et al, 2022), satisfiability (SAT) (Steiner, 2010;Zhang et al, 2004;Coelho & Vanhoucke, 2011), or constraint programming (CP) formulations (Christofides et al, 1987;Laborie et al, 2018;Baptiste et al, 2001;Cesta et al, 2002). However, these approaches suffer from limited scalability.…”

Section: Introductionmentioning

confidence: 99%

Weight-Dependent Gates for Differentiable Neural Network Pruning

Liu

et al. 2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This paper addresses the complex issue of resource-constrained scheduling, an NP-hard problem that spans critical areas including chip design and high-performance computing. Traditional scheduling methods often stumble over scalability and applicability challenges. We propose a novel approach using a differentiable combinatorial scheduling framework, utilizing Gumbel-Softmax differentiable sampling technique. This new technical allows for a fully differentiable formulation of linear programming (LP) based scheduling, extending its application to a broader range of LP formulations. To encode inequality constraints for scheduling tasks, we introduce constrained Gumbel Trick, which adeptly encodes arbitrary inequality constraints. Consequently, our method facilitates an efficient and scalable scheduling via gradient descent without the need for training data. Comparative evaluations on both synthetic and real-world benchmarks highlight our capability to significantly improve the optimization efficiency of scheduling, surpassing state-of-the-art solutions offered by commercial and open-source solvers such as CPLEX, Gurobi, and CP-SAT in the majority of the designs.

show abstract