Charme

<language, logic, Bull, nondeterminism> A language with discrete combinatorial constraint logic aimed at industrial problems such as planning and scheduling. Implemented in C at Bull in 1989.

Charme is an outgrowth of ideas from CHIP. It is semantically nondeterministic, with choice and backtracking, similar to Prolog.

["Charme Reference Manual", AI Development Centre, Bull, France 1990].

Last updated: 1994-11-15

Try this search on Wikipedia, OneLook, Google

Nearby terms:

Charles Simonyi « CHARM « CHARM++ « Charme » CHARYBDIS » chase pointers » CHASM

Loading