A Lean-4-verified compiler maps recursive Datalog programs to 2-local Ising models whose ground state is the program's minimal Herbrand model, but simulated annealers reach that state only for small instances.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Towards Datalog on Quantum Annealers: Compiling Recursive Logic Programs with Bottom-up Semantics to 2-local Ising Models
A Lean-4-verified compiler maps recursive Datalog programs to 2-local Ising models whose ground state is the program's minimal Herbrand model, but simulated annealers reach that state only for small instances.