An Efficient Finite-Domain Constraint Solver in Beta-Prolog

スポンサーリンク

概要

• 論文の詳細を見る

• Beta-Prolog is an extended Prolog that provides the following two new facilities : (l) the definition and manipulation of Boolean tables, and (2) constant time update of arguments of compound terms. Boolean table is a natural and efficient data structure for representing graphs, situations in planning and domains in constraint satisfaction problems (CSPs). In this paper, we focus on how to solve CSPs in Beta-Prolog. We describe a finite-domain constraint solver on top of Beta-Prolog. For a CSP, domains of variables are represented as a Boolean table, domain variables and constraints are represented as compound terms. Because all the primitives on Boolean tables and compound terms can be performed in constant time, the constraint solver is quite efficient. For the benchmark programs, its performance is comparable with that of the CHIP system.

• 社団法人人工知能学会の論文
• 1994-03-01

著者

• Nagasawa I

  Kyusyu Inst. Technol. Iizuka-shi Jpn

• Zhou Neng-Fa

  Faculty of Computer Science and Systems Engineering, Kyushu Institute of Technology

• Nagasawa Isao

  Faculty of Computer Science and Systems Engineering, Kyushu Institute of Technology

• Zhou N‐f

  Kyushu Inst. Technol. Fukuoka Jpn

• Zhou Neng-fa

  Faculty Of Computer Science And Systems Engineering Kyushu Institute Of Technology

関連論文

• An Efficient Finite-Domain Constraint Solver in Beta-Prolog
• On Cooperative Search in Logic Programming

スポンサーリンク