J. Fichte

Enhancing Reliability in AI-generated Academic References through Automated Verification.

Abstracting the Indistinguishable in ASP

This work examines the computational complexity of existing abstraction techniques based on clustering (faithful and uniform abstractions) and proposes a novel syntactic operator to achieve uniform abstractions, when possible, and explores properties needed to reach abstractions from syntactic symmetry.

Maximum Satisfiability of Simple Temporal Problems

The results suggest that MaxSTP is often computationally harder than optimizing qualitative CSPs - it is verified that many such problems are FPT when parameterized by n or tw, and it is demonstrated that FPT algorithms for MaxSTP are indeed possible but with other parameters such as k + vc.

Incremental Planning over Lifted Abstractions

This work proposes to abstract the planning task for abstract solutions that are then repaired into concrete plans for the input task, and showcases domains in which drawing an abstract plan and repairing it is significantly faster than solving the original problem.