Tag: Satisfiability

Applied Satisfiability Cryptography, Scheduling, and Coalitional Games


Free Download Applied Satisfiability: Cryptography, Scheduling, and Coalitional Games
English | 2025 | ISBN: 1394249780 | 254 Pages | PDF, EPUB (True) | 19 MB
The Boolean Satisfiability Problem (SAT) is one of the most famous and widely-studied problems in Boolean logic. Optimization versions of this problem include the Maximum Satisfiability Problem (MaxSAT) and its extensions, such as partial MaxSAT and weighted MaxSAT, which assess whether, and to what extent, a solution satisfies a given set of problems. Numerous applications of SAT and MaxSAT have emerged in fields related to logic and computing technology.

(more…)

Theory and Applications of Satisfiability Testing – SAT 2012 15th International Conference, Trento, Italy, June 17-20, 2012. P


Free Download Theory and Applications of Satisfiability Testing – SAT 2012: 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings By Aaron R. Bradley (auth.), Alessandro Cimatti, Roberto Sebastiani (eds.)
2012 | 500 Pages | ISBN: 3642316115 | PDF | 8 MB
This book constitutes the refereed proceedings of the 15th International Conference on Theory and Applications of Satisfiability Testing, SAT 2012, held in Trento, Italy, in June 2012. The 29 revised full papers, 7 tool papers, and 16 poster papers presented together with 2 invited talks were carefully reviewed and selected from 112 submissions (88 full, 10 tool and 14 poster papers). The papers are organized in topical sections on stochastic local search, theory, quantified Boolean formulae, applications, parallel and portfolio approaches, CDCL SAT solving, MAX-SAT, cores interpolants, complexity analysis, and circuits and encodings.

(more…)