DocumentCode :
3303214
Title :
CHIP in plain logic
Author :
Levy, M.R. ; Van Emden, M.H.
Author_Institution :
Dept. of Comput. Sci., Victoria Univ., BC, Canada
Volume :
2
fYear :
1993
fDate :
19-21 May 1993
Firstpage :
742
Abstract :
The programming language Prolog allows succinct representation of a wide variety of scheduling problems. To speed up execution, a new version called CHIP (Constraint Handling In Prolog) was introduced that maintains the programming advantages of Prolog. CHIP achieves its speed by keeping track of the sets of possible values for each variable. In this way, a search can be abandoned as soon as any such set becomes empty. This mechanism is made part of the unification algorithm. CHIP maintains the conventional orientation of logic towards single values. Thus, an awkward theoretical structure results from interfacing with set orientation in unification. This problem is solved by using a set-orientation for the entire logic
Keywords :
PROLOG; constraint handling; scheduling; search problems; set theory; CHIP; Constraint Handling In Prolog; logic; scheduling problems; search; set orientation; unification algorithm; Assembly; Computer languages; Computer science; Educational institutions; Hospitals; Job shop scheduling; Laboratories; Logic programming; Processor scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, Computers and Signal Processing, 1993., IEEE Pacific Rim Conference on
Conference_Location :
Victoria, BC
Print_ISBN :
0-7803-0971-5
Type :
conf
DOI :
10.1109/PACRIM.1993.407254
Filename :
407254
Link To Document :
بازگشت