Journal articles on the topic 'SAT solver'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'SAT solver.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
Klyucharev, P. G. "Exploring Practicability for Solving a Task Based on the Generalized Cellular Automata via SAT Solvers." Mechanical Engineering and Computer Science, no. 11 (January 2, 2019): 11–22. http://dx.doi.org/10.24108/1118.0001439.
Full textAudemard, Gilles, and Laurent Simon. "On the Glucose SAT Solver." International Journal on Artificial Intelligence Tools 27, no. 01 (February 2018): 1840001. http://dx.doi.org/10.1142/s0218213018400018.
Full textSonobe, Tomohiro. "An Experimental Survey of Extended Resolution Effects for SAT Solvers on the Pigeonhole Principle." Algorithms 15, no. 12 (December 16, 2022): 479. http://dx.doi.org/10.3390/a15120479.
Full textČapek, Martin, and Pavel Surynek. "DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies." Proceedings of the International Symposium on Combinatorial Search 12, no. 1 (July 21, 2021): 153–55. http://dx.doi.org/10.1609/socs.v12i1.18567.
Full textVieira, Bernardo C., Fabrício V. Andrade, and Antônio O. Fernandes. "Framework for Generating Configurable SAT Solvers." Journal of Integrated Circuits and Systems 6, no. 1 (December 27, 2011): 50–59. http://dx.doi.org/10.29292/jics.v6i1.338.
Full textAl-Yahya, Tasniem, Mohamed El Bachir Menai, and Hassan Mathkour. "Boosting the Performance of CDCL-Based SAT Solvers by Exploiting Backbones and Backdoors." Algorithms 15, no. 9 (August 26, 2022): 302. http://dx.doi.org/10.3390/a15090302.
Full textMueller, Matthias. "Polynomial Exact-3-SAT-Solving Algorithm." International Journal of Engineering & Technology 9, no. 3 (August 4, 2020): 670. http://dx.doi.org/10.14419/ijet.v9i3.30749.
Full textAono, Masashi, Song-Ju Kim, Liping Zhu, Makoto Naruse, Motoichi Ohtsu, Hirokazu Hori, and Masahiko Hara. "Amoeba-inspired SAT Solver." IEICE Proceeding Series 1 (March 17, 2014): 586–89. http://dx.doi.org/10.15248/proc.1.586.
Full textSurynek, Pavel, Roni Stern, Eli Boyarski, and Ariel Felner. "Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach." Journal of Artificial Intelligence Research 73 (February 10, 2022): 553–618. http://dx.doi.org/10.1613/jair.1.13318.
Full textJärvisalo, Matti, Daniel Le Berre, Olivier Roussel, and Laurent Simon. "The International SAT Solver Competitions." AI Magazine 33, no. 1 (March 15, 2012): 89–92. http://dx.doi.org/10.1609/aimag.v33i1.2395.
Full textHamadi, Youssef, Said Jabbour, and Lakhdar Sais. "ManySAT: a Parallel SAT Solver." Journal on Satisfiability, Boolean Modeling and Computation 6, no. 4 (June 1, 2009): 245–62. http://dx.doi.org/10.3233/sat190070.
Full textVan Gelder, Allen. "Contrasat – A Contrarian SAT Solver." Journal on Satisfiability, Boolean Modeling and Computation 8, no. 3-4 (March 1, 2012): 117–22. http://dx.doi.org/10.3233/sat190093.
Full textКондратьев, В. С., А. А. Семенов, and О. С. Заикин. "Duplicates of conflict clauses in CDCL derivation and their usage to invert some cryptographic functions." Numerical Methods and Programming (Vychislitel'nye Metody i Programmirovanie), no. 1 (January 20, 2019): 54–66. http://dx.doi.org/10.26089/nummet.v20r106.
Full textStuckey, Peter J., Thibaut Feydy, Andreas Schutt, Guido Tack, and Julien Fischer. "The MiniZinc Challenge 2008–2013." AI Magazine 35, no. 2 (June 19, 2014): 55–60. http://dx.doi.org/10.1609/aimag.v35i2.2539.
Full textSurynek, Pavel, Ariel Felner, Roni Stern, and Eli Boyarski. "Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem." Proceedings of the International Symposium on Combinatorial Search 9, no. 1 (September 1, 2021): 99–105. http://dx.doi.org/10.1609/socs.v9i1.18456.
Full textXu, L., F. Hutter, H. H. Hoos, and K. Leyton-Brown. "SATzilla: Portfolio-based Algorithm Selection for SAT." Journal of Artificial Intelligence Research 32 (July 1, 2008): 565–606. http://dx.doi.org/10.1613/jair.2490.
Full textAudemard, Gilles, George Katsirelos, and Laurent Simon. "A Restriction of Extended Resolution for Clause Learning SAT Solvers." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 3, 2010): 15–20. http://dx.doi.org/10.1609/aaai.v24i1.7553.
Full textHeras, F., J. Larrosa, and A. Oliveras. "MiniMaxSAT: An Efficient Weighted Max-SAT solver." Journal of Artificial Intelligence Research 31 (January 17, 2008): 1–32. http://dx.doi.org/10.1613/jair.2347.
Full textAnsotegui, Carlos, Maria Luisa Bonet, and Jordi Levy. "A New Algorithm for Weighted Partial MaxSAT." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 3, 2010): 3–8. http://dx.doi.org/10.1609/aaai.v24i1.7545.
Full textDantsin, Evgeny, and Alexander Wolpert. "An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF." Journal on Satisfiability, Boolean Modeling and Computation 14, no. 1 (January 4, 2023): 1–15. http://dx.doi.org/10.3233/sat-220006.
Full textKoshimura, Miyuki, Tong Zhang, Hiroshi Fujita, and Ryuzo Hasegawa. "QMaxSAT: A Partial Max-SAT Solver." Journal on Satisfiability, Boolean Modeling and Computation 8, no. 1-2 (January 1, 2012): 95–100. http://dx.doi.org/10.3233/sat190091.
Full textSkliarova, I., and A. B. Ferrari. "A software/reconfigurable hardware SAT solver." IEEE Transactions on Very Large Scale Integration (VLSI) Systems 12, no. 4 (April 2004): 408–19. http://dx.doi.org/10.1109/tvlsi.2004.825859.
Full text(Moti) Ben-Ari, Mordechai. "LearnSAT: A SAT Solver for Education." Journal of Open Source Software 3, no. 24 (April 26, 2018): 639. http://dx.doi.org/10.21105/joss.00639.
Full textSiddiqi, Sajjad. "An extensible circuit-based SAT solver." Journal of Experimental & Theoretical Artificial Intelligence 32, no. 5 (October 3, 2019): 751–68. http://dx.doi.org/10.1080/0952813x.2019.1672798.
Full textHutter, Frank, Marius Lindauer, Adrian Balint, Sam Bayless, Holger Hoos, and Kevin Leyton-Brown. "The Configurable SAT Solver Challenge (CSSC)." Artificial Intelligence 243 (February 2017): 1–25. http://dx.doi.org/10.1016/j.artint.2016.09.006.
Full textAnsótegui, Carlos, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy, and Laurent Simon. "Community Structure in Industrial SAT Instances." Journal of Artificial Intelligence Research 66 (October 10, 2019): 443–72. http://dx.doi.org/10.1613/jair.1.11741.
Full textAndrici, Cezar-Constantin, and Ștefan Ciobâcă. "A Verified Implementation of the DPLL Algorithm in Dafny." Mathematics 10, no. 13 (June 28, 2022): 2264. http://dx.doi.org/10.3390/math10132264.
Full textL. Kaizer, Wesley, André G. Pereira, and Marcus Ritt. "Sequencing Operator Counts with State-Space Search." Proceedings of the International Conference on Automated Planning and Scheduling 30 (June 1, 2020): 166–74. http://dx.doi.org/10.1609/icaps.v30i1.6658.
Full textGange, G., P. J. Stuckey, and V. Lagoon. "Fast Set Bounds Propagation Using a BDD-SAT Hybrid." Journal of Artificial Intelligence Research 38 (June 25, 2010): 307–38. http://dx.doi.org/10.1613/jair.3014.
Full textFichte, Johannes K., Markus Hecher, Michael Morak, and Stefan Woltran. "DynASP2.5: Dynamic Programming on Tree Decompositions in Action." Algorithms 14, no. 3 (March 2, 2021): 81. http://dx.doi.org/10.3390/a14030081.
Full textLi, C. M., F. Manya, and J. Planes. "New Inference Rules for Max-SAT." Journal of Artificial Intelligence Research 30 (October 23, 2007): 321–59. http://dx.doi.org/10.1613/jair.2215.
Full textVaezipoor, Pashootan, Gil Lederman, Yuhuai Wu, Chris Maddison, Roger B. Grosse, Sanjit A. Seshia, and Fahiem Bacchus. "Learning Branching Heuristics for Propositional Model Counting." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 14 (May 18, 2021): 12427–35. http://dx.doi.org/10.1609/aaai.v35i14.17474.
Full textSheini, Hossein M., and Karem A. Sakallah. "Pueblo: A Hybrid Pseudo-Boolean SAT Solver." Journal on Satisfiability, Boolean Modeling and Computation 2, no. 1-4 (March 1, 2006): 165–89. http://dx.doi.org/10.3233/sat190020.
Full textDING, Min. "Integrating advanced reasoning into a SAT solver." Science in China Series F 48, no. 3 (2005): 366. http://dx.doi.org/10.1360/04yf0171.
Full textTakeuchi, Naoki, Masashi Aono, Yuko Hara-Azumi, and Christopher L. Ayala. "A Circuit-Level Amoeba-Inspired SAT Solver." IEEE Transactions on Circuits and Systems II: Express Briefs 67, no. 10 (October 2020): 2139–43. http://dx.doi.org/10.1109/tcsii.2019.2951181.
Full textGoldberg, Eugene, and Yakov Novikov. "BerkMin: A fast and robust Sat-solver." Discrete Applied Mathematics 155, no. 12 (June 2007): 1549–61. http://dx.doi.org/10.1016/j.dam.2006.10.007.
Full textMoon, Seongsoo, and Mary Inaba. "Boost SAT Solver with Hybrid Branching Heuristic." Proceedings of the International Symposium on Combinatorial Search 8, no. 1 (September 1, 2021): 56–63. http://dx.doi.org/10.1609/socs.v8i1.18422.
Full textAlsinet, Teresa, Felip Manyà, and Jordi Planes. "An efficient solver for weighted Max-SAT." Journal of Global Optimization 41, no. 1 (June 29, 2007): 61–73. http://dx.doi.org/10.1007/s10898-007-9166-9.
Full textZhang, Zaijun, Daoyun Xu, and Jincheng Zhou. "A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form." Entropy 23, no. 3 (March 4, 2021): 303. http://dx.doi.org/10.3390/e23030303.
Full textSoos, Mate, and Kuldeep S. Meel. "BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 1592–99. http://dx.doi.org/10.1609/aaai.v33i01.33011592.
Full textNadel, Alexander. "Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT." Journal on Satisfiability, Boolean Modeling and Computation 12, no. 1 (September 11, 2020): 17–22. http://dx.doi.org/10.3233/sat-200126.
Full textHeule, Marijn, Matti Järvisalo, Florian Lonsing, Martina Seidl, and Armin Biere. "Clause Elimination for SAT and QSAT." Journal of Artificial Intelligence Research 53 (June 26, 2015): 127–68. http://dx.doi.org/10.1613/jair.4694.
Full textKullmann, Oliver. "The SAT 2005 Solver Competition on Random Instances." Journal on Satisfiability, Boolean Modeling and Computation 2, no. 1-4 (March 1, 2006): 61–102. http://dx.doi.org/10.3233/sat190017.
Full textSpence, Ivor. "tts: A SAT-Solver for Small, Difficult Instances." Journal on Satisfiability, Boolean Modeling and Computation 4, no. 2-4 (June 1, 2008): 173–90. http://dx.doi.org/10.3233/sat190043.
Full textPark, Sa-Choun, and Gi-Hwon Kwon. "Extracting Subsequence of Boolean Variables using SAT-solver." KIPS Transactions:PartD 15D, no. 6 (December 31, 2008): 777–84. http://dx.doi.org/10.3745/kipstd.2008.15-d.6.777.
Full textInui, Nobuo, and Akiko Aizawa. "Generation of Minimum-Consistent DFA Using SAT Solver." Transactions of the Japanese Society for Artificial Intelligence 27, no. 3 (2012): 151–62. http://dx.doi.org/10.1527/tjsai.27.151.
Full textHorbach, Andrei, Thomas Bartsch, and Dirk Briskorn. "Using a SAT-solver to schedule sports leagues." Journal of Scheduling 15, no. 1 (September 16, 2010): 117–25. http://dx.doi.org/10.1007/s10951-010-0194-9.
Full textUlyantsev, Vladimir I., and Fedor N. Tsarev. "Extended Finite-State Machine Induction using SAT-Solver." IFAC Proceedings Volumes 45, no. 6 (May 2012): 236–41. http://dx.doi.org/10.3182/20120523-3-ro-2023.00179.
Full textBöhm, Max, and Ewald Speckenmeyer. "A fast parallel SAT-solver — efficient workload balancing." Annals of Mathematics and Artificial Intelligence 17, no. 2 (September 1996): 381–400. http://dx.doi.org/10.1007/bf02127976.
Full textDUCK, GREGORY J. "SMCHR: Satisfiability modulo constraint handling rules." Theory and Practice of Logic Programming 12, no. 4-5 (July 2012): 601–18. http://dx.doi.org/10.1017/s1471068412000208.
Full text