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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	PeerJ. Computer science Ročník 10; s. e2169
Hlavní autoři:	Chang, Wenjing, Guo, Mengyu, Luo, Junwei
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	United States PeerJ. Ltd 08.08.2024 PeerJ Inc
Témata:	Algorithms Algorithms and Analysis of Algorithms Artificial Intelligence Boolean satisfiability problem Computational linguistics Cross-attention Data Mining and Machine Learning Deep learning Electric transformers GRU Language processing Natural language interfaces Neural Networks Random 3-SAT Software Engineering Transformer Deep learning Transformer Cross-attention GRU Boolean satisfiability problem Random 3-SAT
ISSN:	2376-5992, 2376-5992
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!