AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Linear-time rule mining under formal guarantees

Jonathan Feldstein, Dominic Phillips, Efthymia Tsamoura

NeurIPS 2026 · Learning theory and algorithms › Combinatorial and search optimization · approach: Differentiable and symbolic reasoning

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes a linear-time rule mining method for learning probabilistic logical theories from data with formal guarantees.

Problem

Handcrafted probabilistic logical theories are costly and error-prone to build, while existing rule-learning algorithms are prohibitively expensive computationally.

Approach

Mines logical rules for probabilistic logical models in linear time while retaining formal guarantees; the abstract is truncated so specifics are not stated.

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy