LYCOS RETRIEVER
Prolog: Gnu Prolog
built 656 days ago
GNU Prolog is a free Prolog compiler with constraint solving over finite domains. GNU Prolog accepts a Prolog+constraint program and produces a native binary (like gcc does from a C source). The obtained executable is then stand-alone. The size of this executable can be quite small since GNU Prolog can avoid to link the code of most unused built-in predicates. The performances of GNU Prolog are very encouraging (comparable to commercial systems).
Source:
A particularly interesting aspect of GNU Prolog is that it includes support for finite domains. The idea of this is that it introduces variables that can only take finite integer ranges as their domains. The domain is reduced as constraints are introduced. This can
Source:
GNU Prolog ... includes an efficient constraint solver over Finite Domains (FD). This opens contraint logic pogramming to the user combining the power of constraint programming to the declarativity of logic programming.
Source:
The PrologTab is an integration of GNU Prolog for Java with Protege-2000. Slot relations in Protege are represented as facts within Prolog. Access to underlying Java interfaces is achieved through built-in predicates and the use of Java reflection. The tab ... allows management of Prolog sources through special frames within the Protege knowledge base.
Source:
The GNU Prolog compiler is based on the Warren Abstract Machine (WAM). It first compiles a Prolog program to a WAM file which is then translated to a low-level machine independent language called mini-assembly specifically designed for GNU Prolog. The resulting file is then translated to the assembly language of the target machine (from which an object is obtained). This allows GNU Prolog to produce a native stand alone executable from a Prolog source (similarly to what does a C compiler from a C program). The main advantage of this compilation scheme is to produce native code and to be fast. Another interesting feature is that executables are small.
Source: