Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Linguistics and Language,Language and Linguistics
Reference143 articles.
1. Abdulla PA, Bjesse P, Eén N (2000) Symbolic reachability analysis based on sat-solvers. In: Proceedings of the 6th international conference on tools and algorithms for construction and analysis of systems: held as part of the European joint conferences on the theory and practice of software, ETAPS 2000. Springer, London, pp 411–425
2. Abed S, Mohamed OA, Yang Z, Sammane GA (2007) Integrating SAT with multiway decision graphs for efficient model checking. In: Proceedings of IEEE ICM’07. IEEE Press, Egypt, pp 129–132
3. Ackermann W (1954) Solvable cases of the decision problem, 1st edn. North-Holland Publishing, North-Holland
4. Aloul FA, Ramani A, Markov IL, Sakallah KA (2002) Pbs: a backtrack search pseudo Boolean solver. In: Symposium on the theory and applications of satisfiability testing (SAT), pp 346–353
5. Aloul FA (2006) Search techniques for sat-based Boolean optimization, modeling, simulation and applied optimization. J Franklin Inst 343(4–5):436–447
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Novel Optimized Implementations of Lightweight Cryptographic S-Boxes via SAT Solvers;IEEE Transactions on Circuits and Systems I: Regular Papers;2024-01
2. Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers;2023 IEEE International Conference on Quantum Computing and Engineering (QCE);2023-09-17
3. Fully reusing clause deduction algorithm based on standard contradiction separation rule;Information Sciences;2023-04
4. Variability modules;Journal of Systems and Software;2023-01
5. Tseitin or not Tseitin? The Impact of CNF Transformations on Feature-Model Analyses;Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering;2022-10-10