Theory and Applications of Satisfiability Testing – SAT 2021 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings /
Theory and Applications of Satisfiability Testing – SAT 2021 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings / [electronic resource] :
edited by Chu-Min Li, Felip Manyà.
- 1st ed. 2021.
- XI, 564 p. 95 illus., 70 illus. in color. online resource.
- Theoretical Computer Science and General Issues, 12831 2512-2029 ; .
- Theoretical Computer Science and General Issues, 12831 .
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.
9783030802233
10.1007/978-3-030-80223-3 doi
Computer science.
Computer systems.
Logic programming.
Microprogramming .
Computers, Special purpose.
Software engineering.
Theory of Computation.
Computer System Implementation.
Logic in AI.
Control Structures and Microprogramming.
Special Purpose and Application-Based Systems.
Software Engineering.
QA75.5-76.95
004.0151
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.
9783030802233
10.1007/978-3-030-80223-3 doi
Computer science.
Computer systems.
Logic programming.
Microprogramming .
Computers, Special purpose.
Software engineering.
Theory of Computation.
Computer System Implementation.
Logic in AI.
Control Structures and Microprogramming.
Special Purpose and Application-Based Systems.
Software Engineering.
QA75.5-76.95
004.0151