My Account Log in

1 option

Theory and Applications of Satisfiability Testing - SAT 2021 : 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings / edited by Chu-Min Li, Felip Manyà.

SpringerLink Books Computer Science (2011-2024) Available online

View online
Format:
Book
Contributor:
Lī, Čhư̄ Min, Editor.
Manyà, Felip, Editor.
SpringerLink (Online service)
Series:
Computer Science (SpringerNature-11645)
LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 12831
Theoretical Computer Science and General Issues, 2512-2029 ; 12831
Language:
English
Subjects (All):
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.
Local Subjects:
Theory of Computation.
Computer System Implementation.
Logic in AI.
Control Structures and Microprogramming.
Special Purpose and Application-Based Systems.
Software Engineering.
Physical Description:
1 online resource (XI, 564 pages) : 95 illustrations, 70 illustrations in color.
Edition:
1st ed. 2021.
Contained In:
Springer Nature eBook
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2021.
System Details:
text file PDF
Summary:
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.
Other Format:
Printed edition:
ISBN:
978-3-030-80223-3
9783030802233
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account