Premium
Embed finite domain constraint programming into Java and some Web‐based applications
Author(s) -
Loia Vincenzo,
Quaggetto Michel
Publication year - 1999
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/(sici)1097-024x(19990410)29:4<311::aid-spe236>3.0.co;2-x
Subject(s) - computer science , programming language , constraint programming , java , domain (mathematical analysis) , inductive programming , constraint (computer aided design) , programming domain , real time java , programming paradigm , functional logic programming , constraint satisfaction , object oriented programming , theoretical computer science , artificial intelligence , mathematical optimization , mathematics , mathematical analysis , geometry , probabilistic logic , stochastic programming
Although constraint programming has attracted much attention in logic programming, nowadays the importance to integrate constraints with imperative programming is widely acknowledged. In particular, in artificial intelligence domains, the benefits deriving from merging constraint‐based programming with object‐oriented paradigms seem to be still more attractive because of the lack of ‘pure’ AI languages in supporting structured representations. This work presents the extension of the Java language towards finite domain constraint programming. This extension has been possible thanks to a high‐level approach to low‐level resource management: the sleeper mechanism. As practical results, this paper shows how Java programmers can develop meaningful applications in which finite domain constraints have been extensively used, as in the design of visual, interactive, user‐interface environments in a client–server architecture. Copyright © 1999 John Wiley & Sons, Ltd.