Search Results for author:
Found 21 papers, 5 papers with code
Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes (Extended version)
Modern semiconductor manufacturing involves intricate production processes consisting of hundreds of operations, which can take several months from lot release to completion.
Enhancing Temporal Planning Domains by Sequential Macro-actions (Extended Version)
Temporal planning is an extension of classical planning involving concurrent execution of actions and alignment with temporal constraints.
Elementary Sets for Logic Programs
We propose the notion of an elementary set, which is almost equivalent to the notion of an elementary loop for nondisjunctive programs, but is simpler, and, unlike elementary loops, can be extended to disjunctive programs without producing unintuitive results.
An End-to-End Reinforcement Learning Approach for Job-Shop Scheduling Problems Based on Constraint Programming
Constraint Programming (CP) is a declarative programming paradigm that allows for modeling and solving combinatorial optimization problems, such as the Job-Shop Scheduling Problem (JSSP).
Semiconductor Fab Scheduling with Self-Supervised and Reinforcement Learning
Semiconductor manufacturing is a notoriously complex and costly multi-step process involving a long sequence of operations on expensive and quantity-limited equipment.
Proceedings 38th International Conference on Logic Programming
ICLP is the premier international event for presenting research in logic programming.
Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
The Job-shop Scheduling Problem (JSP) is a well-known and challenging combinatorial optimization problem in which tasks sharing a machine are to be arranged in a sequence such that encompassing jobs can be completed as early as possible.
Efficient lifting of symmetry breaking constraints for complex combinatorial problems
Many industrial applications require finding solutions to challenging combinatorial problems.
Lifting Symmetry Breaking Constraints with Inductive Logic Programming
Efficient omission of symmetric solution candidates is essential for combinatorial problem-solving.
Aggregate Semantics for Propositional Answer Set Programs
Answer Set Programming (ASP) emerged in the late 1990ies as a paradigm for Knowledge Representation and Reasoning.
A Reinforcement Learning Environment For Job-Shop Scheduling
Scheduling is a fundamental task occurring in various automated systems applications, e. g., optimal schedules for machines on a job shop allow for a reduction of production costs and waste.
ASP-Core-2 Input Language Format
Standardization of solver input languages has been a main driver for the growth of several areas within knowledge representation and reasoning, fostering the exploitation in actual applications.
The Seventh Answer Set Programming Competition: Design and Results
Answer Set Programming (ASP) is a prominent knowledge representation language with roots in logic programming and non-monotonic reasoning.
Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming
We address this prevalent problem in the context of car assembly at Mercedes-Benz Ludwigsfelde GmbH, a large-scale producer of commercial vehicles, where routes for automated guided vehicles used in the production process have traditionally been hand-coded by human engineers.
Experimenting with robotic intra-logistics domains
More precisely, asprilo consists of a versatile benchmark generator, solution checker and visualizer as well as a bunch of reference encodings featuring various ASP techniques.
Multi-shot ASP solving with clingo
We introduce a new flexible paradigm of grounding and solving in Answer Set Programming (ASP), which we refer to as multi-shot ASP solving, and present its implementation in the ASP system clingo.
Grounding Recursive Aggregates: Preliminary Report
In particular, we provide a series of algorithms detailing the treatment of recursive aggregates and illustrate this by a running example.
Rewriting recursive aggregates in answer set programming: back to monotonicity
Since the evaluation of normal programs with monotone aggregates is in general on a lower complexity level than the evaluation of normal programs with arbitrary aggregates, any faithful translation function must introduce disjunction in rule heads in some cases.
The Design of the Fifth Answer Set Programming Competition
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.
A System for Interactive Query Answering with Answer Set Programming
Reactive answer set programming has paved the way for incorporating online information into operative solving processes.
Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
We here develop an alternative approach based on ASP.
