DL∃! gives every Datalog fact a unique nested identity, and the Slog engine uses that restriction to evaluate tree-structured rules in parallel, often faster than existing Datalog systems.
Nemo: First Glimpse of a New Rule Engine
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
This system demonstration presents Nemo, a new logic programming engine with a focus on reliability and performance. Nemo is built for data-centric analytic computations, modelled in a fully declarative Datalog dialect. Its scalability for these tasks matches or exceeds that of leading Datalog systems. We demonstrate uses in reasoning with knowledge graphs and ontologies with 10^5 to 10^8 input facts, all on a laptop. Nemo is written in Rust and available as a free and open source tool.
fields
cs.DB 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Datalog with First-Class Facts
DL∃! gives every Datalog fact a unique nested identity, and the Slog engine uses that restriction to evaluate tree-structured rules in parallel, often faster than existing Datalog systems.