10 citations · 14 across the 5 of their papers we have counts for
5 papers · 1 filter
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…
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…
Semiconductor Fab Scheduling with Self-Supervised and Reinforcement Learning
Pierre Tassel, Benjamin Kovács, Martin Gebser +3
Semiconductor manufacturing is a notoriously complex and costly multi-step process involving a long sequence of operations on expensive and quantity-limited equipment. Recent chip…
The Design of the Fifth Answer Set Programming Competition
Francesco Calimeri, Martin Gebser, Marco Maratea +1
Answer Set Programming (ASP) is a well-established paradigm of declarative programming that has been developed in the field of logic programming and nonmonotonic reasoning. Advance…