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, event-driven programming, and high-level multi-threading programming.
Prolog Statistical Machine Translation is a fairly unsophisticated statistical machine translation program. It consists of a language model learner (which takes example sentences in the target language and learns a language model based on trigrams), a dictionary learner (which learns word-for-word translations), and a search program (which uses the data from the first two parts to translate a source sentence into the target language).
YProlog is a pocket Prolog engine written in 100% Java. It provides a number of fast and easy Java-Prolog interfacing functions that enables the Prolog database to be used like an SQL-type database. It has fast consult and retract operations, can "serialize" database contents into text, and can easily load and store tables or contents of Java objects. It is based on Jean Vaucher's XProlog.
Simsttab (which stands for "Simplistic School Time-Tabler") is a timetabling engine that can generate timetables satisfying requirements typical for secondary schools in Austria ("Gymnasium"-type), Germany, and maybe other European countries. It supports coupling of lessons and rudimentary room reservation.
GPP is a general-purpose preprocessor with customizable syntax, suitable for a wide range of preprocessing tasks. Its independence from any programming language makes it much more versatile than cpp, while its syntax is lighter and more flexible than that of m4. The syntax is fully customizable, which makes it possible to process text files, HTML, or source code equally efficiently in a variety of languages.
DELORES (DEfeasible LOgic REasoning System) is a forward-chaining reasoning engine for defeasible logic, a less-expressive but more efficient non-monotonic logic. In contrast with most other non-monotonic logics, defeasible logic has linear complexity, allowing DELORES to execute large theories very quickly. DELORES's algorithm extends to general defeasible theories through the use of a pre-processing transformation which eliminates all uses of defeaters and superiority relations.