» Science » Nobel Prize Winner Robert J. Aumann in Dubrovnik at Logic in Computer Science Symposium 25-28 June 2012
» Education » Nobel Prize Winner Robert J. Aumann in Dubrovnik at Logic in Computer Science Symposium 25-28 June 2012
Nobel Prize Winner Robert J. Aumann in Dubrovnik at Logic in Computer Science Symposium 25-28 June 2012
LICS 2012 hosted by the University of Dubrovnik, in Dubrovnik, Croatia, from June 25th to 28th, 2012.
Dubrovnik, 7 min.
Robert J. Aumann, winner of the 2005 Nobel Prize in Economic Sciences, invited lecturer at LICS 2012 in Dubrovnik
The Logic and Computer Symposium - LICS is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. LICS 2012 will be hosted by the Department for Electrical Engineering and Computing at the University of Dubrovnik in Dubrovnik, Croatia, from June 25th to 28th, 2012. There will be an invited lecture by Robert J. Aumann, winner of the 2005 Nobel Prize in Economic Sciences on the photo, and a plenary session in honor of Alan Turing.
Starting 2012, LICS is jointly organized by ACM and IEEE, and is cosponsored by ACM SIGACT and the IEEE Computer Society's Technical Committee on Mathematical Foundations of Computing.
In response to concerns about LICS becoming overly selective with a too-narrow technical focus, the program committee will employ a merit-based selection with no a priori limit on the number of accepted papers.
LICS 2012 will continue the tradition of pre-conference tutorials that was initiated in 2011. This year, Jan Willem Klop will give a tutorial on term rewriting systems and Andre Platzer will give a tutorial on logics of dynamical systems.
Special Events and Invited Lectures: There will be an invited lecture by Robert J. Aumann, winner of the 2005 Nobel Prize in Economic Sciences, and a plenary session in honor of Alan Turing on the occasion of his centenary, with talks by Robert L. Constable, E. Allen Emerson (co-winner of 2008 A. M. Turing Award), Joan Feigenbaum, and Leonid Levin.
LICS is an annual international forum on topics that lie at the intersection of computer science and mathematical logic.
LICS 2012 will be hosted by the Department for Electrical Engineering and Computing at the University of Dubrovnik in Dubrovnik, Croatia, from June 25th to 28th, 2012.
The Sunday evening reception will be held on Sunday, June 24, 6:30 - 8:30 pm in Hotel Valamar Lacroma Dubrovnik, Iva Dulcica 34, 20000 Dubrovnik, Croatia.
The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include:
automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security, rewriting, type systems and type theory, and verification.
Invited plenary lecture by ROBERT J. AUMANN, winner of the 2005 Nobel Prize in Economic Sciences.
Two plenary sessions in honor of Alan Turing on the occasion of his centenary, featuring talks by ROBERT L. CONSTABLE, E. ALLEN EMERSON, JOAN FEIGENBAUM, and LEONID LEVIN.
Pre-conference tutorials on Sunday, June 24, by JAN WILLEM KLOP (rewriting systems) and ANDR´E PLATZER (logic of dynamical systems).
Associated workshops on Sunday, June 24, and on Friday, June 29.
The symposium is sponsored by the IEEE Technical Committee on Mathematical Foundations of Computing and by ACM SIGACT, in cooperation with the Association for Symbolic Logic and the European Association for Theoretical Computer Science.
Program Chair: Nachum Dershowitz, Tel Aviv University
Program Committee: Christel Baier, Dresden Univ. of Technology Lev Beklemishev, Steklov Inst. of Mathematics Andreas Blass, Univ. of Michigan Manuel Bodirsky, E´cole Polytechnique Mikolaj Boja´nczyk, Warsaw Univ. Ahmed Bouajjani, Univ. Paris Diderot Patricia Bouyer-Decitre, CNRS Andrei Bulatov, Simon Fraser Univ. Hubert Comon-Lundh, ENS Cachan Anuj Dawar, Univ. of Cambridge Gilles Dowek, INRIA Mart´ın Escard´o, Univ. of Birmingham Maribel Fern´andez, King’s College London Rob van Glabbeek, NICTA Rosalie Iemhoff, Utrecht Univ. Neil Immerman, UMass, Amherst Max Kanovich, Queen Mary, Univ. of London Naoki Kobayashi, Tohoku Univ. Orna Kupferman, Hebrew Univ. Marta Kwiatkowska, Univ. of Oxford Olivier Laurent, CNRS – ENS Lyon Richard Mayr, Univ. of Edinburgh Andrzej Murawski, Univ. of Leicester David Plaisted, Univ. North Carolina, Chapel Hill Davide Sangiorgi, Univ. of Bologna
Workshops Chairs: Adriana Compagnoni, Stevens Inst. of Technology Maribel Fern´andez, King’s College London
Publicity Chairs: Stephan Kreutzer, Berlin Inst. of Technology Andrzej Murawski, Univ. of Leicester
Treasurer: Mart´ın Escard´o, Univ. of Birmingham
General Chair: Rajeev Alur, Univ. of Pennsylvania
Conference Chairs: Vlatko Lipovac, Univ. of Dubrovnik Andre Scedrov, Univ. of Pennsylvania (Professor Ščedrov studied mathematics at the Univeristy of Zagreb, Croatia)
Organizing Committee: M. Abadi, R. Alur (chair), F. Baader, P. Beame, S. Buss, E. Clarke, A. Compagnoni, N. Dershowitz, M. Escard´o, M. Fern´andez, L. Fortnow, J. Giesl, M. Grohe, J.-P. Jouannaud, P. Kolaitis, S. Kreutzer, B. Larose, V. Lipovac, J. Makowsky, B. Monien, A. Murawski, A. Scedrov, P. Scott, M. Valeriote
Advisory Board: M. Abadi, S. Abramsky, Y. Gurevich, T. Henzinger, C. Kirchner, P. Kolaitis, D. Kozen, U. Martin, J. Mitchell, L. Ong, L. Pacholski, P. Panangaden, G. Plotkin, A. Scedrov, M. Vardi, G. Winskel
Twenty-Seventh Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS 2012) June 2528, 2012, Dubrovnik, Croatia
The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. LICS 2012 will be hosted by the University of Dubrovnik, in Dubrovnik, Croatia, from June 25th to 28th, 2012.
LICS 2012 Accepted Papers
Parosh Abdulla, Mohamed Faouzi Atig and Jari Stenman. Dense-Timed Pushdown Automata
Jiří Adámek, Nathan Bowler, Paul Blain Levy and Stefan Milius. Coproducts of Monads on Set
Manindra Agrawal, S. Akshay, Blaise Genest and P. S. Thiagarajan. Approximate Verification of the Symbolic Dynamics of Markov Chains
Rajeev Alur, Emmanuel Filiot and Ashutosh Trivedi. Regular Transformations of Infinite Strings
Rajeev Alur, Emmanuel Filiot and Ashutosh Trivedi. Regular Transformations of Infinite Strings
Robert Atkey. The Semantics of Parsing with Semantic Actions
Albert Atserias, Moritz Müller and Sergi Oliva. Proof Complexity of Relativized Statements
Arnon Avron, Beata Konikowska and Anna Zamansky. Modular Construction of Cut-Free Sequent Calculi for Paraconsistent Logics
Steve Awodey, Nicola Gambino and Kristina Sojakova. Inductive Types in Homotopy Type Theory
David Baelde and Gopalan Nadathur. Combining Deduction Modulo and Logics of Fixed-Point Definitions
Pablo Barceló, Diego Figueira and Leonid Libkin. Graph Logics with Rational Relations and the Generalized Intersection Problem
Libor Barto, Marcin Kozik and Ross Willard. Near Unanimity Constraints have Bounded Pathwidth Duality
Christoph Berkholz. Lower Bounds for Existential Pebble Games and k-Consistency Tests
Jean-Philippe Bernardy and Guilhem Moulin. A Computational Interpretation of Parametricity
Daniel Bundala, Joel Ouaknine and James Worrell. On the Magnitude of Completeness Thresholds in Bounded Model Checking
Arnaud Carayol and Olivier Serre. Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection
Krishnendu Chatterjee and Laurent Doyen. Partial-Observation Stochastic Games: How to Win when Belief Fails
Krishnendu Chatterjee and Mathieu Tracol. Decidable Problems for Probabilistic Automata on Infinite Words
Krishnendu Chatterjee and Yaron Velner. Mean-Payoff Pushdown Games
Hubie Chen and Victor Dalmau. Decomposing Quantified Conjunctive (or Disjunctive) Formulas
Hubie Chen and Moritz Müller. An Algebraic Preservation Theorem for ℵ0-categorical Quantified Constraint Satisfaction
Yijia Chen and Jörg Flum. On the Ordered Conjecture
Pierre Clairambault, Julian Gutierrez and Glynn Winskel. The Winning Ways of Concurrent Games
Bob Coecke, Ross Duncan, Aleks Kissinger and Quanlong Wang. Strong Complementarity and Non-locality in Categorical Quantum Mechanics
Carles Creus, Adriŕ Gascón, Guillem Godoy and Lander Ramos. The HOM Problem is EXPTIME-complete
Michael Elberfeld, Martin Grohe and Till Tantau. Where First-Order and Monadic Second-Order Logic Coincide
Javier Esparza, Pierre Ganty and Rupak Majumdar. A Perfect Model for Bounded Verification
Nathanaël Fijalkow, Hugo Gimbert and Youssouf Oualhadj. Deciding the Value 1 Problem of Probabilistic Leaktight Automata
Deepak Garg, Valerio Genovese and Sara Negri. Countermodels from Sequent Calculi in Multi-Modal Logics
Sicun Gao, Jeremy Avigad and Edmund Clarke. Delta-Decidability over the Reals
Serge Grigorieff and Pierre Valarcher. Functionals using Bounded Information and the Dynamics of Algorithms
Stefan Göller, Jean Christoph Jung and Markus Lohrey. The Complexity of Decomposing Modal and First-Order Theories
Clemens Grabmayer, Joerg Endrullis, Dimitri Hendriks, Jan Willem Klop and Lawrence S. Moss. Automatic Sequences and Zip-Specifications
Serge Haddad, Sylvain Schmitz and Philippe Schnoebelen. The Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets
Hugo Herbelin. A Constructive Proof of the Axiom of Dependent Choice, Compatible with Classical Logic
Frédéric Herbreteau, B. Srivathsan and Igor Walukiewicz. Better Abstractions for Timed Automata
Naohiko Hoshino. Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects
Guilhem Jaber, Nicolas Tabareau and Matthieu Sozeau. Extending Type Theory with Forcing
Sanjay Jain, Alexei Miasnikov and Frank Stephan. The Complexity of Verbal Languages over Groups
Petr Jancar. Bisimulation Equivalence for First-Order Grammars
Jean-Baptiste Jeannin and Dexter Kozen. Capsules and Separation Logic
Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann and Lidia Tendera. Two-Variable First-Order Logic with Equivalence Closure
Anvesh Komuravelli, Corina S. Pasareanu and Edmund M. Clarke. Learning Probabilistic Systems from Tree Samples
Andreas Krebs and A. V. Sreejith. Non-definability of Languages by Generalized First-Order Formulas over (N,+)
Stephan Kreutzer, Sebastian Siebertz and Viktor Engelmann. Model-Checking on Ordered Structures
Annabelle McIver, Larissa Meinicke and Carroll Morgan. A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism
Damiano Mazza. An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus
Paul-André Melličs. Game Semantics in String Diagrams
Jakub Michaliszyn and Jan Otop. Decidable Elementary Modal Logics
Benoît Monin and Laurent Bienvenu. von Neumann's Biased Coin Revisited
Sebastian Muller and Iddo Tzameret. Short Propositional Refutations for Dense Random 3CNF Formulas
Vivek Nigam. On the Complexity of Linear Authorization Logics
Pawel Parys. On the Significance of the Collapse Operation
Adrien Piérard and Eijiro Sumii. A Higher-Order Distributed Calculus with Name Creation
Andre Platzer. The Complete Proof Theory of Hybrid Systems
Sasha Rubin and Alexander Rabinovich. Interpetations in Scattered Trees
David Sabel and Manfred Schmidt-Schauss. Conservative Concurrency in Haskell
Peter Schuster. Induction in Algebra: A First Case Study
Hugh Steele and Andrea Schalk. Constructing Fully Complete Models for Multiplicative Linear Logic
Tony Tan. An Automata Model for Trees with Ordered Data Values
Dmitriy Traytel, Andrei Popescu and Jasmin Christian Blanchette. Foundational, Compositional (Co)Datatypes for Higher-Order Logic
Jamie Vicary. Higher Semantics of Quantum Protocols
Algorithmics on Infinite State Systems 2012 (AISS 2012)
A satellite workshop of LICS 2012 June 29th, Dubrovnik (Croatia)
Electrical Engineering and Computing Department, University of Dubrovnik, Cira Carica 4, 20236 Dubrovnik, Room B01
The workshop provides the opportunity to assess recent scientific advances and exchange ideas on the algorithmic theory of infinite state systems. Infinite state systems arise in many areas of computer science. Typical examples are recursive programs, communicating systems with unbounded buffers and real time systems. Important algorithmic techniques dealing with infinite state systems include model checking, reachability and equivalence checking.
There are two main goals of the workshop:
Bringing together leading experts as well as young scientists interested in foundational research on infinite state systems in order to exchange their ideas.
Presenting the latest developments in the area of infinite state systems to a wider audience interested in computer science logic.
The University of Dubrovnik is the “youngest” university in Croatia. It was established in 2003. on the foundations of a very long tradition which goes back to the 17th century, but also on decades of modern higher education. By its programs, its organisation and its technical equipment, the University of Dubrovnik can be stands among very modern educational institutions.
High education and scientific work have their roots in the distant past. This is particularly true of the maritime, the social and the natural sciences. For example, Beno Kotruljević, of Dubrovnik, wrote four books in 1458 “About Commerce and a Perfect merchant”, published in Venice in 1573, which was the first work of its kind. There is also Nikola Sorgojević, a citizen of the Dubrovnik Republic (Respublica Ragusii, 1358 – 1816), the first Croat who wrote a book about navigation (published in 1574). Jesuits founded “Collegium Ragusinum” in 1624, which was promulgated into a public institution of high learning where art and natural sciences were studied. That institution provided education for Ruđer Bošković, the most eminent Croatian scientist and the founder of the dynamic theory of atoms, who continued his doctorate studies in Rome. The Dubrovnik Republic Senate allowed young aristocrats to study navigation and commerce and apply their professional knowledge when sailing out of the Adriatic Sea.
27. godišnji simpozij „Logika u računalnoj znanosti“ (LICS) održat će se od 25. do 28. lipnja 2012. na Sveučilištu u Dubrovniku. LICS je međunarodni forum s temama koje povezuju računalne znanosti i matematičku logiku, priopćeno je sa Sveučilišta u Dubrovniku.
Simpozij je privukao veliki broj priznatih stručnjaka u ovim područjima, a posebice treba istaknuti da će uvodno predavanje održati Robert J. Aumann, dobitnik Nobelove nagrade za ekonomiju 2005. godine.
Predavanje je predviđeno za ponedjeljak, 25. lipnja, u 9 sati, u sveučilišnoj zgradi na adresi Ćira Carića 4.
Robert John Aumann rođen je 8. lipnja 1930. godine, izraelsko-američki je matematičar i član Američke akademije za znanosti. Profesor je pri Centru za proučavanje racionalnosti na Hebrew University of Jerusalem u Izraelu. Gostujući je profesor i na Stony Brook University i jedan je od osnivača Centra za teoriju igara u ekonomiji na Stony Brook. Aumann je dobio Nobelovu nagradu za svoj rad na konfliktu i suradnji kroz analizu teorije igara.
Domaćin ovogodišnjeg simpozija je Odjel za elektrotehniku i računarstvo Sveučilišta u Dubrovniku.
Formated for CROWN by prof.dr. Darko Žubrinić Distributed by www.Croatia.org . This message is intended for Croatian Associations/Institutions and their Friends in Croatia and in the World. The opinions/articles expressed on this list do not reflect personal opinions of the moderator. If the reader of this message is not the intended recipient, please delete or destroy all copies of this communication and please, let us know!