Marius Schneider
Papers
1
Total Citations
15
H-Index
1
About
Marius Schneider is a researcher whose work lies at the intersection of artificial intelligence, constraint programming, and combinatorial problem-solving. He is best known for his contributions to the study of Answer Set Programming (ASP), particularly through the lens of challenging benchmark problems. His most-cited paper, "Ricochet Robots: A Transverse ASP Benchmark" (2013, 15 citations), introduced a novel and complex puzzle domain—the Ricochet Robots game—as a rigorous testbed for evaluating ASP solvers. This work demonstrated how real-world-inspired puzzles can reveal subtle performance characteristics of logic-based reasoning systems, offering insights into search heuristics and grounding strategies. By framing a popular board game as a transverse benchmark, Schneider provided the ASP community with a valuable tool for comparing solver efficiency and robustness. His research underscores the importance of creative, domain-specific benchmarks in advancing automated reasoning, and his work continues to influence the development of more effective and scalable AI problem-solving techniques.
Research Focus
Key Achievements
Top Papers
- 1Ricochet Robots: A Transverse ASP Benchmark15 citations · 2013