Finite-domain Constraint Programming in Beta-Prolog

概要

論文の詳細を見る
Introducing finite-domain constraint solving techniques Prolog is one of the most important extension of Prolog. It enables tile programmer to describe a variety of combnatorial problems declaratively and the system to solve tlicm efficiently. There are two main approaches to introducing flaite-doinain constraint solving techaiques hito Prolog. One is adopted in the CHIP system. which cxtends the milfication operation to handle domain variables and the coinputatimi rule of Prolog to support coroutilling. The other approach is to jinpicinent filute-dolijaili constraint solver oil top of Prolog. Compared with the former appreach, the hitter is simple. It does not need imeplicatedabstract machines alid compilers, aid geiierally do not causeany overhead to the Prolog systinil. However. it is not different inough because Prolog does not provide efficient datastructures for represcutilig and handling domains, domahivariables, and constraints.
一般社団法人情報処理学会の論文
1993-03-01