About
The workshop will discuss semantics of logic programs over general semirings: constraints over semirings, query complexity with semiring semantics, termination conditions of logic programs over semirings. The connection between semirings and logic is a relatively new development in database theory (since 2007), and this area has high potential for major innovation. Some of the problems discussed at the workshop will be inspired by systems, others will be purely theoretical in nature, such as the quest for finding appropriate extensions of Pebble Games to semiring semantics.
Chairs/Organizers
Invited Participants
Michael Benedikt (University of Oxford), Stefano Bistarelli (University of Perugia), Pierre Bourhis (CNRS , CRISTAL), Peter Buneman (Edinburgh), Nofar Carmeli (Inria Montpellier), Daniel Deutch (Tel Aviv University), Javier Esparza (Technische Universität München), Anna Fariha (U. Utah), Cibele Freire (Bowdoin College), Amir Gilad (Hebrew University of Jerusalem), Boris Glavic (Illinois Institute of Technology), Erich Graedel (RWTH Aachen), Joseph Hellerstein (UC Berkeley), Zachary Ives (University of Pennsylvania), Hayden Jananthan (MIT), Benny Kimelfeld (Technion), Christoph Koch (EPFL), Kuldeep S. Meel (University of Toronto), Matthias Naaf (RWTH Aachen University), Mayur Naik (University of Pennsylvania), Wang-Chiew Tan (Facebook Inc/Meta), Zach Tatlock (University of Washington), Nikolaos Tziavelis (Northeastern University), Max Willsey (UC Berkeley), Brit Youngmann (MIT)