Theory and Applications of Satisfiability Testing – SAT 2021 [electronic resource] : 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings /

Contributor(s):

Material type: Text

TextSeries: Theoretical Computer Science and General Issues ; 12831Publisher: Cham : Springer International Publishing : Imprint: Springer, 2021Edition: 1st ed. 2021Description: XI, 564 p. 95 illus., 70 illus. in color. online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783030802233

Subject(s):

Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:

004.0151 23

LOC classification:

QA75.5-76.95

Online resources:

Click here to access online

In: Springer Nature eBookSummary: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

No physical items for this record

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.

There are no comments on this title.

to post a comment.