OnlineWoerterBuecher.de
Internes

Lexikon


Charme


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]. (1994-11-15)

In addition suitable contents:
[ = ] [ ag ] [ AI ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ B ] [ b ] [ ba ] [ backtracking ] [ bi ] [ Bull ] [ C ] [ ca ] [ Ch ] [ ch ] [ CHI ] [ CHIP ] [ ck ] [ co ] [ com ] [ combinator ] [ con ] [ cons ] [ constraint ] [ cr ] [ D ] [ de ] [ deterministic ] [ disc ] [ du ] [ ed ] [ edu ] [ er ] [ et ] [ fi ] [ file ] [ fr ] [ ge ] [ gi ] [ gr ] [ gu ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ int ] [ IP ] [ is ] [ it ] [ ki ] [ la ] [ language ] [ Lex ] [ li ] [ ly ] [ M ] [ ma ] [ man ] [ mil ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ na ] [ nc ] [ ng ] [ ni ] [ nn ] [ no ] [ nondeterminism ] [ nondeterministic ] [ ns ] [ nu ] [ om ] [ op ] [ ph ] [ pl ] [ pm ] [ pr ] [ Prolog ] [ query ] [ rc ] [ re ] [ rete ] [ ro ] [ row ] [ sc ] [ scheduling ] [ se ] [ si ] [ sm ] [ st ] [ su ] [ tg ] [ th ] [ to ] [ tr ] [ track ] [ tracking ] [ ua ] [ us ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (4939 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.1998 Seconds, with 17 Database-Queries
Zurück zur Startseite