Content: Eleventh Workshop

Eleventh Workshop

The eleventh Hybris Workshop takes place on May 7-8 2018 at the University of Potsdam, Germany.


The workshop sessions takes place at

Haus 4 (Institut fuer Informatik),
August-Bebel-Straße 89,
14482 Potsdam

in room 1.02 on the first floor.


The best of both worlds: Machine learning meets logical reasoning

Invited Talk by Holger H. Hoos Leiden Institute of Advanced Computer Science (LIACS), The Netherlands and University of British Columbia, Canada

Machine learning and logical inference are foundational pillars of artificial intelligence. Research in both areas has blossomed over the last twenty years and produced significant, rapidly increasing impact in many important applications. While machine learning and logical inference both play a key role in the AI revolution that is currently underway, on the surface, they seem rather different worlds. In this talk, I will explore an intriguing connection between those worlds: the use of machine learning for the automated design and analysis of logical inference engines. I will use prominent work from SAT solving to illustrate how this connection can be leveraged, from performance modelling and prediction to automated selection, configuration and parallelisation of state-of-the-art SAT solvers. I will then explain how this line of work brings about a fundamental change in the way in which we design and deploy not only cutting-edge solvers for SAT and its important generalisations, but algorithms and software for a broad range of problems from AI and beyond. I will also introduce the concept of automated AI (or AutoAI), which promises to make cutting edge AI techniques more accessible, more effective and more broadly applicable.


Go was solved with a hammer, then what are the other nails?

Invited Talk by Carmel Domshlak, Technion Israel Institute of Technology

From Go playing to focused web crawling to physical systems’ control automation, reinforcement learning algorithms, such as Q-learning and UCT, are perceived as key enablers of grand successes in large-scale multi-state decision problems. But what was the actual marginal contribution of these algorithms to the success stories? What *exactly* can we learn from these successes? Most importantly, what of these success stories can and should be translated nicely to many other decision problems of our interest?

A few years ago, these questions took us into a small journey that brought us to interesting, surprising, and sometimes even “shocking” revelations. Along the journey, we have also learned a few things about building competitive algorithms for action selection in multi-state decision processes, with (originally unintentional) focus on Monte-Carlo sampling algorithms. In this talk I will summarize for you some of our key findings, developments, and intermediate conclusions, while trying to make the presentation as self-contained as possible.

Joint work with Zohar Feldman and Alexander Shleyfman, and not to forget all my friends with whom I had pleasure to discuss the subject on a cup of coffee.


Monday, May 7  
12:45-13:00Registration and Welcome 
13:00-14:00The best of both worlds: Machine learning meets logical reasoning (Abstract, Slides)Holger Hoos,Leiden University, The Netherlands
14:00-14:30ASP-based Time-Bounded Planning with CLIPS-based Multi-Robot ExecutionTim Niemueller, RWTH Aachen
14:30-15:00Experimenting with Robotic Intra-logistics DomainsPhilipp Obermeier, University of Potsdam
15:00-15:30Coffee Break 
15:30-16:00Controlling Robotic Vehicles in Car Assembly with Answer Set ProgrammingMartin Gebser, University of Potsdam
16:00-16:30Temporal Answer Set Programming on Finite TracesTorsten Schaub, University of Potsdam
16:30-17:00Symbolic Planning with State-Dependent CostsDavid Speck, University of Freiburg
17:15-18:15Hybris PI Meeting 
20:00Dinner at Cafe Heider 
Tuesday, May 8  
09:00-10:00Go was solved with a hammer, then what are the other nails? (Abstract, Slides)Carmel Domschlak, Technion, Israel
10:00-10:30Coffee Break 
10:30-11:00Coupling Mobile Base and End-Effector Motion in Task SpaceTim Welschehold, University of Freiburg
11:00-11:30Timed Golog Programs and the Verification Problem for Quantitative Temporal PropertiesBenjamin Zarrieß, TU Dresden
11:30-12:00Improving an Iterative Scaling Algorithm for Computing First-order Maximum Entropy DistributionsMarco Wilhelm, TU Dortmund
13:30-15:30Tutorial: Limited Reasoning (Slides)Christoph Schwering, UNSW, Australia
15:30Coffee and Farewell 

Dinner Location: Cafe Heider