Open Source Prolog Software Development Software

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.

C#Prolog -- A Prolog interpreter written in C#. Can easily be integrated in C# programs. Characteristics: reliable and fairly fast interpreter, command line interface, Windows-interface, builtin DCG, XML- and JSON-predicates, SQL-predicates, extendible.

Logic Programming and Deductive Database system (Tabled Prolog) for Unix, Mac, and Windows.

Linguistic Tree Constructor (LTC) is a tool for drawing lingusitic syntax trees of already-existing text. It is a syntax editor, not a text editor, so the text has to exist already. It is best suited for large-scale, rapid creation of hand-annotated treebanks. The user can define their own node categories, and can label each node with labels, also definable by the user. LTC supports "generic", X-Bar and RRG trees. Supports interlinear texts in SIL SFM format.

Prosper is a web application development framework to augment Prolog applications with a web interface. It supports control flow in visual logic and promotes a clear separation of model from view.

Flora-2 is a powerful knowledge representation and reasoning system designed for building knowledge-intensive applications. It is based on F-logic, HiLog, Transaction Logic, and also supports defeasible reasoning. Applications include intelligent agents, Semantic Web, ontology management, and more. If you use Flora-2 and like it, please acknowledge it in your project!

The ECLiPSe Constraint Logic Programming System is designed for solving combinatorial optimization problems, for the development of new constraint solver technology and their hybrids, and for the teaching of modelling, solving and search techniques.

ADP (Another Data Processor) is a programing language that is designed for Web database programing. It is a scripting language and a lightweight programming language in which it is possible to mix SQL easily. It is easy to install. ADP is base on Prolog. But ADP uses only the backtrack and unification. The syntax is original and likes a another scripting language, supports method call.

JLog is a Prolog interpreter written in Java. It is fast and perfectly suited for education. It includes source editor, query panels, online help, animation primitives, and a GUI debugger. JScriptLog is Prolog in JavaScript.

A general purpose Java interface for Prolog implementations.

Regulus is a Prolog-based toolkit for building spoken dialogue systems.

Proshee is a Prolog type-inference system written in Prolog but depending on the banshee project in C (banshee.sourceforge.net). At present it manages very simple type-inference, but it has some problems with lists that need to be overcome.

The Yap Prolog System is a ISO-compatible high-performance Prolog compiler. Yap is widely considered one of the fastest available Prolog systems. Yap supports coroutining, CLP(QR), CHR, and depth-bound search. Tabling and parallelism are in development.

ConceptBase.cc is a multi-user deductive and object-oriented database system for metamodeling and method engineering. Includes a graphical client that builds upon the logic-based features of the ConceptBase.cc server. The data model is O-Telos. ConceptBase.cc can represent information at the data level (example data, traces of process executions etc.), the class level (schemas, process definitions etc.), the metaclass level (constructs of modeling languages), the meta-metaclass level (constructs for defining modeling languages), and so forth. ConceptBase.cc is developed by the ConceptBase Team at University of Skövde (HIS). ConceptBase.cc supports Linux, Mac OS X and Windows. ConceptBase.cc is free software distributed under a FreeBSD-style license.

The Generic Eclipse Modeling System is an MDD tool for Eclipse that allows for the rapid development of GEF modeling plugins. In GEMS, developers specify rules for a domain language using a metamodel and the tool generates a plugin for the specification

SLPG (Semiautomatic Logic Program generator) is an academic tool whose goal is to help unexperienced logic programmers to develop Prolog programs using a systematic methodology.

OpenPoplog is a multi-language, incrementally-compiled virtual machine-based development environment with its own extensive teaching and support material, supporting the languages Pop-11, Prolog, Common Lisp and ML on Unix, VMS, Linux and Windows.

OpenSHORE is an XML based Semantic Document Repository (SDR) with a free definable meta model that builds up a semantic network from sections and relations in documents. The acronym SHORE means Semantic Hypertext Object Repository.

Sun Profile Project.

XGP is an integrated development environment that extends GNU Prolog to work with Cocoa under Macintosh OS X. It provides user interface and graphics facilities largely compatible with MacProlog32 by LPA. Requires Mac OS X version 10.2.1 or greater.

s(ASP) is an implementation of the stable model semantics of logic programming. Unlike similar systems, it does not employ any form of grounding. This allows s(ASP) to execute programs that are not finitely groundable, including those which make use of lists and terms. Work on s(ASP) is supported by the National Science Foundation under Grant No. 1423419. Details of how s(ASP) works can be found in the following paper: Marple, Kyle, Elmer Salazar, and Gopal Gupta. "Computing Stable Models of Normal Logic Programs Without Grounding." arXiv preprint arXiv:1709.00501 (2017) (https://arxiv.org/abs/1709.00501).

A Practical Agent Programming Language

This project assembles the implementations of inference engines for CHORD, an object-oriented extension of CHRD.

Prolog compiler and interpreter for the .Net 2.0 framework.

Cedalion is a programming language that allows its users to add new abstractions and define (and use) internal DSLs. Its innovation is in the fact that it uses projectional editing to allow the new abstractions to have no syntactic limitations.