Downloads · 30 days
0
zeweizhang/ImitSAT
ImitSAT is a other model from zeweizhang. Use it for the other task on the model card, and read the license before you ship it in a product. The card lists the license as apache-2.0.
<p align="center" <h1 align="center"<emImitSAT</em: Boolean Satisfiability via Imitation Learning</h1 <div align="center" <strongZewei Zhang</strong <strongHuan Liu</strong <strongYuanhao Yu<…
Downloads · 30 days
0
Access
Public
Updated Feb 26, 2026
Repo size
668 MB
Likes
0
Public
Click a slice to open those files.
.npz668 MB · 100%
From the Hugging Face model README
ImitSAT is a branching policy for conflict-driven clause learning (CDCL) solvers based on imitation learning for the Boolean satisfiability problem (SAT). Unlike previous methods that predict instance-level signals, ImitSAT learns from expert KeyTrace—a sequence of surviving decisions from a full solver run. This prefix-conditioned supervision enables ImitSAT to reproduce high-quality branches, reducing propagations and wall-clock time.
git lfs install
git clone https://huggingface.co/zeweizhang/ImitSAT
ImitSAT.npz — trained checkpoint (NumPy/JAX arrays).
tokenizer/
vocab.txt
tokenizer_config.json
special_tokens_map.json
@inproceedings{zhang2026boolean,
title={Boolean Satisfiability via Imitation Learning},
author={Zewei Zhang and Huan Liu and YUANHAO YU and Jun Chen and Xiangyu Xu},
booktitle={The Fourteenth International Conference on Learning Representations},
year={2026},
url={https://openreview.net/forum?id=LNqWbY5iIf}
}