Bridging Constraint Satisfaction and Boolean Satisfiability by Justyna Petke
This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers.-
Towards a Code of Ethics for Artificial Intelligence
-
AI Ethics
-
Machine Learning Safety
-
Responsible Artificial Intelligence
-
Non-prioritized Belief Change
-
Large Language Models
-
Multi-Modal Robotic Intelligence
-
Foundation Models for Natural Language Processing
-
Heterogeneous Graph Representation Learning and Applications
-
Coordination of Complex Sociotechnical Systems
-
Subjective Logic
-
Feature Selection for High-Dimensional Data
-
Hybrid Metaheuristics
-
Decision Diagrams for Optimization
-
The Geometry of Uncertainty
-
Neural Text-to-Speech Synthesis
-
Hypergraph Computation
Justyna Petke received her D.Phil. from the University of Oxford. She is a Research Associate at the Centre for Research on Evolution, Search and Testing (CREST) in the Dept. of Computer Science, University College London. Her research interests include the connections between constraint satisfaction and search-based software engineering, including genetic improvement and combinatorial interaction testing.
| SKU | Unavailable |
| ISBN 13 | 9783319218090 |
| ISBN 10 | 3319218093 |
| Title | Bridging Constraint Satisfaction and Boolean Satisfiability |
| Author | Justyna Petke |
| Series | Artificial Intelligence: Foundations Theory And Algorithms |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Springer International Publishing AG |
| Year published | 2015-08-19 |
| Number of pages | 113 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |