EUVIMEDEUVIMED entdecken
Crossref

Symmetry Breaking for Inductive Logic Programming

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

Proceedings of the AAAI Conference on Artificial Intelligence · 14.03.2026 · 40 (23) · 19012-19020

DOI: 10.1609/aaai.v40i23.38973 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the AAAI Conference on Artificial Intelligence, online erschienen am 14.03.2026. Verfasst von Andrew Cropper und 2 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The goal of inductive logic programming (ILP) is to search for a hypothesis that generalises training data and background knowledge. The challenge is searching vast hypothesis spaces, which is exacerbated because many logically equivalent hypotheses exist. To address this challenge, we introduce a method to break symmetries in the hypothesis space. We implement our idea in answer set programming. Our experiments on multiple domains, including visual reasoning and game playing, show that our approach can reduce solving times from over an hour to just 17 seconds.

Zitieren

APA

Cropper, A., Cerna, D. M., & Järvisalo, M. (2026). Symmetry Breaking for Inductive Logic Programming. Proceedings of the AAAI Conference on Artificial Intelligence, 40(23), 19012-19020. https://doi.org/10.1609/aaai.v40i23.38973

Vancouver

Cropper A, Cerna DM, Järvisalo M. Symmetry Breaking for Inductive Logic Programming. Proceedings of the AAAI Conference on Artificial Intelligence. 2026;40(23):19012-19020. doi:10.1609/aaai.v40i23.38973

BibTeX
@article{Cropper2026,
  author = {Cropper, Andrew and Cerna, David M. and Järvisalo, Matti},
  title = {Symmetry Breaking for Inductive Logic Programming},
  journal = {Proceedings of the AAAI Conference on Artificial Intelligence},
  year = {2026},
  volume = {40},
  number = {23},
  pages = {19012--19020},
  doi = {10.1609/aaai.v40i23.38973}
}
Kostenlos starten →