Relevant bibliographies by topics / Parallel satisfiability

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Parallel satisfiability'

Author: Grafiati
Published: 25 May 2024
Last updated: 19 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Parallel satisfiability.'

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 "Parallel satisfiability"

1

Martins, Ruben, Vasco Manquinho, and Inês Lynce. "Parallel search for maximum satisfiability." AI Communications 25, no. 2 (2012): 75–95. http://dx.doi.org/10.3233/aic-2012-0517.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Martins, Ruben. "Parallel search for maximum satisfiability." Constraints 20, no. 4 (2015): 469–70. http://dx.doi.org/10.1007/s10601-015-9207-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

HAGLIN, DAVID J. "APPROXIMATING MAXIMUM 2-CNF SATISFIABILITY." Parallel Processing Letters 02, no. 02n03 (1992): 181–87. http://dx.doi.org/10.1142/s0129626492000301.

Full text
Abstract:
A parallel approximation algorithm for the MAXIMUM 2-CNF SATISFIABILITY problem is presented. This algorithm runs in O( log 2(n + |F|)) parallel time on a CREW PRAM machine using O(n + |F|) processors, where n is the number of variables and |F| is the number of clauses. Performance guarantees are considered for three slightly differing definitions of this problem.
APA, Harvard, Vancouver, ISO, and other styles
4

Feldman, Yulik, Nachum Dershowitz, and Ziyad Hanna. "Parallel Multithreaded Satisfiability Solver: Design and Implementation." Electronic Notes in Theoretical Computer Science 128, no. 3 (2005): 75–90. http://dx.doi.org/10.1016/j.entcs.2004.10.020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

SADOWSKI, Adrian. "A parallel pipelined naive method for testing satisfiability." PRZEGLĄD ELEKTROTECHNICZNY 1, no. 11 (2015): 156–59. http://dx.doi.org/10.15199/48.2015.11.38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Blochinger, Wolfgang, Carsten Sinz, and Wolfgang Küchlin. "Parallel propositional satisfiability checking with distributed dynamic learning." Parallel Computing 29, no. 7 (2003): 969–94. http://dx.doi.org/10.1016/s0167-8191(03)00068-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wen-Zhang, Liu, Zhang Jing-Fu, and Long Gui-Lu. "A Parallel Quantum Algorithm for the Satisfiability Problem." Communications in Theoretical Physics 49, no. 3 (2008): 629–30. http://dx.doi.org/10.1088/0253-6102/49/3/22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cheng, Dan. "The New Democratic Revolution in Music during the Play Experience of the Ideological and Political Education Function." Applied Mechanics and Materials 556-562 (May 2014): 6602–5. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.6602.

Full text
Abstract:
After a deep investigation on the maximum terms space of the clause set, the concept of the partial maximum terms space of the clause set, which the maximum terms of the clause set decomposed, is brought forward. By investigating the extension rule, this paper introduces the concept of the satisfiability and the unsatisfiability of the partial maximum terms space, and gives an algorithm determining the satisfiability of a partial space of the maximum terms - algorithm PSER (Partial Semi-Extension Rule). Then, the TP problem is decomposed into several sub-problems independent of each other, whi
APA, Harvard, Vancouver, ISO, and other styles
9

HEAD, TOM. "PHOTOCOMPUTING: EXPLORATIONS WITH TRANSPARENCY AND OPACITY." Parallel Processing Letters 17, no. 04 (2007): 339–47. http://dx.doi.org/10.1142/s0129626407003071.

Full text
Abstract:
We continue to search for methods of parallel computing using light. An algorithm for solving instances of the Boolean satisfiability problem is given and illustrated using a photocopying machine with plastic transparencies as medium. The algorithm solves satisfiability problems in linear time but requires the assumption that information can be stored with a density that is exponential in the number of variables in the problem instance. Consideration is given to situations in which this density limitation is not quite absolute.
APA, Harvard, Vancouver, ISO, and other styles
10

Czutro, Alexander, Ilia Polian, Matthew Lewis, Piet Engelke, Sudhakar M. Reddy, and Bernd Becker. "Thread-Parallel Integrated Test Pattern Generator Utilizing Satisfiability Analysis." International Journal of Parallel Programming 38, no. 3-4 (2010): 185–202. http://dx.doi.org/10.1007/s10766-009-0124-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Parallel satisfiability"

1

Sohanghpurwala, Ali Asgar Ali Akbar. "Exploits in Concurrency for Boolean Satisfiability." Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/86417.

Full text
Abstract:
Boolean Satisfiability (SAT) is a problem that holds great theoretical significance along with effective formulations that benefit many real-world applications. While the general problem is NP-complete, advanced solver algorithms and heuristics allow for fast solutions to many large industrial problems. In addition to SAT, many applications rely on generalizations of Satisfiability such as MaxSAT, and Satisfiability Modulo Theories (SMT). Much of the advancement in SAT solver performance has been in the realm of improved sequential solvers with advanced conflict resolution, learning mechanis
APA, Harvard, Vancouver, ISO, and other styles
2

Hoessen, Benoît. "Solving the Boolean satisfiability problem using the parallel paradigm." Thesis, Artois, 2014. http://www.theses.fr/2014ARTO0406/document.

Full text
Abstract:
Cette thèse présente différentes techniques permettant de résoudre le problème de satisfaction de formule booléenes utilisant le parallélisme et du calcul distribué. Dans le but de fournir une explication la plus complète possible, une présentation détaillée de l'algorithme CDCL est effectuée, suivi d'un état de l'art. De ce point de départ, deux pistes sont explorées. La première est une amélioration d'un algorithme de type portfolio, permettant d'échanger plus d'informations sans perte d'efficacité. La seconde est une bibliothèque de fonctions avec son interface de programmation permettant d
APA, Harvard, Vancouver, ISO, and other styles
3

Boyd, Mark J. "Complexity analysis of a massive parallel boolean satisfiability implication circuit /." Diss., Digital Dissertations Database. Restricted to UC campuses, 2005. http://uclibs.org/PID/11984.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Manthey, Norbert. "Towards Next Generation Sequential and Parallel SAT Solvers." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-158672.

Full text
Abstract:
This thesis focuses on improving the SAT solving technology. The improvements focus on two major subjects: sequential SAT solving and parallel SAT solving. To better understand sequential SAT algorithms, the abstract reduction system Generic CDCL is introduced. With Generic CDCL, the soundness of solving techniques can be modeled. Next, the conflict driven clause learning algorithm is extended with the three techniques local look-ahead, local probing and all UIP learning that allow more global reasoning during search. These techniques improve the performance of the sequential SAT solver Riss
APA, Harvard, Vancouver, ISO, and other styles
5

Guo, Long. "Résolution séquentielle et parallèle du problème de la satisfiabilité propositionnelle." Thesis, Artois, 2013. http://www.theses.fr/2013ARTO0408/document.

Full text
Abstract:
Cette thèse porte sur la résolution séquentielle et parallèle du problème de la satisfiabilité propositionnelle(SAT). Ce problème important sur le plan théorique admet de nombreuses applications qui vont de la vérification formelle de matériels et de logiciels à la cryptographie en passant par la planification et la bioinformatique. Plusieurs contributions sont apportées dans cette thèse. La première concerne l’étude et l’intégration des concepts d’intensification et de diversification dans les solveurs SAT parallèle de type portfolio. Notre seconde contribution exploite l’état courant de la r
APA, Harvard, Vancouver, ISO, and other styles
6

Vallade, Vincent. "Contributions à la résolution parallèle du problème SAT." Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS260.

Full text
Abstract:
Cette thèse présente des contributions multiples et orthogonales à l'amélioration de la résolution parallèle du problème de satisfiabilité booléenne (ou problème SAT). Une instance du problème SAT est une formule propositionnelle de forme particulière (la forme normale conjonctive est la plus courante) représentant, en général, les variables et les contraintes d'un problème du monde réel, tel que la planification multi-contraintes, la vérification matérielle et logicielle ou la cryptographie. La résolution du problème SAT consiste à déterminer s'il existe une affectation des variables qui perm
APA, Harvard, Vancouver, ISO, and other styles
7

Lagniez, Jean-Marie. "Satisfiabilité propositionnelle et raisonnement par contraintes : modèles et algorithmes." Thesis, Artois, 2011. http://www.theses.fr/2011ARTO0404/document.

Full text
Abstract:
La thèse porte sur la résolution des problèmes de satisfiabilité propositionnelle (SAT) et des problèmesde satisfaction de contraintes (CSP). Ces deux modèles déclaratifs sont largement utilisés pour résoudredes problèmes combinatoires de première importance comme la vérification formelle de matérielset de logiciels, la bioinformatique, la cryptographie, la planification et l’ordonnancement de tâches.Plusieurs contributions sont apportées dans cette thèse. Elles vont de la proposition de schémas d’hybridationdes méthodes complètes et incomplètes, répondant ainsi à un challenge ouvert depuis 19
APA, Harvard, Vancouver, ISO, and other styles
8

Legendre, Florian. "Exploitation de la logique propositionnelle pour la résolution parallèle des problèmes cryptographiques." Thesis, Reims, 2014. http://www.theses.fr/2014REIMS006/document.

Full text
Abstract:
La démocratisation des ordinateurs, des téléphones portables et surtout de l'Internet a considérablement révolutionné le monde de la communication. Les besoins en matière de cryptographie sont donc plus nombreux et la nécessité de vérifier la sûreté des algorithmes de chiffrement est vitale. Cette thèse s'intéresse à l'étude d'une nouvelle cryptanalyse, appelée cryptanalyse logique, qui repose sur l'utilisation de la logique propositionnelle - à travers le problème de satisfaisabilité - pour exprimer et résoudre des problèmes cryptographiques. Plus particulièrement, les travaux présentés ici p
APA, Harvard, Vancouver, ISO, and other styles
9

LI, QIAN-WU, and 李謙吾. "A parallel algorithm for satisfiability problem." Thesis, 1990. http://ndltd.ncl.edu.tw/handle/33008809664444510669.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lin, Kung-Ming, and 林拱民. "Implementation of Parallel Boolean Satisfiability Solver by CUDA (Compute Unified Device Architecture)." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/53763433686308452413.

Full text
Abstract:
碩士<br>國立臺灣大學<br>電子工程學研究所<br>99<br>Boolean satisfiability (SAT) problem plays a critical role in theoretical and industrial applications. With the advance of SAT solvers in the past 15 years, we are capable to solve fairly large-scale problems. To improve the performance of SAT solvers for much larger and harder SAT problems, parallelization of SAT solvers is gaining much attention in recent years. The state-of-the-art 4-to-8 threaded parallel SAT solvers are more powerful than single-threaded ones in recent international SAT solver competitions. General-Purpose computation on Graphics Proces
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Parallel satisfiability"

1

Balyo, Tomáš, and Carsten Sinz. "Parallel Satisfiability." In Handbook of Parallel Constraint Reasoning. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-63516-3_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lynce, Inês, Vasco Manquinho, and Ruben Martins. "Parallel Maximum Satisfiability." In Handbook of Parallel Constraint Reasoning. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-63516-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hyvärinen, Antti E. J., and Christoph M. Wintersteiger. "Parallel Satisfiability Modulo Theories." In Handbook of Parallel Constraint Reasoning. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-63516-3_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hamadi, Youssef. "Parallel Tree Search for Satisfiability." In Combinatorial Search: From Algorithms to Systems. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41482-4_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hamadi, Youssef. "Parallel Local Search for Satisfiability." In Combinatorial Search: From Algorithms to Systems. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41482-4_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Heule, Marijn J. H., Oliver Kullmann, and Armin Biere. "Cube-and-Conquer for Satisfiability." In Handbook of Parallel Constraint Reasoning. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-63516-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gu, Jun. "Parallel algorithms for satisfiability (SAT) problem." In Parallel Processing of Discrete Optimization Problems. American Mathematical Society, 1995. http://dx.doi.org/10.1090/dimacs/022/06.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gu, Jun. "Parallel Algorithms for Satisfiability (SAT) Testing." In The IMA Volumes in Mathematics and its Applications. Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4612-1492-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Belov, Anton, Norbert Manthey, and Joao Marques-Silva. "Parallel MUS Extraction." In Theory and Applications of Satisfiability Testing – SAT 2013. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39071-5_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lewandowski, Gary, and Anne Condon. "Experiments with parallel graph coloring heuristics and applications of graph coloring." In Cliques, Coloring, and Satisfiability. American Mathematical Society, 1996. http://dx.doi.org/10.1090/dimacs/026/15.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Parallel satisfiability"

1

Bogdanova, V. G., and S. A. Gorsky. "Scalable parallel solver of boolean satisfiability problems." In 2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO). IEEE, 2018. http://dx.doi.org/10.23919/mipro.2018.8400042.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sivaramakrishnan, V., S. C. Seth, and P. Agrawal. "Parallel test pattern generation using Boolean satisfiability." In [1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design. IEEE, 1991. http://dx.doi.org/10.1109/isvd.1991.185095.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Martins, Ruben, Vasco Manquinho, and Inês Lynce. "Exploiting Cardinality Encodings in Parallel Maximum Satisfiability." In 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2011. http://dx.doi.org/10.1109/ictai.2011.54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Menouer, Tarek, and Souheib Baarir. "Parallel Satisfiability Solver Based on Hybrid Partitioning Method." In 2017 25th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP). IEEE, 2017. http://dx.doi.org/10.1109/pdp.2017.70.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Nemer-Preece, Nicole, and Ralph Wilkerson. "Parallel genetic algorithm to solve the satisfiability problem." In the 1998 ACM symposium. ACM Press, 1998. http://dx.doi.org/10.1145/330560.330565.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Abramovici, Miron, Jose T. de Sousa, and Daniel Saab. "A massively-parallel easily-scalable satisfiability solver using reconfigurable hardware." In the 36th ACM/IEEE conference. ACM Press, 1999. http://dx.doi.org/10.1145/309847.310028.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bogdanova, V. G., S. A. Gorsky, and A. A. Pashinin. "HPC-based parallel software for solving applied Boolean satisfiability problems." In 2020 43rd International Convention on Information, Communication and Electronic Technology (MIPRO). IEEE, 2020. http://dx.doi.org/10.23919/mipro48935.2020.9245400.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Czutro, A., I. Polian, M. Lewis, P. Engelke, S. M. Reddy, and B. Becker. "TIGUAN: Thread-Parallel Integrated Test Pattern Generator Utilizing Satisfiability ANalysis." In 2009 22nd International Conference on VLSI Design. IEEE, 2009. http://dx.doi.org/10.1109/vlsi.design.2009.20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Herzig, Andreas, Frédéric Maris, and Julien Vianey. "Dynamic logic of parallel propositional assignments and its applications to planning." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/774.

Full text
Abstract:
We introduce a dynamic logic with parallel composition and two kinds of nondeterministic composition, exclusive and inclusive. We show PSPACE completeness of both the model checking and the satisfiability problem and apply our logic to sequential and parallel classical planning where actions have conditional effects.
APA, Harvard, Vancouver, ISO, and other styles
10

Audemard, Gilles, Benoit Hoessen, Said Jabbour, and Cedric Piette. "An Effective Distributed D&C Approach for the Satisfiability Problem." In 2014 22nd Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE, 2014. http://dx.doi.org/10.1109/pdp.2014.92.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Parallel satisfiability' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography