SAT-2000

by Toby Walsh (Editor)

This collection of 20 papers surveys incomplete local search methods for solving propositional satisfiability (SAT) problems as well as depth first, breadth first, and restricted resolution based complete solvers and hybrid mixtures. Some of the contributors present applications from optimization theory, algorithms to generate test problems, and examples of how to use SAT solvers for decision procedures in more expressive systems such as modal and quantified Boolean logics. No subject index. Some of the papers will be published in the Journal of Automated Reasoning . Annotation c. Book News, Inc., Portland, OR (booknews.com)

568 pages, Hardcover

First published January 1, 2000

About the author

Toby Walsh is one of the world’s leading researchers in Artificial Intelligence. He is a Professor of Artificial Intelligence at the University of New South Wales and leads a research group at Data61, Australia’s Centre of Excellence for ICT Research. He has been elected a fellow of the Association for the Advancement of AI for his contributions to AI research, and has won the prestigious Humboldt research award. He has previously held research positions in England, Scotland, France, Germany, Italy, Ireland and Sweden.