clpz
elpi
Our great sponsors
clpz | elpi | |
---|---|---|
5 | 4 | |
172 | 260 | |
- | 1.9% | |
4.4 | 8.5 | |
3 months ago | 3 days ago | |
Prolog | Prolog | |
- | GNU Lesser General Public License v3.0 only |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
clpz
-
Logic programming is overrated, at least for logic puzzles (2013)
As pointed out in the comments in the article, these kinds of logic puzzles are easier to solve using constraint programming than "regular" logic programming.
For example, see the solution to the Zebra Puzzle here: https://www.metalevel.at/prolog/puzzles which uses CLPZ[^1].
[^1]: https://github.com/triska/clpz
-
Markus Triska Interview on Prolog
Scryer has the strings-as-lists-but-implemented-efficiently thing, possibly more strict ISO Prolog compatible syntax, and it may ship with a more advanced constraint library (I'm not clear on the relationship between SWI's clpfd and Scryer clpz).
-
is it possible to have a reversable operation
None of these are full-fledged programming languages, however. They're limited to problems that lie in the polynomial hierarchy (A class which contains P and NP). Logic programming is generally only used to solve hard problems for which no good algorithm is known. Prolog also sort of fits this niche and it has a bunch of solvers integrated into it. Notably CLPFD which uses https://github.com/triska/clpz for constraint logic programming. Rosette (https://docs.racket-lang.org/rosette-guide/index.html) is another solver-based language. Except it uses lisp syntax (it's embedded in the Racket language). It uses Z3 as a solver (linked above for SMT theories)
- Ask HN: Do you use an optimization solver? Which one? Why? Do you like it?
-
What is the difference between constraint solving and constraints programming?
Constraint programming I guess is when one uses a prolog library such as: https://github.com/triska/clpz
elpi
-
Prototyping a Functional Language using Higher-Order Logic Programming
Also relevant, Elpi, which is used as an embedded lambda-Prolog inside Coq for metaprogramming.
-
Julia is missing 'pycall' for Rust
While elpi lambda prolog is a lot nicer feature-wise (e.g. it offers higher logic subsets) and also includes simple constraints, Scyer prolog is faster and includes more features.
-
Are there any OS projects of any substantial size at all that have been written in λProlog?
I've tried looking but can't find any besides the implementation repos themselves; specifically ELPI and Teyjus
- Would a type system be superfluous in Prolog?
What are some alternatives?
prolog-checkers - A Player vs AI game of checkers implemented in Prolog
fastcode - A unique blend of C, Java, and Python tailored for those who desire a simple yet powerful programming language.
HiGHS - Linear optimization software
jlrs - Julia bindings for Rust
SSI - A Prolog Compiler written in Prolog.
scryer-prolog - A modern Prolog implementation written mostly in Rust.
kanren - An extensible, lightweight relational/logic programming DSL written in pure Python
teyjus - An efficient implementation of the higher-order logic programming language Lambda Prolog
or-tools - Google's Operations Research tools:
ciao - Ciao is a modern Prolog implementation that builds up from a logic-based simple kernel designed to be portable, extensible, and modular.
csips - A pure-python integer programming solver
optaplanner-quickstarts - Mirror of https://github.com/apache/incubator-kie-optaplanner-quickstarts