Imagen de Portada

Compact SAT Encoding for Power Peak Minimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Van Kieu, Tuyen, Nguyen, Phong Chi, Hoang, Bao Gia, Van To, Khanh
Formato:	Preprint
Publicado:	2025
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Solving the Two-dimensional single stock size Cutting Stock Problem with SAT and MaxSAT
por: Van Kieu, Tuyen, et al.
Publicado: (2026)

SAT Encodings for Bandwidth Coloring: A Systematic Design Study
por: Nguyen, Duc Trung Kim, et al.
Publicado: (2026)

Computing Short SAT Implicants via Ising/QUBO Encodings
por: Spallitta, Giuseppe, et al.
Publicado: (2026)

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation
por: Van Caudenberg, Daimy, et al.
Publicado: (2025)

RustSAT: A Library For SAT Solving in Rust
por: Jabs, Christoph
Publicado: (2025)

Encoding Peano Arithmetic in a Minimal Fragment of Separation Logic
por: Ito, Sohei, et al.
Publicado: (2025)

Efficient SAT and MaxSAT techniques for solving the Two-Dimensional Strip Packing Problem
por: Kieu, Tuyen Van, et al.
Publicado: (2025)

Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks
por: Kabir, Mohimenul, et al.
Publicado: (2025)

Logic Optimization Meets SAT: A Novel Framework for Circuit-SAT Solving
por: Shi, Zhengyuan, et al.
Publicado: (2024)

SAT-Based Subsumption Resolution
por: Coutelier, Robin, et al.
Publicado: (2024)

Life span of SAT techniques
por: Fleury, Mathias, et al.
Publicado: (2024)

Structural Origin and the Minimal Syntax of NP-Hardness: Analysis of SAT from Syntactic Generativity and Compositional Collapse
por: Nishiyama, Yumiko
Publicado: (2025)

SAT-Inspired Higher-Order Eliminations
por: Blanchette, Jasmin, et al.
Publicado: (2022)

Between proof construction and SAT-solving
por: Schubert, Aleksy, et al.
Publicado: (2024)

Rethinking Clause Management for CDCL SAT Solvers
por: Cai, Yalun, et al.
Publicado: (2026)

Empirical Impact of Dimensionality on Random Geometric SAT
por: Rädiker, Flora
Publicado: (2026)

SAT Solving for Variants of First-Order Subsumption
por: Coutelier, Robin, et al.
Publicado: (2024)

SAT-based Learning of Computation Tree Logic
por: Pommellet, Adrien, et al.
Publicado: (2024)

A Naive Encoding of Russell's Paradox in Type Theory
por: Qu, Zhuoyuan
Publicado: (2025)

SAT-Based Techniques for Lexicographically Smallest Finite Models
por: Janota, Mikoláš, et al.
Publicado: (2025)

parSAT: Parallel Solving of Floating-Point Satisfiability
por: Krahl, Markus, et al.
Publicado: (2025)

Structure-Aware Computing, Partial Quantifier Elimination And SAT
por: Goldberg, Eugene
Publicado: (2024)

DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories
por: Feng, Nick, et al.
Publicado: (2024)

Approaching the Conway-99 problem using SAT solvers
por: Keramatipour, Ali
Publicado: (2026)

Certified Branch-and-Bound MaxSAT Solving (Extended Version)
por: Vandesande, Dieter, et al.
Publicado: (2025)

Solving SAT By Computing A Stable Set Of Points In Clusters
por: Goldberg, Eugene
Publicado: (2025)

Disjoint Projected Enumeration for SAT and SMT without Blocking Clauses
por: Spallitta, Giuseppe, et al.
Publicado: (2024)

Efficient Incremental #SAT via Cross-Instance Knowledge Reuse
por: Bartal, Uriya, et al.
Publicado: (2026)

Orbitopal Fixing in SAT
por: Anders, Markus, et al.
Publicado: (2026)

Orthologic for SAT Solving
por: de Haldat, Vladislas, et al.
Publicado: (2026)

PolySAT: Word-level Bit-vector Reasoning in Z3
por: Rath, Jakob, et al.
Publicado: (2024)

A SAT-centered XAI method for Deep Learning based Video Understanding
por: Key, Hojer
Publicado: (2025)

Impredicative Encodings of (Higher) Inductive Types
por: Awodey, Steve, et al.
Publicado: (2018)

SAT Encoding of Partial Ordering Models for Graph Coloring Problems
por: Faber, Daniel, et al.
Publicado: (2024)

SAT-Solving the Poset Cover Problem
por: Yuan, Chih-Cheng Rex, et al.
Publicado: (2025)

Queen Domination by SAT Solving
por: Rostami, Taha, et al.
Publicado: (2025)

Boolean Variation and Boolean Logic BackPropagation
por: Nguyen, Van Minh
Publicado: (2023)

Generalizing Unit Commitment Problem Solving via SAT-based Decoupling
por: Zhao, Yuxin, et al.
Publicado: (2026)

When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames
por: Krebs, Andreas, et al.
Publicado: (2025)

Nominal Type Theory by Nullary Internal Parametricity
por: Van Muylder, Antoine, et al.
Publicado: (2025)