Thematische Bibliographien / Parallel satisfiability

Auswahl der wissenschaftlichen Literatur zum Thema „Parallel satisfiability“

Autor: Grafiati
Veröffentlicht am 25. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Inhaltsverzeichnis

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Parallel satisfiability" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Parallel satisfiability"

1

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

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

Der volle Inhalt der Quelle
Annotation:
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 und andere Zitierweisen
4

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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 (Mai 2014): 6602–5. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.6602.

Der volle Inhalt der Quelle
Annotation:
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, which can be solved by the given parallel computing method PPSER (Parallel Partial Semi-Extension Rule).
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

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

Der volle Inhalt der Quelle
Annotation:
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 und andere Zitierweisen
Mehr Quellen

Dissertationen zum Thema "Parallel satisfiability"

1

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

Der volle Inhalt der Quelle
Annotation:
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 de créer facilement des solveurs SAT distribués
This thesis presents different technique to solve the Boolean satisfiability problem using parallel and distributed architectures. In order to provide a complete explanation, a careful presentation of the CDCL algorithm is made, followed by the state of the art in this domain. Once presented, two propositions are made. The first one is an improvement on a portfolio algorithm, allowing to exchange more data without loosing efficiency. The second is a complete library with its API allowing to easily create distributed SAT solver
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

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

Der volle Inhalt der Quelle
Annotation:
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 mechanisms, and sophisticated heuristics. There have been some successful demonstrations of massively parallel and hardware-accelerated solvers for SAT, but these have failed to find their way into mainstream usage. This document first presents previous work in Hardware Acceleration of Satisfiability followed by an analysis of why these attempts failed to gain widespread acceptance. It then demonstrates an alternative, hardware-centric approach, based on distributed Stochastic Local Search (SLS) that is better suited to efficient hardware implementation. Then a parallel SLS/CDCL hybrid approach is proposed that is suitable for distributed search with minimal communication overhead while maintaining completeness. Finally the efficacy and flexibility of distributed local search is considered with an adaptation to Weighted Partial MaxSAT (WPMS) and a focused case study on converted Probabilistic Inference instances.
Ph. D.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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.

Der volle Inhalt der Quelle
Annotation:
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. Then, the formula simplification techniques bounded variable addition, covered literal elimination and an advanced cardinality constraint extraction are introduced. By using these techniques, the reasoning of the overall SAT solving tool chain becomes stronger than plain resolution. When using these three techniques in the formula simplification tool Coprocessor before using Riss to solve a formula, the performance can be improved further. Due to the increasing number of cores in CPUs, the scalable parallel SAT solving approach iterative partitioning has been implemented in Pcasso for the multi-core architecture. Related work on parallel SAT solving has been studied to extract main ideas that can improve Pcasso. Besides parallel formula simplification with bounded variable elimination, the major extension is the extended clause sharing level based clause tagging, which builds the basis for conflict driven node killing. The latter allows to better identify unsatisfiable search space partitions. Another improvement is to combine scattering and look-ahead as a superior search space partitioning function. In combination with Coprocessor, the introduced extensions increase the performance of the parallel solver Pcasso. The implemented system turns out to be scalable for the multi-core architecture. Hence iterative partitioning is interesting for future parallel SAT solvers. The implemented solvers participated in international SAT competitions. In 2013 and 2014 Pcasso showed a good performance. Riss in combination with Copro- cessor won several first, second and third prices, including two Kurt-Gödel-Medals. Hence, the introduced algorithms improved modern SAT solving technology.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
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.

Der volle Inhalt der Quelle
Annotation:
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 recherche partiellement décrit par les récentes polarités des littéraux « progress saving », pour ajuster et diriger dynamiquement les solveurs associés aux différentes unités de calcul. Dans la troisième contribution, nous proposons des améliorations de la stratégie de réduction de labase des clauses apprises. Deux nouveaux critères, permettant d’identifier les clauses pertinentes pour la suite de la recherche, ont été proposés. Ces critères sont utilisés ensuite comme paramètre supplémentaire de diversification dans les solveurs de type portfolio. Finalement, nous présentons une nouvelle approche de type diviser pour régner où la division s’effectue par ajout de contraintes particulières
In this thesis, we deal with the sequential and parallel resolution of the problem SAT. Despite of its complexity, the resolution of SAT problem is an excellent and competitive approach for solving thecombinatorial problems such as the formal verification of hardware and software, the cryptography, theplanning and the bioinfomatics. Several contribution are made in this thesis. The first contribution aims to find the compromise of diversification and intensification in the solver of type portfolio. In our second contribution, we propose to dynamically adjust the configuration of a core in a portfolio parallel sat solver when it is determined that another core performs similar work. In the third contribution, we improve the strategy of reduction of the base of learnt clauses, we construct a portfolio strategy of reduction in parallel solver. Finally, we present a new approach named "Virtual Control" which is to distribute the additional constraints to each core in a parallel solver and verify their consistency during search
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

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

Der volle Inhalt der Quelle
Annotation:
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 1998, àla résolution parallèle sur architecture multi-coeurs, en passant par l’amélioration des stratégies de résolution.Cette dernière contribution a été primée à la dernière conférence internationale du domaine (prixdu meilleur papier). Ce travail de thèse a donné lieu à plusieurs outils (open sources) de résolution desproblèmes SAT et CSP, compétitifs au niveau international
This thesis deals with propositional satisfiability (SAT) and constraint satisfaction problems(CSP). These two declarative models are 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 proposition of hybridization schemes of complete andincomplete methods, giving rise to an original answer to a well-known challenge open since 1998. Secondly,a new and efficient multi-core parallel approach is proposed. In the third contribution, a novelapproach for improving clause learning management database is designed. This contribution allows spatialcomplexity reduction of the resolution-based component of SAT solvers while maintaining relevantconstraints. This contribution was awarded at the last international SAT conference (best paper award).This work has led to several open sources solving tools for both propositional satisfiability and constraintssatisfaction problems
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

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.

Der volle Inhalt der Quelle
Annotation:
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 portent sur une certaine catégorie de chiffrements utilisés dans les protocoles d'authentification et d'intégrité de données qu'on appelle fonctions de hachage cryptographiques. Un premier point concerne l'aspect modélisation d'un problème cryptographique en un problème de satisfaisabilité et sa simplification logique. Sont ensuite présentées plusieurs façons pour utiliser cette modélisation fine, dont un raisonnement probabiliste sur les données du problème qui permet, entres autres, d'améliorer les deux principaux points d'une attaque par cryptanalyse logique, à savoir la modélisation et la résolution. Un second point traite des attaques menées en pratique. Dans ce cadre, la recherche de pré-Image pour les fonctions de hachage les plus couramment utilisées mènent à repousser les limites de la résistance de ces fonctions à la cryptanalyse logique. À cela s'ajoute plusieurs attaques pour la recherche de collisions dans le cadre de la logique propositionnelle
Democratization of increasingly high-Performance digital technologies and especially the Internet has considerably changed the world of communication. Consequently, needs in cryptography are more and more numerous and the necessity of verifying the security of cipher algorithms is essential.This thesis deals with a new cryptanalysis, called logical cryptanalysis, which is based on the use of logical formalism to express and solve cryptographic problems. More precisely, works presented here focuses on a particular category of ciphers, called cryptographic hash functions, used in authentication and data integrity protocols.Logical cryptanalysis is a specific algebraic cryptanalysis where the expression of the cryptographic problem is done through the satisfiabilty problem, fluently called sat problem. It consists in a combinatorial problem of decision which is central in complexity theory. In the past years, works led by the scientific community have allowed to develop efficient solvers for industrial and academical problems.Works presented in this thesis are the fruit of an exploration between satisfiability and cryptanalysis, and have enabled to display new results and innovative methods to weaken cryptographic functions.The first contribution is the modeling of a cryptographic problem as a sat problem. For this, we present some rules that lead to describe easily basic operations involved in cipher algorithms. Then, a section is dedicated to logical reasoning in order to simplify the produced sat formulas and show how satisfiability can help to enrich a knowledge on a studied problem. Furthermore, we also present many points of view to use our smooth modeling to apply a probabilistic reasoning on all the data associated with the generated sat formulas. This has then allowed to improve both the modeling and the solving of the problem and underlined a weakness about the use of round constants.Second, a section is devoted to practical attacks. Within this framework, we tackled preimages of the most popular cryptographic hash functions. Moreover, the collision problem is also approached in different ways, and particularly, the one-Bloc collision attack of Stevens on MD5 was translated within a logical context. It's interesting to remark that in both cases, logical cryptanalysis takes a new look on the considered problems
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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

Der volle Inhalt der Quelle
Annotation:
碩士
國立臺灣大學
電子工程學研究所
99
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 Processing Units (GPGPU) is also emerging from massive parallel computing realm. To explore the concept of massive parallel SAT solvers, we have implemented the “CUDASAT”, a parallel CDCL-DPLL (Conflict Driven Clause Learning - Davis-Putnam-Logemann-Loveland) SAT solver with clause sharing on CUDA (Compute Unified Device Architecture) platform. To the best of our knowledge, CUDASAT is the first of its kind. The experimental results demonstrated a downward trend in average searching events per solver while increasing the number of parallel solver. While the performance is not comparable to those state-of-the-art parallel SAT solvers, CUDASAT serves as a prototype of massive parallelization toward an affordable and alternative solution for SAT solving.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Manthey, Norbert. „Towards Next Generation Sequential and Parallel SAT Solvers“. Doctoral thesis, 2014. https://tud.qucosa.de/id/qucosa%3A28471.

Der volle Inhalt der Quelle
Annotation:
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. Then, the formula simplification techniques bounded variable addition, covered literal elimination and an advanced cardinality constraint extraction are introduced. By using these techniques, the reasoning of the overall SAT solving tool chain becomes stronger than plain resolution. When using these three techniques in the formula simplification tool Coprocessor before using Riss to solve a formula, the performance can be improved further. Due to the increasing number of cores in CPUs, the scalable parallel SAT solving approach iterative partitioning has been implemented in Pcasso for the multi-core architecture. Related work on parallel SAT solving has been studied to extract main ideas that can improve Pcasso. Besides parallel formula simplification with bounded variable elimination, the major extension is the extended clause sharing level based clause tagging, which builds the basis for conflict driven node killing. The latter allows to better identify unsatisfiable search space partitions. Another improvement is to combine scattering and look-ahead as a superior search space partitioning function. In combination with Coprocessor, the introduced extensions increase the performance of the parallel solver Pcasso. The implemented system turns out to be scalable for the multi-core architecture. Hence iterative partitioning is interesting for future parallel SAT solvers. The implemented solvers participated in international SAT competitions. In 2013 and 2014 Pcasso showed a good performance. Riss in combination with Copro- cessor won several first, second and third prices, including two Kurt-Gödel-Medals. Hence, the introduced algorithms improved modern SAT solving technology.
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Parallel satisfiability"

1

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Lynce, Inês, Vasco Manquinho und Ruben Martins. „Parallel Maximum Satisfiability“. In Handbook of Parallel Constraint Reasoning, 61–99. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-63516-3_3.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Gu, Jun. „Parallel algorithms for satisfiability (SAT) problem“. In Parallel Processing of Discrete Optimization Problems, 105–61. Providence, Rhode Island: American Mathematical Society, 1995. http://dx.doi.org/10.1090/dimacs/022/06.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Lewandowski, Gary, und Anne Condon. „Experiments with parallel graph coloring heuristics and applications of graph coloring“. In Cliques, Coloring, and Satisfiability, 309–34. Providence, Rhode Island: American Mathematical Society, 1996. http://dx.doi.org/10.1090/dimacs/026/15.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Parallel satisfiability"

1

Bogdanova, V. G., und 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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Sivaramakrishnan, V., S. C. Seth und 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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Martins, Ruben, Vasco Manquinho und 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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Menouer, Tarek, und 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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Nemer-Preece, Nicole, und Ralph Wilkerson. „Parallel genetic algorithm to solve the satisfiability problem“. In the 1998 ACM symposium. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/330560.330565.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

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

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Bogdanova, V. G., S. A. Gorsky und 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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Czutro, A., I. Polian, M. Lewis, P. Engelke, S. M. Reddy und 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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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

Der volle Inhalt der Quelle
Annotation:
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 und andere Zitierweisen
10

Audemard, Gilles, Benoit Hoessen, Said Jabbour und 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.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "Parallel satisfiability" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie