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.

References in zbMATH (referenced in 48 articles , 1 standard article )

Showing results 1 to 20 of 48.
Sorted by year (citations)

1 2 3 next

  1. Girlando, Marianna; Lellmann, Björn; Olivetti, Nicola; Pesce, Stefano; Pozzato, Gian Luca: Calculi, countermodel generation and theorem prover for strong logics of counterfactual reasoning (2022)
  2. Azzolini, Damiano; Riguzzi, Fabrizio: Optimizing probabilities in probabilistic logic programs (2021)
  3. Giovanni Ciatto, Roberta Calegari, Andrea Omicini: 2P-Kt: A logic-based ecosystem for symbolic AI (2021) not zbMATH
  4. Julián-Iranzo, Pascual; Sáenz-Pérez, Fernando: Planning for an efficient implementation of hypothetical Bousi(\sim)Prolog (2021)
  5. Khan, Abdullah; Lisitsa, Alexei; Vernitski, Alexei: \textttGauss-lintel, an algorithm suite for exploring chord diagrams (2021)
  6. Nguembang Fadja, Arnaud; Riguzzi, Fabrizio; Lamma, Evelina: Learning hierarchical probabilistic logic programs (2021)
  7. Riguzzi, Fabrizio; Bellodi, Elena; Zese, Riccardo; Alberti, Marco; Lamma, Evelina: Probabilistic inductive constraint logic (2021)
  8. Robbins, Ed; King, Andy; Howe, Jacob M.: Backjumping is exception handling (2021)
  9. Cropper, Andrew; Morel, Rolf; Muggleton, Stephen: Learning higher-order logic programs (2020)
  10. Falomir, Zoe; Pich, Albert; Costa, Vicent: Spatial reasoning about qualitative shape compositions. Composing qualitative lengths and angles (2020)
  11. Angelopoulos, Nicos; Wielemaker, Jan: Advances in big data bio analytics (2019)
  12. Arias, Joaquín; Carro, Manuel: Evaluation of the implementation of an abstract interpretation algorithm using tabled CLP* (2019)
  13. Bergenti, Federico; Monica, Stefania: A subdivision algorithm to reason on high-degree polynomial constraints over finite domains (2019)
  14. Cropper, Andrew; Muggleton, Stephen H.: Learning efficient logic programs (2019)
  15. Di Franco, Anthony: Information-gain computation in the \textscFifthsystem (2019)
  16. Guidi, Ferruccio; Sacerdoti Coen, Claudio; Tassi, Enrico: Implementing type theory in higher order constraint logic programming (2019)
  17. Joana M. F. da Trindade, Konstantinos Karanasos, Carlo Curino, Samuel Madden, Julian Shun: Kaskade: Graph Views for Efficient Graph Analytics (2019) arXiv
  18. Nguembang Fadja, Arnaud; Riguzzi, Fabrizio: Lifted discriminative learning of probabilistic logic programs (2019)
  19. Ślażyński, Mateusz; Abreu, Salvador; Nalepa, Grzegorz J.: Generating local search neighborhood with synthesized logic programs (2019)
  20. Tarau, Paul; Wielemaker, Jan; Schrijvers, Tom: Lazy stream programming in prolog (2019)

1 2 3 next