Predicting the satisfiability of Boolean formulas by incorporating gated recurrent unit (GRU) in the Transformer framework
Sign Up to like & getrecommendations! Published in 2024 at "PeerJ Computer Science"
DOI: 10.7717/peerj-cs.2169
Abstract: 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… read more here.
Keywords: gated recurrent; predicting satisfiability; problem; gru transformer ... See more keywords