Constraint Satisfaction: Fundamentals and Applications
Apie šią el. knygą
In artificial intelligence and operations research, the process of finding a solution through a set of constraints that impose conditions that the variables must satisfy is referred to as constraint satisfaction. Therefore, a solution is a collection of values for the variables that fulfills all of the constraints; more specifically, a solution is a point in the feasible region.
How You Will Benefit
(I) Insights, and validations about the following topics:
Chapter 1: Constraint satisfaction
Chapter 2: Boolean satisfiability problem
Chapter 3: Search algorithm
Chapter 4: Mathematical optimization
Chapter 5: Constraint programming
Chapter 6: Constraint satisfaction problem
Chapter 7: Backtracking
Chapter 8: 2-satisfiability
Chapter 9: Nonlinear programming
Chapter 10: WalkSAT
(II) Answering the public top questions about constraint satisfaction.
(III) Real world examples for the usage of constraint satisfaction in many fields.
(IV) 17 appendices to explain, briefly, 266 emerging technologies in each industry to have 360-degree full understanding of constraint satisfaction' technologies.
Who This Book Is For
Professionals, undergraduate and graduate students, enthusiasts, hobbyists, and those who want to go beyond basic knowledge or information for any kind of constraint satisfaction.
