Source : Free On-Line Dictionary of Computing

Goedel
     
         (After the mathematician {Kurt Godel}) A
        {declarative}, general-purpose language for {artificial
        intelligence} based on {logic programming}.  It can be
        regarded as a successor to {Prolog}.  The {type system} is
        based on {many-sorted logic} with {parametric polymorphism}.
        Modularity is supported, as well as {infinite precision
        arithmetic} and {finite set}s.
     
        Goedel has a rich collection of system {modules} and provides
        {constraint} solving in several domains.  It also offers
        {metalogical} facilities that provide significant support for
        {metaprogram}s that do analysis, transformation, compilation,
        verification, and debugging.
     
        A significant subset of Goedel has been implemented on top of
        {SISCtus Prolog} by Jiwei Wang .
     
        {FTP Bristol, UK (ftp://ftp.cs.bris.ac.uk/goedel)}, {FTP K U
        Leuven (ftp://ftp.cs.kuleuven.ac.be/pub/logic-prgm/goedel)}.
     
        E-mail: .
     
        (1995-05-02)