GNU Prolog is a free Prolog compiler with constraint solving over finite domains developed by Daniel Diaz. GNU Prolog accepts Prolog+constraint programs and produces native binaries (like gcc does from a C source). The obtained executable is then stand-alone. The size of this executable can be quite small since GNU Prolog can avoid to link the code of most unused built-in predicates. The performances of GNU Prolog are very encouraging (comparable to commercial systems). Beside the native-code compilation, GNU Prolog offers a classical interactive interpreter (top-level) with a debugger. The Prolog part conforms to the ISO standard for Prolog with many extensions very useful in practice (global variables, OS interface, sockets,...). GNU Prolog also includes an efficient constraint solver over Finite Domains (FD). This opens contraint logic programming to the user combining the power of constraint programming to the declarativity of logic programming.

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

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

1 2 3 next

  1. Nabli, Faten; Martinez, Thierry; Fages, François; Soliman, Sylvain: On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity (2016)
  2. Fernández, Maribel: Programming languages and operational semantics. A concise overview (2014)
  3. Nugues, Pierre M.: Language processing with Perl and Prolog. Theories, implementation, and application (2014)
  4. Schrijvers, Tom; Demoen, Bart; Triska, Markus; Desouter, Benoit: Tor: modular search with hookable disjunction (2014)
  5. Bramer, Max: Logic programming with Prolog (2013)
  6. Costa, Vítor Santos; Rocha, Ricardo; Damas, Luís: The YAP prolog system (2012)
  7. Diaz, Daniel; Abreu, Salvador; Codognet, Philippe: On the implementation of GNU Prolog (2012)
  8. Morales, Jose F.; Haemmerlé, Rémy; Carro, Manuel; Hermenegildo, Manuel V.: Lightweight compilation of (C)LP to JavaScript (2012)
  9. Saeedloei, Neda; Gupta, Gopal: Coinductive constraint logic programming (2012)
  10. Sfiris, D.S.; Papadopoulos, B.K.: Fuzzy estimators in expert systems (2012)
  11. Tarau, Paul: The BinProlog experience: architecture and implementation choices for continuation passing Prolog and first-class logic engines (2012)
  12. Triska, Markus: The finite domain constraint solver of SWI-prolog (2012)
  13. Zombori, Zsolt; Szeredi, Péter: Loop elimination, a sound optimisation technique for PTTP related theorem proving (2012)
  14. Wang, Peter; Somogyi, Zoltan: Minimizing the overheads of dependent AND-parallelism (2011)
  15. Bardin, Sébastien; Herrmann, Philippe; Perroud, Florian: An alternative to SAT-based approaches for bit-vectors (2010)
  16. Bitter, Christian; Elizondo, David A.; Yang, Yingjie: Natural language processing: a prolog perspective (2010)
  17. Maier, Frederick; Nute, Donald: Well-founded semantics for defeasible logic (2010)
  18. Munakata, Toshinori; Barták, Roman: Logic programming for combinatorial problems (2010)
  19. Snow, Zachary: Realizing the dependently typed $\lambda$-calculus (2010)
  20. Dovier, Agostino; Formisano, Andrea; Pontelli, Enrico: An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems (2009)

1 2 3 next