SWI-Prolog
SWI-Prolog. SWI-Prolog is neither a commercial Prolog system nor a purely academic enterprise, but increasingly a community project. The core system has been shaped to its current form while being used as a tool for building research prototypes, primarily for knowledge-intensive and interactive systems. Community contributions have added several interfaces and the constraint (CLP) libraries. Commercial involvement has created the initial garbage collector, added several interfaces and two development tools: PlDoc (a literate programming documentation system) and PlUnit (a unit testing environment). In this article, we present SWI-Prolog as an integrating tool, supporting a wide range of ideas developed in the Prolog community and acting as glue between foreign resources. This article itself is the glue between technical articles on SWI-Prolog, providing context and experience in applying them over a longer period.
Keywords for this software
References in zbMATH (referenced in 37 articles , 1 standard article )
Showing results 1 to 20 of 37.
Sorted by year (- Cropper, Andrew; Morel, Rolf; Muggleton, Stephen: Learning higher-order logic programs (2020)
- Falomir, Zoe; Pich, Albert; Costa, Vicent: Spatial reasoning about qualitative shape compositions. Composing qualitative lengths and angles (2020)
- Arias, Joaquín; Carro, Manuel: Evaluation of the implementation of an abstract interpretation algorithm using tabled CLP* (2019)
- Bergenti, Federico; Monica, Stefania: A subdivision algorithm to reason on high-degree polynomial constraints over finite domains (2019)
- Cropper, Andrew; Muggleton, Stephen H.: Learning efficient logic programs (2019)
- Di Franco, Anthony: Information-gain computation in the \textscFifthsystem (2019)
- Guidi, Ferruccio; Sacerdoti Coen, Claudio; Tassi, Enrico: Implementing type theory in higher order constraint logic programming (2019)
- Joana M. F. da Trindade, Konstantinos Karanasos, Carlo Curino, Samuel Madden, Julian Shun: Kaskade: Graph Views for Efficient Graph Analytics (2019) arXiv
- Nguembang Fadja, Arnaud; Riguzzi, Fabrizio: Lifted discriminative learning of probabilistic logic programs (2019)
- Rodosthenous, Christos T.; Michael, Loizos: Web-STAR: A visual web-based IDE for a story comprehension system (2019)
- Wielemaker, Jan; Riguzzi, Fabrizio; Kowalski, Robert A.; Lager, Torbjörn; Sadri, Fariba; Calejo, Miguel: Using SWISH to realize interactive web-based tutorials for logic-based languages (2019)
- Bergenti, Federico; Monica, Stefania; Rossi, Gianfranco: Constraint logic programming with polynomial constraints over finite domains (2018)
- Muggleton, Stephen; Dai, Wang-Zhou; Sammut, Claude; Tamaddoni-Nezhad, Alireza; Wen, Jing; Zhou, Zhi-Hua: Meta-interpretive learning from noisy images (2018)
- Pakin, Scott: Performing fully parallel constraint logic programming on a quantum annealer (2018)
- Bergenti, Federico; Monica, Stefania: Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form (2017)
- Lierler, Yuliya; Susman, Benjamin: On relation between constraint answer set programming and satisfiability modulo theories (2017)
- Riguzzi, Fabrizio; Cota, Giuseppe; Bellodi, Elena; Zese, Riccardo: Causal inference in cplint (2017)
- Seki, Hirohisa: On dual programs in co-logic programming and the Horn (\mu)-calculus (2017)
- Shakerin, Farhad; Salazar, Elmer; Gupta, Gopal: A new algorithm to automate inductive learning of default theories (2017)
- Tenorth, Moritz; Beetz, Michael: Representations for robot knowledge in the \textscKnowRobframework (2017)