This article may rely excessively on sources too closely associated with the subject, potentially preventing the article from being verifiable and neutral. (June 2014) (Learn how and when to remove this template message)
|Original author(s)||Jan Wielemaker|
|Developer(s)||Jan Wielemaker, Anjo Anjewierden, etc|
7.6.4 / 12 January 2018
7.7.19 / 26 August 2018
|Written in||C, Prolog|
|License||Simplified BSD, LGPL prior to version 7.3.33|
SWI-Prolog is a free implementation of the programming language Prolog, commonly used for teaching and semantic web applications. It has a rich set of features, libraries for constraint logic programming, multithreading, unit testing, GUI, interfacing to Java, ODBC and others, literate programming, a web server, SGML, RDF, RDFS, developer tools (including an IDE with a GUI debugger and GUI profiler), and extensive documentation.
SWI-Prolog has been under continuous development since 1987. Its main author is Jan Wielemaker.
The name SWI is derived from Sociaal-Wetenschappelijke Informatica ("Social Science Informatics"), the former name of the group at the University of Amsterdam, where Wielemaker is employed. The name of this group has changed to HCS (Human-Computer Studies).
Through the Pengines system SWI-Prolog queries may be distributed over several servers and web pages.
XPCE is a platform independent object oriented GUI toolkit for SWI-Prolog, Lisp and other interactive and dynamically typed languages. Although XPCE was designed to be language-independent, it has gained popularity most with Prolog. The development XPCE graphic toolkit started in 1987, together with SWI-Prolog.
PceEmacs is a SWI-Prolog builtin editor. PceEmacs is an Emacs clone implemented in Prolog (and XPCE). It supports proper indentation, syntax highlighting, full syntax checking by calling the SWI-Prolog parser, warning for singleton variables and finding predicate definitions based on the source-information from the Prolog database.
Interface between Java and Prolog (JPL)
Constraint Logic Programming Libraries (CLP)
Constraint Logic Programming functionality came rather late in the lifetime of SWI-Prolog, because it lacked the basic support. This changed early in 2004 when attributed variables were added to the language. The Leuven CHR library was then the first CLP library to be ported to SWI-Prolog. We mention SWI-Prolog's INCLP(R) library (De Koninck et al. 2006), which provides non-linear constraints over the reals, and was implemented on top of CHR. Later came a port of Christian Holzbaur's CLP(QR) library, and a finite domain CLP(FD) solver. Finally a Boolean CLP(B) solver was added.
- Wielemaker, Jan; Huang, Zhisheng; van der Meij, Lourens (2008). "SWI-Prolog and the Web". Theory and Practice of Logic Programming. 8. doi:10.1017/S1471068407003237.
- Wielemaker, Jan; Lager, Torbjorn (14 May 2014). "Pengines: WebLogic Programming Made Easy". Theory and Practice of Logic Programming. 14 (special issue 4–5): 539–552. arXiv:1405.3953. doi:10.1017/S1471068414000192.
- Programming in XPCE/Prolog
- Jan Wielemaker, Tom Schrijvers, Markus Triska, Torbjörn Lager: SWI-Prolog. TPLP 12(1–2): 67–96 (2012)
- Markus Triska: The Boolean Constraint Solver of SWI-Prolog (System Description). FLOPS 2016: 45–61