Tools for constraint satisfaction
Eugene C. Freuder
Abstract
Eugene C. Freuder
Abstract
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many areas of artifical intelligence, from planning to natural language understanding. Constraint satisfaction can be very difficult. A variety of tools are available for promoting successful satisfaction.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many areas of artifical intelligence, from planning to natural language understanding. Constraint satisfaction can be very difficult. A variety of tools are available for promoting successful satisfaction.
Key concepts: Constraint satisfaction dual problem, Constraint satisfaction problem, Constraint satisfaction, Local consistency, Variety (cybernetics), Constraint logic programming, Constraint (computer-aided design), Backtracking