A Framework for Dynamic Constraint Reasoning using Procedural Constraints

Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consistency of the associated constraint problem instance. The underlying constraint problems are invariably dynamic, as higher level decisions result in variables, values, and constraints being addedand removed. In real-world reasoning applications, constraints may be arbitrarily complex, variables may have continuous domains, and neither variables nor values may be effectively enumerable beforehand. Such applications, therefore, present a number of significant challenges for a dynamic constraint reasoning mechanism. In this paper, we introduce a general framework for representing and reasoning about dynamic constraint networks arising from complex real-world applications. It is based on the use of procedures to represent and effectively reason about general constraints. The framework can handle arbitrary changes...

• Type: Conference
• Year: 2000
• Where: ECAI
• Authors: Ari K. Jónsson, Jeremy Frank
• Keywords: Artificial Intelligence, Constraint Problems, Constraint Reasoning, Constraint Reasoning Problem, ECAI 2000