Learning to break symmetries for efficient optimization in answer set programming

A Tarzariol, M Gebser, K Schekotihin… - Proceedings of the AAAI …, 2023 - ojs.aaai.org
The ability to efficiently solve hard combinatorial optimization problems is a key prerequisite
to various applications of declarative programming paradigms. Symmetries in solution …

Pruning redundancy in answer set optimization applied to preventive maintenance scheduling

A Yli-Jyrä, MF Rankooh, T Janhunen - International Symposium on …, 2023 - Springer
Multi-component machines deployed, eg, in paper and steel industries, have complex
physical and functional dependencies between their components. This profoundly affects …

[PDF][PDF] Learning Efficient Constraints in Answer Set Programming

A Tarzariol, M Gebser, K Schekotihin - Learning, 2024 - overlay.uniud.it
Learning Efficient Constraints in Answer Set Programming Page 1 Learning Efficient
Constraints in Answer Set Programming Alice Tarzariol, Martin Gebser, Konstantin …

Pursuing the Optimal CP Model: A Batch Scheduling Case Study

G Da Col, E Teppan - Proceedings of SAI Intelligent Systems Conference, 2023 - Springer
The process of coming up with an effective constraint programming (CP) model for complex
industrial optimization problems constitutes a cumbersome engineering task. Not only the …

Erlernen effizienter Constraints in der Antwortmengenprogrammierung

A Tarzariol - Ausgezeichnete Informatikdissertationen 2023 (Band …, 2024 - dl.gi.de
Für das effiziente Lösen kombinatorischer Probleme kann das Herausfiltern symmetrischer
Lösungskandidaten aus dem Suchraum entscheidend sein. Die meisten existierenden …

[HTML][HTML] EPTCS 385 Proceedings 39th International Conference on Logic Programming

M Track - cgi.cse.unsw.edu.au
The International Conference on Logic Programming (ICLP) is the premiere international
scientific venue for presenting, discussing, and disseminating fundamental and applied …