ScholarLens Back to search
2003•Chinese Journal of ComputersRequires access

Solving Non-Binary Constraint Satisfaction Problem

Sun Ji

Open publisher page 8 citations

Abstract

Most of the research on constraint satisfaction problems (CSPs) concentrates on binary constraints, however, non-binary constraints appear quite frequently when modeling real problems. In this paper, on the basis of summarizing two kinds of approaches on solving non-binary CSPs, we study a non-binary CSP method which combines constraint propagation with GAC backtracking algorithm, and implement it in our Constraint Solving Platform “MingYue (1.0 version)”. For some typical examples, we also give experimental results.

About this research paper

What this paper is about

Most of the research on constraint satisfaction problems (CSPs) concentrates on binary constraints, however, non-binary constraints appear quite frequently when modeling real problems. In this paper, on the basis of summarizing two kinds of approaches on solving non-binary CSPs, we study a non-binary CSP method which combines constraint propagation with GAC backtracking algorithm, and implement it in our Constraint Solving Platform “MingYue (1.0 version)”. For some typical examples, we also give experimental results.

Why it matters

OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Most of the research on constraint satisfaction problems (CSPs) concentrates on binary constraints, however, non-binary constraints appear quite frequently when modeling real problems. In this paper, on the basis of summarizing two kinds of approaches on solving non-binary CSPs, we study a non-binary CSP method which combines constraint propagation with GAC backtracking algorithm, and implement it in our Constraint Solving Platform “MingYue (1.0 version)”. For some typical examples, we also give experimental results.

Key concepts: Backtracking, Constraint satisfaction problem, Binary constraint, Constraint satisfaction, Constraint satisfaction dual problem, Binary number, Constraint (computer-aided design), Local consistency

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Solving Non-Binary Constraint Satisfaction Problem — Research Paper | ScholarLens