Predicting the satisfiability of Boolean formulas by incorporating gated recurrent unit (GRU) in the Transformer framework

The Boolean satisfiability (SAT) problem exhibits different structural features in various domains. Neural network models can be used as more generalized algorithms that can be learned to solve specific problems based on different domain data than traditional rule-based approaches. How to accurately...

Ausführliche Beschreibung