AI Paper Atlas

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

Symmetry Breaking for Inductive Logic Programming

Andrew Cropper, David M. Cerna, Matti Järvisalo

AAAI 2026 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add symmetry-breaking constraintsPopper · 449 ILP taskssolving time: 97/449 tasks significantly faster, 1/449 slowerImproved
add symmetry-breaking constraintsPopper · Trains task, 9 variables allowed per rulesolving time: 3600 -> 17 secondsImproved
add symmetry-breaking constraintsPopper · 449 ILP taskslearning time: 128/449 tasks faster, 12/449 slowerMixed
add symmetry-breaking constraintsPopper · sokoban-terminal (IGGP)solving time: 1075 -> 59 secondsImproved

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