In Constraint Processing, Rina Dechter, synthesizes these contributions, along with her own significant work, to provide the first comprehensive examination of the theory that underlies constraint processing algorithms. Throughout, she focuses on fundamental tools and principles, emphasizing the representation and analysis of algorithms.
- Examines the basic practical aspects of each topic and then tackles more advanced issues, including current research challenges- Builds the reader's understanding with definitions, examples, theory, algorithms and complexity analysis- Synthesizes three decades of researchers work on constraint processing in AI, databases and programming languages, operations research, management science, and applied mathematics
Please Note: This is an On Demand product, delivery may take up to 11 working days after payment has been received.
Rina Dechter is a professor of Computer Science at the University of California, Irvine. She received her PhD in Computer Science at UCLA in 1985, a MS degree in Applied Mathematic from the Weizman Institute and a B.S in Mathematics and Ststistics from the Hebrew University, Jerusalem. Her research centers on computational aspects of automated reasoning and knowledge representation including search, constraint processing and probabilistic reasoning. Professor Dechter has authored over 50 research papers, and has served on the editorial boards of: Artificial Intelligence, the Constraint Journal, Journal of Artificial Intelligence Research and the Encyclopedia of AI. She was awarded the Presidential Young investigator award in 1991 and is a fellow of the American association of Artificial Intelligence.