135 citations · 329 across the 25 of their papers we have counts for
28 papers
Streamliners for Answer Set Programming
Florentina Voboril, Martin Gebser, Stefan Szeider +1
Streamliner constraints reduce the search space of combinatorial problems by ruling out portions of the solution space. We adapt the StreamLLM approach, which uses Large Language M…
Proceedings 40th International Conference on Logic Programming
Pedro Cabalar, Francesco Fabiano, Martin Gebser +2
Since the first conference In Marseille in 1982, the International Conference on Logic Programming (ICLP) has been the premier international event for presenting research in logic…
Enhancing Temporal Planning Domains by Sequential Macro-actions (Extended Version)
Marco De Bortoli, Lukáš Chrpa, Martin Gebser +1
Temporal planning is an extension of classical planning involving concurrent execution of actions and alignment with temporal constraints. Durative actions along with invariants al…
Elementary Sets for Logic Programs
Martin Gebser, Joohyung Lee, Yuliya Lierler
By introducing the concepts of a loop and a loop formula, Lin and Zhao showed that the answer sets of a nondisjunctive logic program are exactly the models of its Clark's completio…
Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes (Extended version)
Mohammed M. S. El-Kholany, Ramsha Ali, Martin Gebser
Modern semiconductor manufacturing involves intricate production processes consisting of hundreds of operations, which can take several months from lot release to completion. The h…
An End-to-End Reinforcement Learning Approach for Job-Shop Scheduling Problems Based on Constraint Programming
Pierre Tassel, Martin Gebser, Konstantin Schekotihin
Constraint Programming (CP) is a declarative programming paradigm that allows for modeling and solving combinatorial optimization problems, such as the Job-Shop Scheduling Problem…