A constraint satisfaction problem (CSP) requires a value, selected from a given finite
domain, to be assigned to each variable in the problem, so that all constraints relating the …

Publisher Summary Early attempts at qualitative spatial reasoning within the qualitative
reasoning (QR) community led to the poverty conjecture. The need for spatial …

本书共16 章. 第1~ 6 章讨论人工智能的认知问题和逻辑基础, 论述约束推理, 定性推理,
基于范例推理, 概率推理. 第7~ 13 章重点讨论机器学习, 包括归纳学习, 支持向量机, 解释学习 …

Many natural combinatorial problems can be expressed as constraint satisfaction problems.
This class of problems is known to be NP-complete in general, but certain restrictions on the …

Project scheduling is concerned with single-item or small batch production where scarce
resources have to be allocated to dependent activities over time. Applications can be found …

Before using interval analysis as a basic tool in the following chapters, we shall now
introduce its main concepts. Section 2.2 recalls fundamental notions on set operators, set …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Project controls have traditionally been focused on after-the-fact detection of variances. This
thesis proposes a control system, the Last Planner system, that causes the realization of …

Ambiguity resolution is a central problem in language comprehension. Lexical and syntactic
ambiguities are standardly assumed to involve different types of knowledge representations …

Mining frequent subgraphs is an important operation on graphs; it is defined as finding all
subgraphs that appear frequently in a database according to a given frequency threshold …