Parse, translate, prove and model-check logic formulas in Unicode notation: first-order, modal, description and higher-order logic, one API over a dozen provers, and an MCP server
Differentiable modal logic for PyTorch: □ and ♢ as trainable layers over a Kripke structure, with sound interval bounds and a learnable accessibility relation. Oral @ NeSy 2026.
Parse, translate, prove and model-check logic formulas in Unicode notation: first-order, modal, description and higher-order logic, one API over a dozen provers, and an MCP server
