Academic literature on the topic 'SAT'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'SAT.'
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.
Journal articles on the topic "SAT"
Nieuwenhuis, Robert, Albert Oliveras, and Cesare Tinelli. "Solving SAT and SAT Modulo Theories." Journal of the ACM 53, no. 6 (November 2006): 937–77. http://dx.doi.org/10.1145/1217856.1217859.
Full textDal Palù, Alessandro, Agostino Dovier, Andrea Formisano, and Enrico Pontelli. "CUD@SAT: SAT solving on GPUs." Journal of Experimental & Theoretical Artificial Intelligence 27, no. 3 (September 5, 2014): 293–316. http://dx.doi.org/10.1080/0952813x.2014.954274.
Full textGanian, Robert, and Stefan Szeider. "New width parameters for SAT and #SAT." Artificial Intelligence 295 (June 2021): 103460. http://dx.doi.org/10.1016/j.artint.2021.103460.
Full textMagaji, Buhari, Nasiru Yahaya Pindiga, and Ibrahim Mohammed Bida. "Synthesis of TiO\(_2\) Impregnated Ribes nigrum Stem Nanoactivated Carbon and their Application to Remove Heavy Metals." Asian Journal of Chemical Sciences 14, no. 2 (March 26, 2024): 149–60. http://dx.doi.org/10.9734/ajocs/2024/v14i2300.
Full textSugawa, Oka, and I. Putu Suhada Agung. "Strategi Manajemen Acara Festival Sinema Akhir Tahun (SAT) Sebagai Jalur Ekshibisi Film Tahun 2019 - 2021." CandraRupa : Journal of Art, Design, and Media 3, no. 1 (March 7, 2024): 10–21. http://dx.doi.org/10.37802/candrarupa.v3i1.580.
Full textGregg, Kevin R. "Japan's SAT?" Science 260, no. 5106 (April 16, 1993): 277. http://dx.doi.org/10.1126/science.260.5106.277.a.
Full textMcLeod, Norman. "Japan's SAT?" Science 260, no. 5106 (April 16, 1993): 277. http://dx.doi.org/10.1126/science.260.5106.277.b.
Full textCarroll, John J. "Japan's SAT?" Science 260, no. 5106 (April 16, 1993): 277. http://dx.doi.org/10.1126/science.260.5106.277.c.
Full textCarroll, John J. "Japan's SAT?" Science 260, no. 5106 (April 16, 1993): 277. http://dx.doi.org/10.1126/science.260.5106.277-c.
Full textObradović, Nadežda, and Vida Ognjenović. "Stari sat." World Literature Today 72, no. 1 (1998): 170. http://dx.doi.org/10.2307/40153662.
Full textDissertations / Theses on the topic "SAT"
AXELSSON, LUDVIG, and TIM LINDEBERG. "SAT doku Att lösa Sudoku med moderna SAT-lösare." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-157550.
Full textSudoku is a popular puzzle game that originates from Japan. The Sudokuproblem has been shown to be NP-complete and therefore thereprobably does not exist an effecient way of solving large puzzles. In recentyears there has been a lot of research into solving the SAT problem.This report examined various SAT solvers from “The International SATCompetition” to investigate whether there exists a correlation betweenthe execution time and the difficulty level of puzzles and to determinewhich of these are most effective for solving puzzles of varying difficultyand size. To examine the above a large number of puzzles were generatedand two tests were performed. One test measured the executiontime of various SAT solvers when solving puzzles of varying difficulty.The second test measured the time that the SAT solvers took to solvepuzzles of different sizes. The tested SAT solvers are Glucose, Lingling,Minisat, Plingeling, Treengeling and Zenn.The results show a correlation between the execution time of theSAT solvers and the difficulty of the puzzles when looking at the averagetime of the solvers. A linear regression test gave a coefficent ofdetermination of approximately 0.8. Some solvers had a significant correlationand other solvers showed almost no correlation at all. Thecorrelation could also be attributed to the difference in the number ofclues between the puzzles. This however does not explain the disparitybetween puzzles of varying difficulty with the same number of clues.The average time for all solvers were approximately 20 ms for puzzlesof order three and about 50 s for puzzles of order nine. Of the testedSAT solvers, Minisat was the fastest at solving both the puzzles of orderthree and puzzles of higher order.
Szczepanski, Nicolas. "SAT en Parallèle." Thesis, Artois, 2017. http://www.theses.fr/2017ARTO0403/document.
Full textThis thesis deals with propositional satisfiability (SAT) in a massively parallel setting. The SAT problem is widely used for solving several combinatorial problems (e.g. formal verification of hardware and software, bioinformatics, cryptography, planning, scheduling, etc.). The first contribution of this thesis concerns the design of efficient algorithms based on the approaches « portfolio » and « divide and conquer ». Secondly, an adaptation of several parallel programming models including hybrid (parallel and distributed computing) to SAT is proposed. This work has led to several contributions to international conferences and highly competitive distributed SAT solvers
Lardeux, Frédéric. "Approches hybrides pour les problèmes de satisfiabilité (SAT et MAX-SAT)." Angers, 2005. http://www.theses.fr/2005ANGE0024.
Full textThis thesis deals with the resolution of the satisfiability problems SAT and MAX-SAT. Our contributions are in three types. First, we have developed the memetic algorithm GASAT for the SAT and MAX-SAT problems which hybridies a tabu algorithm and a genetic algorithm. Some specific tools for the satisfiability problems have been included in it such as intensification mechanisms, diversification mechanisms and a new crossover operator. Next, we have proposed a new resolution framework which permits the exact and the approached methods to handle the same representation of the search space. To do this, we have added a third truth value ``undetermined''. The results obtained by the tri-valued hybrid algorithms show the utility of this resolution framework. Finally, we are interested in the branching heuristics for the Branch and Bound algorithms in the MAX-SAT context. Our study shows that these heuristics react in different ways in function of the initial parameters, the structure of the studied instances and the improved mechanisms for Branch and Bound. The findings of this study may lead to the creation of new heuristics specifically dedicated to the MAX-SAT problem
André, Pascal. "Aspects probabilistes du probleme de la satisfaction d'une formule booleenne, etude des problemes sat, number-sat et max-sat." Paris 6, 1993. http://www.theses.fr/1993PA066681.
Full textDarras, Sylvain. "Traitements locaux dans les arbres de recherche pour SAT et max-SAT." Amiens, 2008. http://www.theses.fr/2008AMIE0120.
Full textThe difficulty of combinatorial problem resolution is mainly due to the exponential size of their search-space. The SAT and Max-SAT problems belong to this category. This thesis aims to increase resolution abilities of complete SAT and Max-SAT solvers, thanks to a better exploitation of information revealed all along the search-tree. About SAT, we propose a new study of the implication graph that allows to highlight possible subsumptions of existing clauses. The objective is to decrease the size of clauses belonging to the formula, in order to get them more expressive and efficient. Therefore, we develop a light computation of the implication graph, guided by the clause to subsume, finding a subsumption of this clause if there exists one. Our research on Max-SAT have focused on a better computation of the lower bound in Branch-and-Bound algorithms. Considering a solver whose lower bound estimation (or at least a part of it) relies on an inconsistent clause-set research, our approach aims to avoid repeated computation of equivalent inconsistent cores. Thanks to a storage of some of these inconsistent clause-sets from a node to its child-nodes, it is possible to reuse directly these elements without any new computation. Moreover, these cores increase the lower bound quality by keeping the efficient inconsistent sets
Bayless, Sam. "SAT modulo monotonic theories." Thesis, University of British Columbia, 2017. http://hdl.handle.net/2429/61062.
Full textScience, Faculty of
Computer Science, Department of
Graduate
Suteu, Silviu Cezar. "OPS-SAT Software Simulator." Thesis, Luleå tekniska universitet, Institutionen för system- och rymdteknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-59903.
Full textBierlee, Hendrik. "The MiniZinc-SAT Compiler." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-438608.
Full textONO, Takao, and Tomio HIRATA. "Approximation Algorithms for MAX SAT." Institute of Electronics, Information and Communication Engineers, 2000. http://hdl.handle.net/2237/15068.
Full textNguyen, Van-Hau. "SAT Encodings of Finite CSPs." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-162186.
Full textBooks on the topic "SAT"
Lazare, D. De. Sat. Čačak: Pčelica, 2018.
Find full textSukhonthā, Suwannī. Rư̄ang san chut sūan sat. [Bangkok]: Samnakphim Dūangtā, 1985.
Find full textShāhid, Humāyūn̲ Parvez. Sat zamīnān̲, sat asmān: Panjābī g̲h̲azlān̲. Lāhaur: Pākistān Panjābī Adabī Parhiyā, 1989.
Find full textGiunchiglia, Enrico, and Toby Walsh, eds. SAT 2005. Dordrecht: Springer Netherlands, 2006. http://dx.doi.org/10.1007/978-1-4020-5571-3.
Full textIlić, Dunja. Sat: Roman. Beograd: Draganić, 2010.
Find full textGretchen, VanEsselstyn, and Kaplan Inc, eds. SAT 1600. New York: Simon & Schuster, 2003.
Find full textWestwood, Dean. Organic SAT. Bellevue, Wash: Clerestory Books, 2010.
Find full textK, Wolf Ira, ed. Barron's SAT. 2nd ed. Hauppauge, N.Y: Barron's Educational Series, 2010.
Find full textInc, Kaplan, ed. SAT II. 2nd ed. New York, NY: Simon & Schuster, 2004.
Find full textKarl, Lee, and Kaplan Inc, eds. SAT II. 2nd ed. New York, NY: Simon & Schuster, 2003.
Find full textBook chapters on the topic "SAT"
Hari Govind, V. K., Isabel Garcia-Contreras, Sharon Shoham, and Arie Gurfinkel. "Speculative SAT Modulo SAT." In Tools and Algorithms for the Construction and Analysis of Systems, 43–60. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57246-3_4.
Full textPatanella, Daniel. "SAT." In Encyclopedia of Child Behavior and Development, 1290–91. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-79061-9_2499.
Full textDwivedi, Amitabh Vikram. "Sat." In Hinduism and Tribal Religions, 1–2. Dordrecht: Springer Netherlands, 2018. http://dx.doi.org/10.1007/978-94-024-1036-5_638-1.
Full textFischer, R. X., and W. H. Baur. "SAT." In Zeolite-Type Crystal Structures and their Chemistry. Framework Type Codes RON to STI, 133–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-70884-1_12.
Full textBovaird, James A., and Dylan Schenk. "SAT." In Encyclopedia of Cross-Cultural School Psychology, 830–32. Boston, MA: Springer US, 2010. http://dx.doi.org/10.1007/978-0-387-71799-9_364.
Full textDwivedi, Amitabh Vikram. "Sat." In Hinduism and Tribal Religions, 1434–35. Dordrecht: Springer Netherlands, 2022. http://dx.doi.org/10.1007/978-94-024-1188-1_638.
Full textKono, Mari, and Shuichi Tsuji. "ST8Sia-V (SAT-V/SAT-III)." In Handbook of Glycosyltransferases and Related Genes, 347–51. Tokyo: Springer Japan, 2002. http://dx.doi.org/10.1007/978-4-431-67877-9_49.
Full textSzeider, Stefan. "Parameterized SAT." In Encyclopedia of Algorithms, 1530–32. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_283.
Full textSzeider, Stefan. "Parameterized SAT." In Encyclopedia of Algorithms, 639–40. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_283.
Full textPosthoff, Christian, and Bernd Steinbach. "SAT-Problems." In Logic Functions and Equations, 299–337. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-02420-8_7.
Full textConference papers on the topic "SAT"
Hong, Xiaoyan, Dijiang Huang, Mario Gerla, and Zhen Cao. "SAT." In the 3rd international workshop. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1403007.1403015.
Full textSitawarin, Chawin, Supriyo Chakraborty, and David Wagner. "SAT." In CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3474369.3486878.
Full textHassan, Rakibul, Setareh Rafatirad, Houman Homayoun, and Sai Manoj Pudukotai Dinakarrao. "SAT to SAT-hard clause translator." In the International Conference. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3349569.3351542.
Full textShen, Zhenghui, Kyudeok Oh, Martti Toivakka, and Hak Lae Lee. "Preparation of Cellulose Nanofibrils/Salt Hydrate Composite Phase Change Materials for Thermal Energy Storage." In Advances in Pulp and Paper Research. Pulp & Paper Fundamental Research Committee (FRC), Manchester, 2022. http://dx.doi.org/10.15376/frc.2022.1.157.
Full textHassan, Rakibul, Gaurav Kolhe, Setareh Rafatirad, Houman Homayoun, and Sai Manoj Pudukotai Dinakarrao. "SATConda: SAT to SAT-Hard Clause Translator." In 2020 21st International Symposium on Quality Electronic Design (ISQED). IEEE, 2020. http://dx.doi.org/10.1109/isqed48828.2020.9137052.
Full textPy, Matthieu, Mohamed Sami Cherif, and Djamal Habet. "Computing Max-SAT Refutations using SAT Oracles." In 2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2021. http://dx.doi.org/10.1109/ictai52525.2021.00066.
Full textUstaoglu, Buse, Sebastian Huhn, Daniel Große, and Rolf Drechsler. "SAT-Lancer." In GLSVLSI '18: Great Lakes Symposium on VLSI 2018. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3194554.3194643.
Full textTits, D. "Web-Sat." In IEE Colloquium on EUTELSAT - New Products and Services. IEE, 2000. http://dx.doi.org/10.1049/ic:20000170.
Full textFeng, Jianlin, Huijun Liu, and Jing Zou. "SAT-MOD." In Special interest tracks and posters of the 14th international conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1062745.1062865.
Full textXu, Hui, Rob A. Rutenbar, and Karem Sakallah. "sub-SAT." In the 2002 international symposium. New York, New York, USA: ACM Press, 2002. http://dx.doi.org/10.1145/505388.505432.
Full textReports on the topic "SAT"
Zawadzki, Erik, Andre Platzer, and Geoffrey J. Gordon. A Generalization of SAT and #SAT for Robust Policy Evaluation. Fort Belvoir, VA: Defense Technical Information Center, June 2014. http://dx.doi.org/10.21236/ada606746.
Full textReed, Helen. Three Corner Sat Constellation. Fort Belvoir, VA: Defense Technical Information Center, December 2002. http://dx.doi.org/10.21236/ada418973.
Full textClarke, Edmund, Daniel Kroening, Natasha Sharygina, and Karen Yorav. SAT-Based Predicate Abstraction of Programs. Fort Belvoir, VA: Defense Technical Information Center, September 2005. http://dx.doi.org/10.21236/ada441311.
Full textBaader, Franz, and Barbara Morawska. SAT Encoding of Unification in EL. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.177.
Full textMalik, Sharad. Augmenting SAT Solvers for Network Configuration/Planning. Fort Belvoir, VA: Defense Technical Information Center, November 2006. http://dx.doi.org/10.21236/ada459907.
Full textGoodman, Joshua, Oded Gurantz, and Jonathan Smith. Take Two! SAT Retaking and College Enrollment Gaps. Cambridge, MA: National Bureau of Economic Research, August 2018. http://dx.doi.org/10.3386/w24945.
Full textPeñaherrera-León, Ricardo, Adans Bermeo M., Marcos Agurto Adrianzen, Déborah Martínez Villarreal, Lina Salazar, and Tsuneki Hori. Mejora de la eficiencia de los sistemas de alerta temprana utilizando ciencias de comportamiento. Inter-American Development Bank, April 2024. http://dx.doi.org/10.18235/0013041.
Full textChauhan, Pankaj, Daniel Kroening, and Edmund Clarke. A SAT-Based Algorithm for Reparameterization in Symbolic Simulation. Fort Belvoir, VA: Defense Technical Information Center, December 2003. http://dx.doi.org/10.21236/ada461257.
Full textBriones, Roehlano, and Joe-Air Jiang, eds. Smart Agricultural Transformation in Asian Countries. Asian Productivity Organization, June 2023. http://dx.doi.org/10.61145/kgou7399.
Full textBaader, Franz, Stefan Borgwardt, and Barbara Morawska. SAT Encoding of Unification in ELHR+ w.r.t. Cycle-Restricted Ontologies. Technische Universität Dresden, 2012. http://dx.doi.org/10.25368/2022.186.
Full text