مسألة قابلية الإرضاء المنطقية (Arabic Wikipedia)

Analysis of information sources in references of the Wikipedia article "مسألة قابلية الإرضاء المنطقية" in Arabic language version.

refsWebsite

Global rank Arabic rank

7doi.org

2^nd place

5^th place

4semanticscholar.org

11^th place

86^th place

4web.archive.org

1^st place

2psu.edu

207^th place

462^nd place

1berkeley.edu

580^th place

842^nd place

1archive.org

6^th place

3^rd place

1worldcat.org

5^th place

4^th place

1springer.com

274^th place

307^th place

1toronto.edu

low place

1mathnet.ru

8,783^rd place

low place

archive.org

Alfred V. Aho and John E. Hopcroft and Jeffrey D. Ullman (1974). The Design and Analysis of Computer Algorithms. Reading/MA: Addison-Wesley. ISBN:0-201-00029-6. Here: p.403

berkeley.edu

cs.berkeley.edu

Karp، Richard M. (1972). "Reducibility Among Combinatorial Problems" (PDF). في Raymond E. Miller؛ James W. Thatcher (المحررون). Complexity of Computer Computations. New York: Plenum. ص. 85–103. ISBN:0-306-30707-3. مؤرشف من الأصل (PDF) في 2011-06-29. اطلع عليه بتاريخ 2020-05-07. Here: p.86

doi.org

Ohrimenko، Olga؛ Stuckey، Peter J.؛ Codish، Michael (2007)، "Propagation = Lazy Clause Generation"، Principles and Practice of Constraint Programming – CP 2007، Lecture Notes in Computer Science، ج. 4741، ص. 544–558، CiteSeerX:10.1.1.70.5471، DOI:10.1007/978-3-540-74970-7_39، modern SAT solvers can often handle problems with millions of constraints and hundreds of thousands of variables.
Hong، Ted؛ Li، Yanjing؛ Park، Sung-Boem؛ Mui، Diana؛ Lin، David؛ Kaleq، Ziyad Abdel؛ Hakim، Nagib؛ Naeimi، Helia؛ Gardner، Donald S.؛ Mitra، Subhasish (نوفمبر 2010). "QED: Quick Error Detection tests for effective post-silicon validation". 2010 IEEE International Test Conference: 1–10. DOI:10.1109/TEST.2010.5699215. ISBN:978-1-4244-7206-2. S2CID:7909084.
Massacci, Fabio; Marraro, Laura (1 Feb 2000). "Logical Cryptanalysis as a SAT Problem". Journal of Automated Reasoning (بالإنجليزية). 24 (1): 165–203. DOI:10.1023/A:1006326723002. ISSN:1573-0670. Archived from the original on 2020-03-01.
Mironov, Ilya; Zhang, Lintao (2006). Biere, Armin; Gomes, Carla P. (eds.). "Applications of SAT Solvers to Cryptanalysis of Hash Functions". Theory and Applications of Satisfiability Testing - SAT 2006. Lecture Notes in Computer Science (بالإنجليزية). Berlin, Heidelberg: Springer. 4121: 102–115. DOI:10.1007/11814948_13. ISBN:978-3-540-37207-3. Archived from the original on 2021-03-21.
Vizel، Y.؛ Weissenbacher، G.؛ Malik، S. (2015). "Boolean Satisfiability Solvers and Their Applications in Model Checking". Proceedings of the IEEE. ج. 103 ع. 11: 2021–2035. DOI:10.1109/JPROC.2015.2455034. S2CID:10190144.
Cook، Stephen A. (1971). "The Complexity of Theorem-Proving Procedures" (PDF). Proceedings of the 3rd Annual ACM Symposium on Theory of Computing: 151–158. CiteSeerX:10.1.1.406.395. DOI:10.1145/800157.805047. S2CID:7573663. مؤرشف من الأصل (PDF) في 2021-05-07.
Levin، Leonid (1973). "Universal search problems (Russian: Универсальные задачи перебора, Universal'nye perebornye zadachi)". Problems of Information Transmission (Russian: Проблемы передачи информа́ции, Problemy Peredachi Informatsii). ج. 9 ع. 3: 115–116. (pdf) باللغة الروسية, translated into English by Trakhtenbrot، B. A. (1984). "A survey of Russian approaches to perebor (brute-force searches) algorithms". Annals of the History of Computing. ج. 6 ع. 4: 384–400. DOI:10.1109/MAHC.1984.10036. S2CID:950581.

mathnet.ru

Levin، Leonid (1973). "Universal search problems (Russian: Универсальные задачи перебора, Universal'nye perebornye zadachi)". Problems of Information Transmission (Russian: Проблемы передачи информа́ции, Problemy Peredachi Informatsii). ج. 9 ع. 3: 115–116. (pdf) باللغة الروسية, translated into English by Trakhtenbrot، B. A. (1984). "A survey of Russian approaches to perebor (brute-force searches) algorithms". Annals of the History of Computing. ج. 6 ع. 4: 384–400. DOI:10.1109/MAHC.1984.10036. S2CID:950581.

psu.edu

citeseerx.ist.psu.edu

Ohrimenko، Olga؛ Stuckey، Peter J.؛ Codish، Michael (2007)، "Propagation = Lazy Clause Generation"، Principles and Practice of Constraint Programming – CP 2007، Lecture Notes in Computer Science، ج. 4741، ص. 544–558، CiteSeerX:10.1.1.70.5471، DOI:10.1007/978-3-540-74970-7_39، modern SAT solvers can often handle problems with millions of constraints and hundreds of thousands of variables.
Cook، Stephen A. (1971). "The Complexity of Theorem-Proving Procedures" (PDF). Proceedings of the 3rd Annual ACM Symposium on Theory of Computing: 151–158. CiteSeerX:10.1.1.406.395. DOI:10.1145/800157.805047. S2CID:7573663. مؤرشف من الأصل (PDF) في 2021-05-07.

semanticscholar.org

api.semanticscholar.org

Hong، Ted؛ Li، Yanjing؛ Park، Sung-Boem؛ Mui، Diana؛ Lin، David؛ Kaleq، Ziyad Abdel؛ Hakim، Nagib؛ Naeimi، Helia؛ Gardner، Donald S.؛ Mitra، Subhasish (نوفمبر 2010). "QED: Quick Error Detection tests for effective post-silicon validation". 2010 IEEE International Test Conference: 1–10. DOI:10.1109/TEST.2010.5699215. ISBN:978-1-4244-7206-2. S2CID:7909084.
Vizel، Y.؛ Weissenbacher، G.؛ Malik، S. (2015). "Boolean Satisfiability Solvers and Their Applications in Model Checking". Proceedings of the IEEE. ج. 103 ع. 11: 2021–2035. DOI:10.1109/JPROC.2015.2455034. S2CID:10190144.
Cook، Stephen A. (1971). "The Complexity of Theorem-Proving Procedures" (PDF). Proceedings of the 3rd Annual ACM Symposium on Theory of Computing: 151–158. CiteSeerX:10.1.1.406.395. DOI:10.1145/800157.805047. S2CID:7573663. مؤرشف من الأصل (PDF) في 2021-05-07.
Levin، Leonid (1973). "Universal search problems (Russian: Универсальные задачи перебора, Universal'nye perebornye zadachi)". Problems of Information Transmission (Russian: Проблемы передачи информа́ции, Problemy Peredachi Informatsii). ج. 9 ع. 3: 115–116. (pdf) باللغة الروسية, translated into English by Trakhtenbrot، B. A. (1984). "A survey of Russian approaches to perebor (brute-force searches) algorithms". Annals of the History of Computing. ج. 6 ع. 4: 384–400. DOI:10.1109/MAHC.1984.10036. S2CID:950581.

springer.com

link.springer.com

Mironov, Ilya; Zhang, Lintao (2006). Biere, Armin; Gomes, Carla P. (eds.). "Applications of SAT Solvers to Cryptanalysis of Hash Functions". Theory and Applications of Satisfiability Testing - SAT 2006. Lecture Notes in Computer Science (بالإنجليزية). Berlin, Heidelberg: Springer. 4121: 102–115. DOI:10.1007/11814948_13. ISBN:978-3-540-37207-3. Archived from the original on 2021-03-21.

toronto.edu

cs.toronto.edu

Cook، Stephen A. (1971). "The Complexity of Theorem-Proving Procedures" (PDF). Proceedings of the 3rd Annual ACM Symposium on Theory of Computing: 151–158. CiteSeerX:10.1.1.406.395. DOI:10.1145/800157.805047. S2CID:7573663. مؤرشف من الأصل (PDF) في 2021-05-07.

web.archive.org

Karp، Richard M. (1972). "Reducibility Among Combinatorial Problems" (PDF). في Raymond E. Miller؛ James W. Thatcher (المحررون). Complexity of Computer Computations. New York: Plenum. ص. 85–103. ISBN:0-306-30707-3. مؤرشف من الأصل (PDF) في 2011-06-29. اطلع عليه بتاريخ 2020-05-07. Here: p.86
Massacci, Fabio; Marraro, Laura (1 Feb 2000). "Logical Cryptanalysis as a SAT Problem". Journal of Automated Reasoning (بالإنجليزية). 24 (1): 165–203. DOI:10.1023/A:1006326723002. ISSN:1573-0670. Archived from the original on 2020-03-01.
Mironov, Ilya; Zhang, Lintao (2006). Biere, Armin; Gomes, Carla P. (eds.). "Applications of SAT Solvers to Cryptanalysis of Hash Functions". Theory and Applications of Satisfiability Testing - SAT 2006. Lecture Notes in Computer Science (بالإنجليزية). Berlin, Heidelberg: Springer. 4121: 102–115. DOI:10.1007/11814948_13. ISBN:978-3-540-37207-3. Archived from the original on 2021-03-21.
Cook، Stephen A. (1971). "The Complexity of Theorem-Proving Procedures" (PDF). Proceedings of the 3rd Annual ACM Symposium on Theory of Computing: 151–158. CiteSeerX:10.1.1.406.395. DOI:10.1145/800157.805047. S2CID:7573663. مؤرشف من الأصل (PDF) في 2021-05-07.

worldcat.org

Massacci, Fabio; Marraro, Laura (1 Feb 2000). "Logical Cryptanalysis as a SAT Problem". Journal of Automated Reasoning (بالإنجليزية). 24 (1): 165–203. DOI:10.1023/A:1006326723002. ISSN:1573-0670. Archived from the original on 2020-03-01.