Work

Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs

Year: 2005

Type: conference-paper

Abstract: A Constraint Satisfaction Problem (CSP) is a combinatorial decision problem defined by a set of variables, a set of domain values for these variables, and a set of constraints restricting the allowable combinations of values for variables, where the task is to find a solution (i.e., an assignment of a value to each variable satisfying all constraints), or to find all such solutions. Neighborhood Interchangeability and Dynamic Bundling for Non-binary CSPs S c d, e, f

Source: Lincoln (University of Nebraska)

Authors: Anagh Lal, Berthe Y. Choueiry, Eugene C. Freuder

Institutions: University of Nebraska–Lincoln, University College Cork

Language: English

Topic: Constraint Satisfaction and Optimization

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Science Foundation Ireland

Awards: Constraint Computation: Automation and Application, G6671297155, CAREER: Detecting Interchangeability Relations in Constraint Satisfaction Problems and Exploiting them in Problem Solving and Interactions with Users

OpenAlex ID: W2128529792

FWCI: 1.501

Cites: 22

Cited by: 17

Related to: 10