← Search

Tobias Geibinger

7 accepted papers

2024

Parallel Empirical Evaluations: Resilience despite Concurrency

AAAI 2024technical

Computational evaluations are crucial in modern problem-solving when we surpass theoretical algorithms or bounds. These experiments frequently take much work, and the sheer amount of needed resources makes it impossible to execute them on a single personal computer or laptop. Cluster schedulers allo…

2023

A Logic-based Approach to Contrastive Explainability for Neurosymbolic Visual Question Answering

IJCAI 2023poster

Visual Question Answering (VQA) is a well-known problem for which deep-learning is key. This poses a challenge for explaining answers to questions, the more if advanced notions like contrastive explanations (CEs) should be provided. The latter explain why an answer has been reached in contrast to a…

2022

Large-Neighbourhood Search for Optimisation in Answer-Set Solving

AAAI 2022technical

While Answer-Set Programming (ASP) is a prominent approach to declarative problem solving, optimisation problems can still be a challenge for it. Large-Neighbourhood Search (LNS) is a metaheuristic for optimisation where parts of a solution are alternately destroyed and reconstructed that has high b…

2021

Constraint Logic Programming for Real-World Test Laboratory Scheduling

AAAI 2021technical

The Test Laboratory Scheduling Problem (TLSP) and its subproblem TLSP-S are real-world industrial scheduling problems that are extensions of the Resource-Constrained Project Scheduling Problem (RCPSP). Besides several additional constraints, TLSP includes a grouping phase where the jobs to be schedu…