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.
Pakin, Performing fully parallel constraint logic programming on a quantum annealer, Theory and Practice of Logic Programming 18 (2018) 928–949
1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.
1
Pith paper citing it
2
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.PL 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
support 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.