Oxford Papers for LICS-2015
Posted: 14th April 2015
Eight Oxford papers have been accepted to the 13th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2015). The LICS Symposium, held from 6-10 July in Kyoto, Japan, is an annual international forum on the theory and practice of computer science in relation to mathematical logic. For more information, visit http://lics.rwth-aachen.de/lics15/.
The eight papers are:
Michael Benedikt, Thomas Colcombet, Balder Ten Cate and Michael Vanden Boom: The Complexity of Boundedness for Guarded Logics
Antoine Amarilli and Michael Benedikt: Finite Open-World Query Answering with Number Restrictions
Michael Benedikt, Balder Ten Cate and Michael Vanden Boom: Interpolation with Decidable Fixpoint Logics
Chris Heunen and Bert Lindenhovius: Domains of Commutative C*-subalgebras
Takeshi Tsukada and Luke Ong. Nondeterminism in Game Semantics via Sheaves
Tomas Brazdil, Stefan Kiefer, Antonin Kucera and Petr Novotný: Long-Run Average Behaviour of Probabilistic Vector Addition Systems
Amar Hadzihasanovic: A Diagrammatic Axiomatisation for Qubit Entanglement
Antonia Lechner, Joel Ouaknine and James Worrell: On the Complexity of Linear Arithmetic with Divisibility
Additionally, several Oxford alumni have had papers accepted for the conference, including Nikos Tzevelekos, Steven Ramsay and Jennifer Hackett.