mlsanityData to 14 Oct 2026

XLOG: A CUDA-Native Engine for Neurosymbolic Integration

arXiv 2609.27203 ↗First posted 23 Sep 2026cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

xlog is a CUDA-native logic programming engine integrating neural perception with deterministic Datalog, probabilistic inference, and epistemic world views through a typed frontend and provider-owned CUDA runtime. Its reasoning modes share device data planes, but their execution boundaries differ: ordinary Datalog and exact inference are host-orchestrated, while certified resident recursive and Monte Carlo sampled cores record zero tracked host-device transfers before a bounded terminal receipt. The probabilistic path supports end-to-end gradients through GPU knowledge compilation from provenance to CNF to Decision-DNNF, exact weighted model counting, and backward gradients. A final smoothed circuit is certified against its source formula before caching or evaluation. Circuit caching yields a 2.74x MNIST-addition training speedup; a worst-case-optimal join subsystem yields a 27.96x geometric-mean gain over xlog's binary-join baseline. MNIST-addition accuracy matches Scallop's (0.9561 versus 0.9468), but no per-epoch speed claim is made because baseline epoch time varies with CPU quota. In five hub-skewed triangle-counting cases, the Souffle-to-fused-xlog execution-time ratio rises from 0.88x at 150k edges, where Souffle is faster, to 5.54x at 1.2M; fused peak device allocations are 85-1,033 MB versus 3,287-44,979 MB for the materializing arm. Exact inference is correctness-equivalent to but slower than ProbLog2. On a public video benchmark, a proximity predicate trained only through symbolic credit replaces hand-set geometry at unchanged held-out accuracy; within Event-Calculus rule search it fails ten-fold cross-validation and does not transfer on a leak-free split. On a maritime corpus, weighted clauses beat crisp selection by 0.065 F1, with the result reproduced by one chronological training pass.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 42 references that are in the map. First posted on arXiv 23 Sep 2026.

Builds on

18 of 42 references.

References · 18

  1. 2019Neural Probabilistic Logic Programming in DeepProbLogcited by 394
  2. 2017A Semantic Loss Function for Deep Learning with Symbolic Knowledgecited by 270
  3. 2017Learning Explanatory Rules from Noisy Datacited by 211
  4. 2020Logic Tensor Networkscited by 199
  5. 2019SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solvercited by 173
  6. 2017Multi-shot ASP solving with clingocited by 115
  7. 2023NeurASP: Embracing Neural Networks into Answer Set Programmingcited by 92
  8. 2023Scallop: A Language for Neurosymbolic Programmingcited by 63
  9. 2023Massively Parallel Continuous Local Search for Hybrid SAT Solving on GPUscited by 8
  10. 2019Datalog Disassemblycited by 7
  11. 2019Composite Event Recognition for Maritime Monitoringcited by 4
  12. 2021Online Learning Probabilistic Event Calculus Theories in Answer Set Programmingcited by 4
6 more
  1. 2025Lobster: A GPU-Accelerated Framework for Neurosymbolic Programmingcited by 4
  2. 2023Optimizing Datalog for the GPUcited by 2
  3. 2025Column-Oriented Datalog on the GPUcited by 2
  4. 2019Knowledge compilation languages as proof systemscited by 1
  5. 2023Free Join: Unifying Worst-Case Optimal and Traditional Joinscited by 1
  6. 2026Scaling Worst-Case Optimal Datalog to GPUscited by 1

Built on by

Not cited yet.