souffle
pycozo
Our great sponsors
souffle | pycozo | |
---|---|---|
11 | 2 | |
861 | 37 | |
2.6% | - | |
7.6 | 6.9 | |
24 days ago | 5 months ago | |
C++ | Python | |
Universal Permissive License v1.0 | Mozilla Public License 2.0 |
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.
souffle
-
A Logic Language for Distributed SQL Queries
> In fact, we could have used Datalog to achieve our data goals — but that would mean we have to build our own Datalog implementation, backing data store, etc. We don’t want to do that.
Surprising that creating a whole new language made more sense then a backend. I wonder if they did a proof of concept with an existing logic system like Souffle¹ or Rel² first.
¹ https://github.com/souffle-lang/souffle
² https://relational.ai/blog/rel
-
Using_Prolog_as_the_AST
Consider using Datalog (the incredible subset of Prolog) for this perfect use case. Compared to Prolog, you get:
1. Free de-duplication. No more debugging why a predicate is returning the same result more than once.
2. Commutativity. Order of predicates does not change the result. Finally, true logic programming!
3. Easy static analysis. There are many papers that describe how to do points-to analysis (and other similar techniques) with Datalog rules that fit on a single page :O
Souffle[0] is a mature Datalog that is highly performant and has many nice features. I highly recommend playing with it!
[0] https://souffle-lang.github.io
-
If given a list of properties/definitions and relationship between them, could a machine come up with (mostly senseless, but) true implications?
Still, there are many useful tools based on these ideas, used by programmers and mathematicians alike. What you describe sounds rather like Datalog (e.g. Soufflé Datalog), where you supply some rules and an initial fact, and the system repeatedly expands out the set of facts until nothing new can be derived. (This has to be finite, if you want to get anywhere.) In Prolog (e.g. SWI Prolog) you also supply a set of rules and facts, but instead of a fact as your starting point, you give a query containing some unknown variables, and the system tries to find an assignment of the variables that proves the query. And finally there is a rich array of theorem provers and proof assistants such as Agda, Coq, Lean, and Twelf, which can all be used to help check your reasoning or explore new ideas.
-
Introduction to Datalog
It's true that this SPARQL-inspired view of Datalog as a triplestore query language is quite a narrow interpretation compared to something closer to the academic Prolog roots like https://souffle-lang.github.io/ - what do you feel are the most important differences?
- Systematic, Ontological, Undiscovered Fact Finding Logic Engine
- Soufflé • a Datalog Synthesis Tool for Static Analysis
-
Show HN: Cozo – new Graph DB with Datalog, embedded like SQLite, written in Rust
Very cool! I love the sqlite install everywhere model.
Could you compare use case with Souffle? https://souffle-lang.github.io/
I'd suggest putting the link to the docs more prominently on the github page
Is the "traditional" datalog `path(x,z) :- edge(x,y), path(y,z).` syntax not pleasant to the modern eye? I've grown to rather like it. Or is there something that syntax can't do?
I've been building a Datalog shim layer in python to bridge across a couple different datalog systems https://github.com/philzook58/snakelog (including a datalog built on top of the python sqlite bindings), so I should look into including yours
-
Ask HN: What are some interesting examples of Prolog?
TerminusDB CTO here.
Echoing what triska said, CLP(ℤ) and friends are some of the most under-appreciated aspects of prolog implementations.
I'm amazed that programmers still don't have access to CLP when trying to do scheduling and planning solutions.
As an example in practice, what if you want to know about a transaction in which a number of entities transitively had holdings in one of the beneficiaries of the transaction at that particular time. The date window is not known, and the date windows are important in the ownership chain as well as the transactions that are being undertaken.
With CLP(FD) you can ask for a window of time, and the solution will zoom in on an appropriate time window which exists for the entire chain and match the time of the transaction.
Now try to do this query in SQL. It's almost impossibly hard.
I can't wait until I have the time to implement constraint variables for TerminusDB, but at the minute we are still working on more prosaic features.
Aside from that there are very interesting program correctness and optimisation systems which are based on prolog (usually a datalog). For instance Soufflé: https://souffle-lang.github.io
-
is it possible to have a reversable operation
No problem :) What do you mean by voice control systems? Prolog has a bit of a learning curve and it's very difficult to write efficient code in. Although it did inspire Erlang, which is used in telecom and has some pretty interesting advantages not offered by other languages (reliance, multithreading, and updating without shutting down) Prolog is also pretty procedural, (the order you declare clauses in really really matters). There are other languages that use a much more pure for of logic Datalog: https://en.wikipedia.org/wiki/Datalog https://souffle-lang.github.io/
pycozo
-
Show HN: CozoDB, Hybrid Relational-Graph-Vector DB, the Hippocampus for LLMs
I have been thinking about adding FTS to CozoDB for a long time but resisted the temptation so far. The reason is that text search is language-specific: what works for one language does not work for another. There is simply no way that CozoDB can duplicate the work of a dedicated text search engine for all the languages in the world.
Our current solution is to use mutation callbacks to synchronize texts to a dedicated text search engine. This is language specific: for example, for python: https://github.com/cozodb/pycozo#mutation-callbacks , and for Rust: https://docs.rs/cozo/latest/cozo/struct.Db.html#method.regis...
-
Show HN: Cozo – new Graph DB with Datalog, embedded like SQLite, written in Rust
For folks looking for documentation or getting started-examples, see:
- The tutorial: https://nbviewer.org/github/cozodb/cozo-docs/blob/main/tutor...
- The language documentation: https://cozodb.github.io/current/manual/
- The pycozo library README for some examples on how to run this from inline python: https://github.com/cozodb/pycozo#readme
What are some alternatives?
cozo - A transactional, relational-graph-vector database that uses Datalog for query. The hippocampus for AI!
differential-datalog - DDlog is a programming language for incremental computation. It is well suited for writing programs that continuously update their output in response to input changes. A DDlog programmer does not write incremental algorithms; instead they specify the desired input-output mapping in a declarative manner.
snakelog - A Datalog Framework for Python
copl-in-prolog - 書籍「プログラミング言語の基礎概念」の Prolog による実装
datascript - Immutable database and Datalog query engine for Clojure, ClojureScript and JS
libredwg - Official mirror of libredwg. With CI hooks and nightly releases. PR's ok
crepe - Datalog compiler embedded in Rust as a procedural macro
sonic - 🦔 Fast, lightweight & schema-less search backend. An alternative to Elasticsearch that runs on a few MBs of RAM.
blog - Some notes on things I find interesting and important.