{
  "Name": "french_cities",
  "Title": "French cities — ARC style graph reachability example.",
  "SourceFile": "examples/n3/french_cities.n3",
  "SourceSHA256": "9e7629d24e5f4dd73a4bb9c036cf5a8e00270bd850095a3b36b6a2e47717fbe2",
  "Description": "Based on https://raw.githubusercontent.com/eyereasoner/eyeling/refs/heads/main/examples/french-cities.n3\nThis example shows how simple graph rules can answer a practical travel-style\nquestion: which cities can reach Nantes by following one-way connections?\nThe program derives longer paths from shorter ones, explains why the answer is\ncorrect, and checks the key steps independently.",
  "Compiler": "see.js N3-to-JS compiler",
  "CompiledFacts": 17,
  "CompiledRules": 15,
  "CompiledBackwardRules": 0,
  "CompiledFuses": 5,
  "CompiledQueries": 0,
  "Builtins": [
    "log:notEqualTo",
    "log:outputString",
    "string:concatenation"
  ]
}