What sort of mathematics do I need for computer science? In response to this frequently asked question, a pair of professors at the University of California at San Diego created this text. Its sources are two of the university's most basic courses: Discrete Mathematics, and Mathematics for Algorithm and System Analysis. Intended for use by sophomores in the first of a two-quarter sequence, the text assumes some familiarity with calculus. Topics include Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction,...

Discrete mathematics is fundamental to computer science, and interesting, challenging problems in discrete mathematics arise in programming languages, computer architecture, networking, distributed systems, database systems, artificial intelligence, theoretical computer science, and elsewhere. This up-to-date text prepares undergraduates with four units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory. Each unit is divided into four sections, and each section contains a selection of problems that vary in difficulty. Solutions to these...

Mathematical Methods in Artificial Intelligence introduces the student to the important mathematical foundations and tools in AI and describes their applications to the design of AI algorithms. This useful text presents an introductory AI course based on the most important mathematics and its applications. It focuses on important topics that are proven useful in AI and involve the most broadly applicable mathematics.

The book explores AI from three different viewpoints: goals, methods or tools, and achievements and failures. Its goals of reasoning, planning, learning, or language...