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...
সংরক্ষণ করুন:
| প্রধান লেখক: | , , |
|---|---|
| বিন্যাস: | Artigo |
| ভাষা: | Inglês |
| প্রকাশিত: |
PeerJ Inc.
2024-08-01
|
| মালা: | PeerJ Computer Science |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | https://peerj.com/articles/cs-2169.pdf |
| ট্যাগগুলো: |
কোনো ট্যাগ নেই, প্রথমজন হিসাবে ট্যাগ করুন!
|