Live briefing
Everything about Comparison of Prolog implementations
The following comparison of Prolog implementations provides a reference for the relative feature sets and performance of different implementations of the Prolog computer programming language. A comprehensive discussion of the most significant Prolog systems is presented in an article published in the 50-years of Prolog anniversary issue of the journal Theory and Practice of Logic Programming (TPLP). Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Comparison of Prolog implementationsA 5-minute orientation
- Read the landmark paper: A comparative feature-analysis of microcomputer prolog implementationsCited 5 times
- Go sideways: PrologA closely related topic
- Go sideways: LogtalkA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Open Library didn't respond; try again in a moment.
đź”— Related topics
- Prolog Prolog is a logic programming language that has its origins in artificial intelligence, automated theorem proving, and computational linguistics. Prolog…
- Logtalk Logtalk is an object-oriented logic programming language that extends and leverages the Prolog language with a feature set suitable for programming in…
- Quintus Prolog Quintus Prolog is a proprietary implementation of the Prolog programming language based on the Warren Abstract Machine. Originally developed by Quintus…
- SICStus Prolog SICStus Prolog is a proprietary, ISO-conforming implementation of the logic programming language Prolog. It is developed by the Swedish Institute of Computer…
- SWI-Prolog SWI-Prolog is a free implementation of the programming language Prolog, commonly used for teaching and semantic web applications. It has a rich set of…
- CLP(R) CLP(R) is a declarative programming language. It stands for constraint logic programming (real) where real refers to the real numbers. It can be considered…
- Tabled logic programming Tabling is a technique first developed for natural language processing, where it was called Earley parsing. It consists of storing in a table (a.k.a. chart…
- Occurs check In computer science, the occurs check is a part of algorithms for syntactic unification. It causes unification of a variable V and a structure S to fail…