SWI-Prolog
 | This article may rely excessively on sources too closely associated with the subject, potentially preventing the article from being verifiable and neutral. (June 2014) |
| Original author(s) | Jan Wielemaker |
|---|---|
| Developer(s) | Jan Wielemaker, Anjo Anjewierden, etc |
| Initial release | 1987 |
| Stable release | 9.2.2[1] 
/ 29 February 2024 |
| Preview release | 9.3.2
/ 29 February 2024 |
| Repository | |
| Written in | C, Prolog |
| Operating system | Cross-platform |
| Available in | English |
| Type | Logic programming |
| License | Simplified BSD, LGPL prior to version 7.3.33 |
| Website | swi-prolog |
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 runs on Unix, Windows, Macintosh and Linux platforms.
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 was employed when he initiated the development of SWI-Prolog.[2] The name of this group has changed to HCS (Human-Computer Studies).
Execution model[edit]
SWI-Prolog is not based on the Warren Abstract Machine execution model of Prolog.
Instead, it is based on an extended version of the ZIP virtual machine, a minimal virtual machine for Prolog implementing a simple language consisting of only seven instructions. SWI-Prolog-specific extensions aim at improving performance in several ways: ad hoc instructions are introduced to support unification, predicate invocation, some frequently used built-in predicates, arithmetic, control flow, and negation as failure. Prolog can easily be compiled into this language, and the abstract machine code is easily decompiled back into Prolog. This feature is often exploited to interleave compiled and interpreted code execution.[3]
Constraint logic programming[edit]
Constraint logic programming functionality came rather late in the lifetime of SWI-Prolog, because it lacked the basic support.[4] 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.[5]
Extensions for SWI-Prolog[edit]
SWI-Prolog installs with a web framework based on definite clause grammars.[6] SWI-Prolog queries may be distributed over several servers and web pages through the Pengines system.[7]
XPCE[edit]
XPCE is a platform-independent object-oriented[8] 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 mostly with Prolog. The development XPCE graphic toolkit started in 1987, together with SWI-Prolog. It supports buttons, menus, sliders, tabs and other basic GUI widgets. XPCE is available for all platforms supported by 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.
Interfaces[edit]
JPL is a bidirectional interface between Java and Prolog.[9] It requires both SWI-Prolog and Java SDK.[10] It is installed as a part of SWI-Prolog.
See also[edit]
References[edit]
- ^ "Release V9.2.2".
- ^ https://www.linkedin.com/in/jan-wielemaker-6a270a1b3/
- ^ Körner, Philipp; Leuschel, Michael; Barbosa, João; Costa, Vítor Santos; Dahl, Verónica; Hermenegildo, Manuel V.; Morales, Jose F.; Wielemaker, Jan; Diaz, Daniel; Abreu, Salvador; Ciatto, Giovanni (2022). "Fifty Years of Prolog and Beyond". Theory and Practice of Logic Programming. 22 (6): 776–858. doi:10.1017/S1471068422000102. hdl:10174/33387. ISSN 1471-0684.
This article incorporates text from this source, which is available under the CC BY 4.0 license.
- ^ 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.
- ^ Wielemaker, Jan; Huang, Zhisheng; van der Meij, Lourens (2008). "SWI-Prolog and the Web" (PDF). Theory and Practice of Logic Programming. 8 (3): 363–392. doi:10.1017/S1471068407003237. S2CID 5404048.
- ^ 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. S2CID 9949345.
- ^ Programming in XPCE/Prolog.
- ^ Paul Singleton; Fred Dushin; Jan Wielemaker (February 2004). "JPL: A bidirectional Prolog/Java interface". SWI-Prolog.
- ^ Paul Singleton (February 2004). "JPL 3.x installation". SWI-Prolog.
