sturm
clingo
sturm | clingo | |
---|---|---|
2 | 3 | |
9 | 586 | |
- | 2.7% | |
10.0 | 7.5 | |
over 6 years ago | 7 days ago | |
Python | C++ | |
GNU General Public License v3.0 only | 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.
sturm
- My Kind of REPL
-
Modern SAT solvers: fast, neat and underused (2018)
FWIW, here's a little console-mode puzzle game of SAT problems, if you want to solve some manually. The "board" is not exactly like the example table in the post, since that one was for Sudoku in particular. This grid represents variables as rows and clauses as columns.
https://github.com/darius/sturm/blob/master/satgame.py (Python 2)
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?
pub - The pub command line tool
ezno - A JavaScript compiler and TypeScript checker written in Rust with a focus on static analysis and runtime performance
halp - Run programs in the Emacs buffer holding their source, seeing their output inline, interactively.
Decider - An Open Source .Net Constraint Programming Solver
spack - A flexible package manager that supports multiple versions, configurations, platforms, and compilers.
libclc - Cache Line Container - C11
z3 - The Z3 Theorem Prover
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