The international interdisciplinary conference PhML 2012 is intended to provide a forum for presentation of current research, and to stimulate an interdisciplinary dialogue between mathematicians, logicians, philosophers, computer scientists and linguists. The conference will have plenary sessions to present the latest researches. Apart from plenary sessions, there will also be several sessions to present contributed papers at thematic sections. There will also be held a panel discussion about Kant's logic.

For more information, see http://www.pdmi.ras.ru/EIMI/2012/PhML/

The 10th Conference on Logic and the Foundations of Game and Decision Theory will be held June 18-20, 2012 (NEXT YEAR), at the University of Sevilla, in Spain. This is the tenth in a series of conferences on the applications of logical methods to foundational issues in the theory of individual and interactive decision-making.

For more information, see http://personal.us.es/hvd/loft/

The workshop's goal is to bring together various formal methods for modeling and reasoning about belief revision, knowledge update, preference change, and strategies for learning. With this workshop we reach out to the logicians working in the domains of social choice theory and formal learning theory.

. For more information, see: http://www.ninagierasimczuk.com/LBP2012 or contact lbp2012 at easychair.org.

The 15th Latin American Symposium on Mathematical Logic, SLALM 2012, will be held in Bogota, Colombia, during the week of June 4 to 8, 2012. The first SLALM (Simposio Latinoamericano de Lógica Matemática) was held in 1970 in Santiago de Chile and subsequent meetings have taken place in Brazil, Chile, Colombia, Venezuela, Argentina, Costa Rica, and Mexico. In addition to plenary talks, this meeting willinclude four special sessions on Algebraic and Non-classical logics, Model Theory, Recursion and Computer Science Logic, and Set Theory. Four tutorial courses are planned during the week previous to the meeting.

For more information, see http://matematicas.uniandes.edu.co/eventos/SLALM2012/.

The Royal Netherlands Academy of Arts and Sciences (KNAW) together with the Netherlands Organisation for Scientific Research (NWO) will organise a symposium concerning fundamentals and applications of complexity science.

For more information, see http://www.knaw.nl/Content/Internet_KNAW/actueel/bestanden/.

LATA is a yearly conference in theoretical computer science and its applications. Following the tradition of the International Schools in Formal Languages and Applications developed at Rovira i Virgili University in Tarragona since 2002, LATA 2012 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.).

For more information, see http://grammars.grlmc.com/lata2012.

LATA is a yearly conference in theoretical computer science and its applications. Following the tradition of the International Schools in Formal Languages and Applications developed at Rovira i Virgili University in Tarragona since 2002, LATA 2012 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.).

For more information, see http://grammars.grlmc.com/lata2012.

LATA is a yearly conference in theoretical computer science and its applications. Following the tradition of the International Schools in Formal Languages and Applications developed at Rovira i Virgili University in Tarragona since 2002, LATA 2012 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.).

For more information, see http://grammars.grlmc.com/lata2012.

This workshop focuses on the interaction of form and meaning of linguistic expressions with questions in discourse. It is well known that such an interaction exists, for instance, focus in an answer often corresponds to the wh-word in an explicit or implicit question, and some verbs can even embed overt or concealed questions. Recently, however, important progress has been achieved in this regard.

Invited speakers: David Beaver, Jeroen Groenendijk, Malte Zimmermann

For more information, see https://sites.google.com/site/inquisitivesemantics/workshops/

LATA is a yearly conference in theoretical computer science and its applications. Following the tradition of the International Schools in Formal Languages and Applications developed at Rovira i Virgili University in Tarragona since 2002, LATA 2012 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.).

For more information, see http://grammars.grlmc.com/lata2012.

This workshop focuses on the interaction of form and meaning of linguistic expressions with questions in discourse. It is well known that such an interaction exists, for instance, focus in an answer often corresponds to the wh-word in an explicit or implicit question, and some verbs can even embed overt or concealed questions. Recently, however, important progress has been achieved in this regard.

Invited speakers: David Beaver, Jeroen Groenendijk, Malte Zimmermann

For more information, see https://sites.google.com/site/inquisitivesemantics/workshops/

A controlled natural language (CNL) is based on natural language but comes with restrictions on vocabulary, grammar, and/or semantics. The general goal is to reduce or eliminate ambiguity and complexity.

Some of these languages are designed to improve communication among humans, especially for non-native speakers of the respective natural language. In other cases, the restrictions on the language are supposed to make it easier for computers to analyze such texts in order to improve computer-aided, semi-automatic, or automatic translations into other languages. A third group of CNL has the goal to enable reliable automated reasoning on seemingly natural texts. Such languages have a direct mapping to some sort of formal logic and should improve the accessiblity of formal knowledge representations or specifications for people unfamiliar with formal notations. All these types of CNL are covered by this workshop.

For more information, see http://attempto.ifi.uzh.ch/site/cnl2012/

LATA is a yearly conference in theoretical computer science and its applications. Following the tradition of the International Schools in Formal Languages and Applications developed at Rovira i Virgili University in Tarragona since 2002, LATA 2012 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.).

For more information, see http://grammars.grlmc.com/lata2012.

This workshop focuses on the interaction of form and meaning of linguistic expressions with questions in discourse. It is well known that such an interaction exists, for instance, focus in an answer often corresponds to the wh-word in an explicit or implicit question, and some verbs can even embed overt or concealed questions. Recently, however, important progress has been achieved in this regard.

Invited speakers: David Beaver, Jeroen Groenendijk, Malte Zimmermann

For more information, see https://sites.google.com/site/inquisitivesemantics/workshops/

The Vienna Forum for Analytic Philosophy, a student society for philosophical research in the analytic tradition at the Department of Philosophy of the University of Vienna, dedicates its first Graduate Conference in March 2012 to the topic of truth.

For more information, see http://wfap.philo.at/?q=node/94

LAMAS is a scientific network spanning an interdisciplinary community of researchers working on logical aspects of MAS from the perspectives of logic, artificial intelligence, computer science, game theory, etc. The LAMAS workshop is the pivotal event of the network and it provides a platform for presentation, exchange, and publication of ideas in all these areas. LAMAS 2012 is a satellite workshop of AAMAS 2012.

For more information, see http://icr.uni.lu/lamas2012/ or contact lamas at uni.lu.

The DL workshop is the major annual event of the description logic research community. It is the forum at which those interested in description logics, both from academia and industry, meet to discuss ideas, share information and compare experiences.

In this year, DL workshop will share a joint session together with the International Workshop on Non-Monotonic Reasoning (NMR 2012).

Information about submission, registration, travel information, etc., is available on the DL 2012 homepage: http://dl.kr.org/dl2012. Further enquiries about the DL 2012 workshop can be made by contacting the organizing committee at dl2012 at dis.uniroma1.org.

The Vienna Forum for Analytic Philosophy, a student society for philosophical research in the analytic tradition at the Department of Philosophy of the University of Vienna, dedicates its first Graduate Conference in March 2012 to the topic of truth.

For more information, see http://wfap.philo.at/?q=node/94

The Vienna Forum for Analytic Philosophy, a student society for philosophical research in the analytic tradition at the Department of Philosophy of the University of Vienna, dedicates its first Graduate Conference in March 2012 to the topic of truth.

For more information, see http://wfap.philo.at/?q=node/94

The series of International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) is a forum where, year after year, some of the most renowned researchers in the areas of logic, automated reasoning, computational logic, programming languages and their applications come to present cutting-edge results, to discuss advances in these fields, and to exchange ideas in a scientifically emerging part of the world. The 18th LPAR will be held in Merida, Venezuela.

For more information, see http://www.lpar-18.info/.

The series of International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) is a forum where, year after year, some of the most renowned researchers in the areas of logic, automated reasoning, computational logic, programming languages and their applications come to present cutting-edge results, to discuss advances in these fields, and to exchange ideas in a scientifically emerging part of the world. The 18th LPAR will be held in Merida, Venezuela.

For more information, see http://www.lpar-18.info/.

The series of International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) is a forum where, year after year, some of the most renowned researchers in the areas of logic, automated reasoning, computational logic, programming languages and their applications come to present cutting-edge results, to discuss advances in these fields, and to exchange ideas in a scientifically emerging part of the world. The 18th LPAR will be held in Merida, Venezuela.

For more information, see http://www.lpar-18.info/.

The roots of logic go back to antiquity, where it was mostly used as a tool for analyzing human reasoning. In the 19th century Gottlob Frege introduced anti-psychologism in the philosophy of mathematics, the view that the nature of mathematical truth is independent of human ideas. During the same period in the 19th century, also modern psychology (Helmholtz, Wundt) was born. Frege's notion of anti-psychologism often stood in the way of a potential merge of the disciplines and led to a significant separation between logic and psychology research agendas and methods. But since the 1960s, together with the growth of cognitive science inspired by the "mind as computer" metaphor, the two disciplines have started to interact more and more.

We plan to discuss the empirical research motivated by logical theories as well as logics inspired by experimental studies. As a result, we hope to contribute towards an increase in collaboration between logicians and cognitive scientists.

For more information, see http://www.ai.rug.nl/SocialCognition/logic-cognition/

The series of International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) is a forum where, year after year, some of the most renowned researchers in the areas of logic, automated reasoning, computational logic, programming languages and their applications come to present cutting-edge results, to discuss advances in these fields, and to exchange ideas in a scientifically emerging part of the world. The 18th LPAR will be held in Merida, Venezuela.

For more information, see http://www.lpar-18.info/.

The Turing Centenary Conference features
(1) Ten Turing Award winners, a Templeton Award winner and Garry Kasparov as invited speakers
(2) 20,000 pounds worth best paper award program, including 5,000 pounds best paper award
(3) Three panels and two public lectures
(4) Turing Fellowship award ceremony
(5) and many more ...

For more details please check http://www.turing100.manchester.ac.uk/.

The biennial DEON conferences are designed to promote interdisciplinary cooperation amongst scholars interested in linking the formal-logical study of normative concepts and normative systems with computer science, artificial intelligence, philosophy, organization theory and law. In addition to these general themes, DEON2012 will encourage a special focus on the topic "Deontic Logic and Social Choice".

For more information, see http://infomedia.uib.no/deon2012/

The series of International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) is a forum where, year after year, some of the most renowned researchers in the areas of logic, automated reasoning, computational logic, programming languages and their applications come to present cutting-edge results, to discuss advances in these fields, and to exchange ideas in a scientifically emerging part of the world. The 18th LPAR will be held in Merida, Venezuela.

For more information, see http://www.lpar-18.info/.

The role of set theory as a foundation of mathematics has been criticized from various standpoints. The conference aims to shed light on this debate by asking what foundations of mathematics are and what they are for.

Some people understand foundations as providing a justification for mathematics; others as providing the subject matter of mathematics; others still as providing us with an arena within which to settle all questions of existence and proof in mathematics. The conference will bring together philosophers, logicians and mathematicians to discuss whether any of these senses of foundations should be privileged. The prospects for a pluralistic approach to foundational issues will also be considered.

For more information, see http://www.phil.cam.ac.uk/foundations/

The purpose of BCTCS is to provide a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers. This year, BCTCS is part of the Alan Turing Year, and will be collocated with the Automated Reasoning Workshop ARW.

The scope of the colloquium includes all aspects of theoretical computer science, including automata theory, algorithms, complexity theory, semantics, formal methods, concurrency, types, languages and logics. Both computer scientists and mathematicians are welcome to attend, as are participants from outside of the UK.

Further details are available from the Colloquium website at http://bctcs2012.cs.manchester.ac.uk/.

Aimed at understanding the structure of mathematical proofs, proof theory has undergone different phases: it has been reductive, general, structural. Especially thanks to sequent calculus formalizations, deep results were attained as far as proofs in pure logic and arithmetic are concerned. Through significant connections with computer science, proof theory contributed to the birth of new areas of research outside traditional mathematics, such as the verification of correctness of computer programs. Natural deduction has led to the Curry-Howard correspondence and to connections with functional programming, and sequent calculus is often used in systems of automatic proof search, as in logic programming. Rooted in general proof theory, a proof-theoretic semantics has been recently developed as an alternative to standard denotational truth-condition semantics. The workshop will focus mainly on proof systems, but we aim at touching several areas of proof-theoretical research.

The workshop will be framed in two six-hour tutorials, six one-hour lectures, and is open to half-hour contributed talks.

For more information, see the preliminary webpage at http://www.helsinki.fi/~negri/pswpt.html

This satellite workshop of LICS-2012 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.

For more information, see http://www.informatik.uni-bremen.de/~goeller/AISS12

The Student Session of the 24th European Summer School in Logic, Language, and Information (ESSLLI) will take place in Opole, Poland on August 6-17, 2012, to allow students to present original, unpublished work in any area at the intersection of Logic & Language, Language & Computation, or Logic & Computation.

For more information, see http://loriweb.org/ESSLLI2012StuS/ or contact esslli2012stus at loriweb.org.

The aim of this series of workshops is to bring together active researchers in the areas of logics and other formal frameworks that can be used to describe and analyse dynamic or mobile systems. The main focus is on the field of logics and calculi for mobile agents, and multi-agent systems, but contributions in the area of modelling and implemantation of location-based, or resource-based applications are equally welcome.

LAM'12 is organised as satellite workshop at the 33rd Conference on Theory and Application of Petri Nets and Concurrency. The workshop will be held as a one day event after the main conference. There will be a short introduction and brief survey of the field by the organisers as an introduction to the workshop. The workshop will contain invited talks, contributed talks, and will offer opportunities for discussion.

For more information, see http://lam12.wordpress.com/

Argumentation is an important and exciting research topic in artificial intelligence, with a broad spectrum of research activities ranging from theory to applications. The International Conference on Computational Models of Argument (COMMA) is a regular forum for presentation and exchange of the latest research results related to computational aspects of argumentation. After the successful editions in Liverpool (2006), Toulouse (2008) and Desenzano del Garda (2010), COMMA 2010 will be held in Vienna in September 2012.

For more information, see http://www.kr.tuwien.ac.at/events/comma2012/

Computational complexity theory has its origin in logic. The fundamental goal of this area is to understand the limits of efficient computation and the sources of intractability. The most famous open problem in the area is the P = NP-problem, listed among the seven Clay Millenium Prize problems. Logic provides a multifarious toolbox of techniques to analyse questions like this, some of which promise to provide deep insights in the nature and limits of efficient computation. In our workshop, we shall focus on logical descriptions of complexity, i.e. descriptive complexity, propositional proof complexity and bounded arithmetic.

The workshop will bring together leading researchers covering all research areas within the scope of the workshop. We will especially focus on work that draws on methods from the different areas which appeal to the whole community.

Deadline for application for participation: 26th January 2012 For more information, see http://www.newton.ac.uk/programmes/SAS/sasw01.html or contact a.beckmann at swansea.ac.uk.

Computational complexity theory has its origin in logic. The fundamental goal of this area is to understand the limits of efficient computation and the sources of intractability. The most famous open problem in the area is the P = NP-problem, listed among the seven Clay Millenium Prize problems. Logic provides a multifarious toolbox of techniques to analyse questions like this, some of which promise to provide deep insights in the nature and limits of efficient computation. In our workshop, we shall focus on logical descriptions of complexity, i.e. descriptive complexity, propositional proof complexity and bounded arithmetic.

The workshop will bring together leading researchers covering all research areas within the scope of the workshop. We will especially focus on work that draws on methods from the different areas which appeal to the whole community.

Deadline for application for participation: 26th January 2012 For more information, see http://www.newton.ac.uk/programmes/SAS/sasw01.html or contact a.beckmann at swansea.ac.uk.

Computational complexity theory has its origin in logic. The fundamental goal of this area is to understand the limits of efficient computation and the sources of intractability. The most famous open problem in the area is the P = NP-problem, listed among the seven Clay Millenium Prize problems. Logic provides a multifarious toolbox of techniques to analyse questions like this, some of which promise to provide deep insights in the nature and limits of efficient computation. In our workshop, we shall focus on logical descriptions of complexity, i.e. descriptive complexity, propositional proof complexity and bounded arithmetic.

The workshop will bring together leading researchers covering all research areas within the scope of the workshop. We will especially focus on work that draws on methods from the different areas which appeal to the whole community.

Deadline for application for participation: 26th January 2012 For more information, see http://www.newton.ac.uk/programmes/SAS/sasw01.html or contact a.beckmann at swansea.ac.uk.

Computational complexity theory has its origin in logic. The fundamental goal of this area is to understand the limits of efficient computation and the sources of intractability. The most famous open problem in the area is the P = NP-problem, listed among the seven Clay Millenium Prize problems. Logic provides a multifarious toolbox of techniques to analyse questions like this, some of which promise to provide deep insights in the nature and limits of efficient computation. In our workshop, we shall focus on logical descriptions of complexity, i.e. descriptive complexity, propositional proof complexity and bounded arithmetic.

The workshop will bring together leading researchers covering all research areas within the scope of the workshop. We will especially focus on work that draws on methods from the different areas which appeal to the whole community.

Deadline for application for participation: 26th January 2012 For more information, see http://www.newton.ac.uk/programmes/SAS/sasw01.html or contact a.beckmann at swansea.ac.uk.

Computational complexity theory has its origin in logic. The fundamental goal of this area is to understand the limits of efficient computation and the sources of intractability. The most famous open problem in the area is the P = NP-problem, listed among the seven Clay Millenium Prize problems. Logic provides a multifarious toolbox of techniques to analyse questions like this, some of which promise to provide deep insights in the nature and limits of efficient computation. In our workshop, we shall focus on logical descriptions of complexity, i.e. descriptive complexity, propositional proof complexity and bounded arithmetic.

The workshop will bring together leading researchers covering all research areas within the scope of the workshop. We will especially focus on work that draws on methods from the different areas which appeal to the whole community.

Deadline for application for participation: 26th January 2012 For more information, see http://www.newton.ac.uk/programmes/SAS/sasw01.html or contact a.beckmann at swansea.ac.uk.

Social and economic networks are everywhere: from Facebook to the more complex global financial network or to networks connecting economic agents or to other complex and dynamic economic networks. The study of these networks is crucial for both academics and policy makers and presents a host of new theoretical and econometric challenges. This conference will concentrate on studying the information and econometrics of networks.

More detailed information concerning the conference is available at: http://www.american.edu/cas/economics/info-metrics/workshop/

What role does the assumption of rationality play in communication? Game Theory provides a powerful tool for investigating this question. If agents are assumed to be perfectly rational, classical Game Theory can model linguistic tasks such as pragmatic interpretation as equilibrium calculations. If agents are assumed to be simple learners, then Evolutionary Game Theory can model the emergence of apparently rational signaling systems. However, real language users are neither perfectly rational, nor as simple as the agents in evolutionary games. This collection aims to explore models of communicative interaction which lie between these extremes.

We invite submissions which utilize the tools of Game Theory (broadly construed) in order to investigate the assumption of rationality (and its limits) in models of communication. Deadline for Submissions: March 31, 2012. Notification of Acceptance: May 31, 2012.

Editors: Alistair Isaac (Department of Philosophy, University of Pennsylvania) and Sven Lauer (Department of Linguistics, Stanford University). Papers prepared for blind review should be sent to aisaac at sas.upenn.edu.

Social and economic networks are everywhere: from Facebook to the more complex global financial network or to networks connecting economic agents or to other complex and dynamic economic networks. The study of these networks is crucial for both academics and policy makers and presents a host of new theoretical and econometric challenges. This conference will concentrate on studying the information and econometrics of networks.

More detailed information concerning the conference is available at: http://www.american.edu/cas/economics/info-metrics/workshop/

In more than a decade of research, it has been established that a wide variety of state-based dynamical systems, like transition systems, automata (including weighted and probabilistic variants), Markov chains, and game-based systems, can be treated uniformly as coalgebras. Coalgebra has developed into a field of its own interest presenting a deep mathematical foundation, a growing field of applications, and interactions with various other fields such as reactive and interactive system theory, object-oriented and concurrent programming, formal system specification, modal and description logics, artificial intelligence, dynamical systems, control systems, category theory, algebra, analysis, etc. The aim of the CMCS workshop series is to bring together researchers with a common interest in the theory of coalgebras, their logics, and their applications.

For more information, see http://www.coalg.org/cmcs12/