Projects

SWI-Prolog

SWI-Prolog offers a comprehensive Free Software Prolog environment, licensed under the Lesser GNU Public License. Together with its graphics toolkit XPCE, its development started in 1987 and has been driven by the needs for real-world applications. These days SWI-Prolog is widely used in research ... [More] and education as well as for commercial applications. [Less]

GNU Prolog

GNU Prolog is a free implementation (under GPL) of the logic programming language PROLOG. It can compile to native machine code which is extremely fast in execution. Another feature is the included constraint solver.

YAP Prolog

YAP is a high-performance Prolog compiler.

15puzzle-prolog

This project is an university work for the discipline of Artificial Intelligence. It is a collection of algorithms to solve the 15 puzzle game, together with functions to compare them.

XSB

XSB is a Logic Programming and Deductive Database system for Unix and Windows. It is being developed at a number of institutions, including the Computer Science Department of Stony Brook University, Universidade Nova de Lisboa, XSB, Inc, Katholieke Universiteit Leuven, and Uppsala Universitet.

Logtalk

Logtalk is an object-oriented logic programming language that can use most Prolog implementations as a back-end compiler. As a multi-paradigm language, it includes support for both prototypes and classes, protocols (interfaces), component-based programming through category-based composition ... [More] , event-driven programming, and high-level multi-threading programming. [Less]

EulerSharp

Euler is an inference engine supporting logic based proofs. It is a backward-chaining reasoner enhanced with Euler path detection. It has implementations in Java, C#, Python, Javascript and Prolog. Via N3 it is interoperable with W3C Cwm.

scalalogic

IntroductionScalaLogic is a light-weight Prolog interpreter written in Scala. It can parse and execute Prolog code or it can write logic programs in a Prolog-like DSL language inside Scala. Emphasis is on simplicity, not performance. Most standard library predicates are not supported but can ... [More] easily be added. ExampleDefine the theory in the DSL language: val append = 'append val quicksort = 'quicksort val partition = 'partition val theory = scalog( //Quicksort quicksort(Nil, Nil), quicksort('HEAD ::'TAIL,'SORTED) := partition('HEAD,'TAIL,'LEFT,'RIGHT) & quicksort('LEFT,'SORTEDL) & quicksort('RIGHT,'SORTEDR) & append('SORTEDL,'HEAD ::'SORTEDR,'SORTED), //Partition partition('PIVOT, Nil, Nil, Nil), partition('PIVOT,'HEAD ::'TAIL,'HEAD::'LEFT,'RIGHT) :='HEAD < 'PIVOT & partition('PIVOT,'TAIL,'LEFT,'RIGHT), partition('PIVOT,'HEAD ::'TAIL,'LEFT,'HEAD ::'RIGHT) :='HEAD >= 'PIVOT & partition('PIVOT, 'TAIL, 'LEFT, 'RIGHT), //Append append(Nil, 'L, 'L), append('H ::'L1,'L2,'H ::'L3) := append('L1,'L2,'L3) )Execute a goal: val solutions = theory ?= quicksort(List(3,2,1,10,8,9,7,5,6,4,3,2,1,10,8,9,7,5,6,4,3), 'Sorted)Print each solution in the Stream: print(solutions) Sorted = [1,1,2,2,3,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10]. [Less]

ConceptBase.cc

ConceptBase is a multi-user deductive and object-oriented database system for metamodeling and method engineering. The system includes a graphical client that builds upon the logic-based features of the ConceptBase server. The data model is O-Telos.

interprolog

...but may come over in a while. GPL license is probably slightly different.