Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Programming Language

SWI-Prolog

Logic Language

SWI-Prolog is a free implementation of the Prolog logic programming language, widely used for teaching and for semantic web applications. Its main author is Jan Wielemaker, who began the work in 1987 at the University of Amsterdam; the SWI in the name abbreviates the Dutch Sociaal-Wetenschappelijke Informatica, the former name of his research group there. It runs on Unix, Linux, Windows and Macintosh systems and ships with a large library collection: constraint logic programming solvers (CHR, CLP(FD), CLP(B) and CLP(QR)), multithreading, unit testing, a web server, RDF and SGML parsing, a GUI toolkit called XPCE, a Java bridge named JPL and developer tools with a graphical debugger and profiler. Unlike many Prolog systems it does not use the Warren Abstract Machine; it executes code on an extended ZIP virtual machine with only a handful of instructions, which lets compiled and interpreted code interleave. Its Pengines system lets queries be distributed across servers and web pages.

Facts
First Released
1987 1
Primary Use Domain
Education 2
Execution Model
Bytecode VM 2
Connections

Influenced By

Source SWI-Prolog (Wikipedia)

Licensed Under

Source SWI-Prolog: SWI-Prolog features
Sources
1. Programming Language Database (PLDB): SWI Prolog (PLDB)
Programming Language Database (PLDB)Lead
Quote, Lead
SWI Prolog is a programming language created in 1987.
View the Source
2. SWI-Prolog (Wikipedia)
  • Lead
    SWI-Prolog has been under continuous development since 1987.
  • Execution model
    it is based on an extended version of the ZIP virtual machine
  • Lead, primary use domain
    commonly used for teaching and semantic web applications
View the Source
SWI-Prolog: SWI-Prolog features
SWI-PrologLicensed Under: BSD 2-Clause License, Legal
Quote, Licensed Under: BSD 2-Clause License, Legal
also known as the BSD-2 license
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.