Andere Kunden interessierten sich auch für
![Theory and Applications of Satisfiability Testing ¿ SAT 2020]( "Theory and Applications of Satisfiability Testing ¿ SAT 2020")
Theory and Applications of Satisfiability Testing ¿ SAT 202037,99 €![Principles and Practice of Constraint Programming]( "Principles and Practice of Constraint Programming")
Principles and Practice of Constraint Programming111,99 €![Theory and Applications of Satisfiability Testing ¿ SAT 2019]( "Theory and Applications of Satisfiability Testing ¿ SAT 2019")
Theory and Applications of Satisfiability Testing ¿ SAT 201937,99 €![Formal Modeling and Analysis of Timed Systems]( "Formal Modeling and Analysis of Timed Systems")
Formal Modeling and Analysis of Timed Systems37,99 €![Logic and Its Applications]( "Logic and Its Applications")
Logic and Its Applications48,99 €![Formal Methods: Foundations and Applications]( "Formal Methods: Foundations and Applications")
Formal Methods: Foundations and Applications41,99 €![Verification, Model Checking, and Abstract Interpretation]( "Verification, Model Checking, and Abstract Interpretation")
Verification, Model Checking, and Abstract Interpretation66,99 €
This book constitutes the proceedings of the 24th International Conference on Theory and Applications of Satisfiability Testing, SAT 2021, which took place in Barcelona, Spain, in July 2021.
The 37 full papers presented in this volume were carefully reviewed and selected from 73 submissions. They deal with theory and applications of the propositional satisfiability problem, broadly construed. Aside from plain propositional satisfiability, the scope of the meeting includes Boolean optimization, including MaxSAT and pseudo-Boolean (PB) constraints, quantified Boolean formulas (QBF), satisfiability modulo theories (SMT), and constraint programming (CP) for problems with clear connections to Boolean reasoning.
The 37 full papers presented in this volume were carefully reviewed and selected from 73 submissions. They deal with theory and applications of the propositional satisfiability problem, broadly construed. Aside from plain propositional satisfiability, the scope of the meeting includes Boolean optimization, including MaxSAT and pseudo-Boolean (PB) constraints, quantified Boolean formulas (QBF), satisfiability modulo theories (SMT), and constraint programming (CP) for problems with clear connections to Boolean reasoning.