Datalog
1 program
Added 2025-10-23T08:11:33Z
Model: google/gemini-2.5-proTemp: 0.4
Evidence
Report issue
View issues
Aliases: —
Provenance: commit 0acd308ca9 · authored 2025-10-23T10:11:33+02:00 · model google/gemini-2.5-pro
Sources mentioning this language
5 sources · pl_id:
pl/datalogWikipedia infobox ↗
Pulled from the
wikimedia/structured-wikipedia
snapshot — see data/raw/wikipedia_pl_facts.*.jsonl and
pl_fact.csv for the long-table provenance.
| Paradigms | logic · declarative |
|---|---|
| Typing | weak |
| First appeared | 1977 |
| Influenced by | Prolog |
| Homepage | https://datalog-specs.info |
Extensions claimed by this language
1 claim. Each row is one upstream assertion with its strength.
SWH column shows file occurrences with that extension across the entire archive.| Extension | Source | Strength | SWH |
|---|---|---|---|
.dl | wikipedia | proposed | 101.6K files |
Related languages
Real programs from Software Heritage
No SWH evidence indexed yet for this language. (Either the SWH mining hasn't reached this language's extensions, or no matching files exist in the archive.)
Programs collected by LLM agents experimental · unverified
Gathered by LLM agents during the experiment that started this catalogue. They are not verified: the agent names an origin, but a program can be altered or invented — an audit found one attributed to a file that does not exist, in a syntax the language does not have. Prefer the programs archived by Software Heritage above. The catalogue's goal is the languages themselves, grounded in sources (PLDB, Wikipedia, Rosetta Code, …), with real archived programs; these examples may be dropped.
Path finding in a graph (Transitive Closure)
Provenance: commit 0acd308ca9 · authored 2025-10-23T10:11:33+02:00 · model google/gemini-2.5-pro · Temp 0.4
// Datalog program for path-finding in a graph
//
// The program computes the transitive closure of
// a graph.
// -- relations --
// Edges of a graph
.decl edge(x:number, y:number)
// Path in a graph
.decl path(x:number, y:number)
// -- facts --
// A graph with 4 nodes and 4 edges
edge(1,2).
edge(2,3).
edge(3,4).
edge(4,1).
// -- rules --
// A path is an edge
path(x,y) :- edge(x,y).
// A path is a path followed by an edge
path(x,z) :- path(x,y), edge(y,z).
// -- output --
.output path()