clj-3df
clingo
clj-3df | clingo | |
---|---|---|
4 | 3 | |
326 | 586 | |
0.9% | 2.6% | |
0.0 | 7.9 | |
over 4 years ago | about 1 month ago | |
Clojure | C++ | |
Eclipse Public License 2.0 | MIT License |
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.
clj-3df
-
Learn Datalog Today
> Datomic has a notion of rules which are mostly syntax sugar and do not support this sort of recursive reasoning.
> Why is that a big deal? When rules are run automatically, you can build live, reactive systems, not just a database that sits around waiting for you to query it.
There was at least one serious attempt to bring these worlds together: https://github.com/sixthnormal/clj-3df
-
sixthnormal/clj-3df - pub/sub based on datalog and differential dataflow
It seems there's something of an update to the project status here: https://github.com/sixthnormal/clj-3df/issues/46 It's not actively maintained though there seems to be work on a successor product.
- Clj-3DF: Clojure(Script) Client for Declarative Dataflow
clingo
-
Learn Datalog Today
One of the easiest to get started on Datalog in my opinion is really clingo https://potassco.org/clingo/ , which can be pip installed and has python bindings. Answer Set Programming goes beyond datalog, but it holds datalog semantics as a sublanguage. It is unfortunate this is not well advertised.
```
-
Modern SAT solvers: fast, neat and underused (2018)
Love this article and the push to build awareness of what modern SAT solvers can do.
The thing it misses, though, is that there are higher level abstractions that are far more accessible than SAT. If I were teaching a course on this, I would start with either Answer Set Programming or Satisfiability Modulo Theories (SMT). The most widely used solvers for those are clingo [0] and Z3 [1]:
With ASP, you write in a much clearer Prolog-like syntax that does not require nearly as much encoding effort as your typical SAT problem. Z3 is similar -- you can code up problems in a simple Python API, or write them in the smtlib language.
Both of these make it easy to add various types of optimization, constraints, etc. to your problem, and they're much better as modeling languages than straight SAT. Underneath, they have solvers that leverage all the modern CDCL tricks.
We wrote up a paper [2] on how to formulate a modern dependency solver in ASP; it's helped tremendously for adding new types of features like options, variants, and complex compiler/arch dependencies to Spack [3]. You could not get good solutions to some of these problems without a capable and expressive solver.
[0] https://github.com/potassco/clingo
-
Ask HN: What is new in Algorithms / Data Structures these days?
Answer Set Programming is an incredibly powerful tool to declaratively solve combinatorial problems. Clingo is one of the best open source implementations in my opinion: https://github.com/potassco/clingo
What are some alternatives?
differential-dataflow - An implementation of differential dataflow using timely dataflow on Rust.
ezno - A JavaScript compiler and TypeScript checker written in Rust with a focus on static analysis and runtime performance
Decider - An Open Source .Net Constraint Programming Solver
libclc - Cache Line Container - C11
pub - The pub command line tool
highfleet-ship-opt - A c/c++ module and python extensions for automatic optimization of Highfleet ship modules. Try it live at https://hfopt.jodavaho.io
egglog - egraphs + datalog!
rfcs - RFC process for Bytecode Alliance projects