Navya-Nyaya is an offshoot of the Nyaya system which was originally intended to be a comprehensive philosophy having an ontology of its own. The logical apparatus and the analysis of language developed by the Nyaya system were originally devised to lend support to this ontology. But the Nyaya techniques of drawing conclusions from given premises and the Nyaya way of analyzing language were borrowed by the other systems of Indian philosophy. This suggests that the Nyaya system has a formal core which is relatively, if not absolutely, independent of its ontological commitments and can be applied to entirely different contexts.

This conference is homage to Bimal Krishna Matilal who was one of the few thinkers who devoted major part of his philosophical career to initiating meaningful dialogues between the philosophical traditions of the East and the West. The main objective of his studying an ancient Indian system such as Navya-Nyaya was to explain its significance and relevance to modern discussions in the area called "philosophical logic". Issues in philosophical logic like those of ontological commitments, existence and truth are also addressed by Navya-Nyaya. This opens up the possibility of an interface between the approaches and conclusions of the different traditions.

For more information, see http://philosophy-ju.org/news&announce/ or contact Prof Dr Mihir Chakraborty at mihirc99 at vsnl.com.

Navya-Nyaya is an offshoot of the Nyaya system which was originally intended to be a comprehensive philosophy having an ontology of its own. The logical apparatus and the analysis of language developed by the Nyaya system were originally devised to lend support to this ontology. But the Nyaya techniques of drawing conclusions from given premises and the Nyaya way of analyzing language were borrowed by the other systems of Indian philosophy. This suggests that the Nyaya system has a formal core which is relatively, if not absolutely, independent of its ontological commitments and can be applied to entirely different contexts.

This conference is homage to Bimal Krishna Matilal who was one of the few thinkers who devoted major part of his philosophical career to initiating meaningful dialogues between the philosophical traditions of the East and the West. The main objective of his studying an ancient Indian system such as Navya-Nyaya was to explain its significance and relevance to modern discussions in the area called "philosophical logic". Issues in philosophical logic like those of ontological commitments, existence and truth are also addressed by Navya-Nyaya. This opens up the possibility of an interface between the approaches and conclusions of the different traditions.

For more information, see http://philosophy-ju.org/news&announce/ or contact Prof Dr Mihir Chakraborty at mihirc99 at vsnl.com.

The 15th International Conference on Conceptual Structures (ICCS 2007) is the latest in a series of annual conferences that have been held in Europe, Australia, and North America since 1993. The focus of these conferences has been the representation and analysis of conceptual knowledge for research and business applications. ICCS brings together researchers in information technology, arts, humanities and social science to explore novel ways that can conceptual structures can be employed in information systems.

ICCS 2007's theme is "Conceptual Structures: Knowledge Architectures for Smart Applications". From these architectures, smart applications arise that allow enterprises to share meaning with its interconnected computing resources, and realise transactions that would otherwise remain as lost business opportunities. Conceptual structures and smart applications integrate the creativity of individuals and organisations with the productivity of computers for a meaningful digital future.

For more information, see http://www.iccs.info/

The 28th annual international Petri Net conference and tutorials will be organised by the Institute of Computer Science at the University of Podlasie and Institute of Computer Science of the Polish Academy of Sciences.

For more information, see http://atpn2007.ap.siedlce.pl.

Navya-Nyaya is an offshoot of the Nyaya system which was originally intended to be a comprehensive philosophy having an ontology of its own. The logical apparatus and the analysis of language developed by the Nyaya system were originally devised to lend support to this ontology. But the Nyaya techniques of drawing conclusions from given premises and the Nyaya way of analyzing language were borrowed by the other systems of Indian philosophy. This suggests that the Nyaya system has a formal core which is relatively, if not absolutely, independent of its ontological commitments and can be applied to entirely different contexts.

This conference is homage to Bimal Krishna Matilal who was one of the few thinkers who devoted major part of his philosophical career to initiating meaningful dialogues between the philosophical traditions of the East and the West. The main objective of his studying an ancient Indian system such as Navya-Nyaya was to explain its significance and relevance to modern discussions in the area called "philosophical logic". Issues in philosophical logic like those of ontological commitments, existence and truth are also addressed by Navya-Nyaya. This opens up the possibility of an interface between the approaches and conclusions of the different traditions.

For more information, see http://philosophy-ju.org/news&announce/ or contact Prof Dr Mihir Chakraborty at mihirc99 at vsnl.com.

Navya-Nyaya is an offshoot of the Nyaya system which was originally intended to be a comprehensive philosophy having an ontology of its own. The logical apparatus and the analysis of language developed by the Nyaya system were originally devised to lend support to this ontology. But the Nyaya techniques of drawing conclusions from given premises and the Nyaya way of analyzing language were borrowed by the other systems of Indian philosophy. This suggests that the Nyaya system has a formal core which is relatively, if not absolutely, independent of its ontological commitments and can be applied to entirely different contexts.

This conference is homage to Bimal Krishna Matilal who was one of the few thinkers who devoted major part of his philosophical career to initiating meaningful dialogues between the philosophical traditions of the East and the West. The main objective of his studying an ancient Indian system such as Navya-Nyaya was to explain its significance and relevance to modern discussions in the area called "philosophical logic". Issues in philosophical logic like those of ontological commitments, existence and truth are also addressed by Navya-Nyaya. This opens up the possibility of an interface between the approaches and conclusions of the different traditions.

For more information, see http://philosophy-ju.org/news&announce/ or contact Prof Dr Mihir Chakraborty at mihirc99 at vsnl.com.

Artificial Intelligence researchers continue to face huge challenges in their quest to develop truly intelligent systems. The recent developments in the field of neural-symbolic integration bring an opportunity to integrate well-founded symbolic artificial intelligence with robust neural computing machinery to help tackle some of these challenges.

For more information, see http://www.neural-symbolic.org/NeSy07/

Artificial Intelligence researchers continue to face huge challenges in their quest to develop truly intelligent systems. The recent developments in the field of neural-symbolic integration bring an opportunity to integrate well-founded symbolic artificial intelligence with robust neural computing machinery to help tackle some of these challenges.

For more information, see http://www.neural-symbolic.org/NeSy07/

Artificial Intelligence researchers continue to face huge challenges in their quest to develop truly intelligent systems. The recent developments in the field of neural-symbolic integration bring an opportunity to integrate well-founded symbolic artificial intelligence with robust neural computing machinery to help tackle some of these challenges.

For more information, see http://www.neural-symbolic.org/NeSy07/

Artificial Intelligence researchers continue to face huge challenges in their quest to develop truly intelligent systems. The recent developments in the field of neural-symbolic integration bring an opportunity to integrate well-founded symbolic artificial intelligence with robust neural computing machinery to help tackle some of these challenges.

For more information, see http://www.neural-symbolic.org/NeSy07/

Artificial Intelligence researchers continue to face huge challenges in their quest to develop truly intelligent systems. The recent developments in the field of neural-symbolic integration bring an opportunity to integrate well-founded symbolic artificial intelligence with robust neural computing machinery to help tackle some of these challenges.

For more information, see http://www.neural-symbolic.org/NeSy07/

The theme of the conference will be algorithmic randomness and related topics in logic, computability and complexity. The program will consist of invited talks, contributed talks and discussions. The meeting is sponsored by the Association for Symbolic Logic.

For more information, see http://www.dc.uba.ar/people/logic2007/

Artificial Intelligence researchers continue to face huge challenges in their quest to develop truly intelligent systems. The recent developments in the field of neural-symbolic integration bring an opportunity to integrate well-founded symbolic artificial intelligence with robust neural computing machinery to help tackle some of these challenges.

For more information, see http://www.neural-symbolic.org/NeSy07/

The theme of the conference will be algorithmic randomness and related topics in logic, computability and complexity. The program will consist of invited talks, contributed talks and discussions. The meeting is sponsored by the Association for Symbolic Logic.

For more information, see http://www.dc.uba.ar/people/logic2007/

CiE is a European network of mathematicians, logicians, computer scientists, philosophers, theoretical physicists and others interested in new developments in computability and in their underlying significance for the real world.

CiE 2007 will address various aspects of the ways computability and theoretical computer science enable scientists and philosophers to deal with mathematical and real world issues, ranging through problems related to logic, mathematics, physical processes, real computation and learning theory. At the same time it will focus on different ways in which computability emerges from the real world, and how this affects our way of thinking about everyday computational issues.

CiE 2007 will be co-located with the annual CCA (Computability and Complexity in Analysis) Conference

For more information, an online registration form and a preliminary program, see http://www.mat.unisi.it/newsito/cie07.html

Artificial Intelligence researchers continue to face huge challenges in their quest to develop truly intelligent systems. The recent developments in the field of neural-symbolic integration bring an opportunity to integrate well-founded symbolic artificial intelligence with robust neural computing machinery to help tackle some of these challenges.

For more information, see http://www.neural-symbolic.org/NeSy07/

The theme of the conference will be algorithmic randomness and related topics in logic, computability and complexity. The program will consist of invited talks, contributed talks and discussions. The meeting is sponsored by the Association for Symbolic Logic.

For more information, see http://www.dc.uba.ar/people/logic2007/

The theme of the conference will be algorithmic randomness and related topics in logic, computability and complexity. The program will consist of invited talks, contributed talks and discussions. The meeting is sponsored by the Association for Symbolic Logic.

For more information, see http://www.dc.uba.ar/people/logic2007/

The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic broadly construed. LICS 2007 will be held in the Institute of Computer Science, University of Wroclaw, Poland, from 10th July to 14th July 2007. It will be colocated with two other meetings: the International Colloquium on Automata, Languages, and Programming (ICALP'07) July 9-13, 2007, and also the European Logic Colloquium (ELC 2007), July 14-19. Workshops are planned for July 8, 9 and July 15 (possibly the afternoon of 14th).

For more information, see http://www2.informatik.hu-berlin.de/lics/lics07/.

The annual Symposium on Principles of Programming Languages is a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Both experimental and theoretical papers are welcome.

For more information, see http://www.cse.ucsd.edu/popl/07/

The annual Symposium on Principles of Programming Languages is a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Both experimental and theoretical papers are welcome.

For more information, see http://www.cse.ucsd.edu/popl/07/

EWSCS is a series of regional-scope international winter schools held annually in Estonia. EWSCS are organized by Institute of Cybernetics (IoC), a research institute of Tallinn University of Technology. EWSCS '07 is the twelfth event of the series.

The main objective of EWSCS is to expose Estonian, Baltic, and Nordic graduate students in computer science (but also interested students from elsewhere) to frontline research topics usually not covered within the regular curricula. The subject of the schools is general computer science, with a bias towards theory, this comprising both algorithms, complexity and models of computation, and semantics, logic and programming theory. The working language of the schools is English.

The deadline for application and submission of abstracts is 19 January 2007. Details on the application procedure and cost are available from the school webpage, http://cs.ioc.ee/yik/schools/win2007/. Questions should be sent to ewscs07 at cs.ioc.ee.

Starting from very different motivations, various groups of mathematicians and computer scientists have sought to describe abstract structures in great generality. This parallel evolutionary process has led to various groups of researchers working on highly interrelated areas, though unable to effectively communicate with each other due to vastly differing languages.

This workshop aims to bring together researchers working in category theory, universal algebra, logic and their applications to computer science in order to highlight recent advances in these fields and to facilitate dialogue between the different camps. Of particular interest is work which spans two or more of these areas.

Deadline for registration: 2nd February 2007 For more information, see http://usmc07.rsise.anu.edu.au/

Following the workshop "Formal Ontologies for Communicating Agents" that took place within the last ESSLLI summer school in Malaga, we would like to invite contributions for a special issue of the international journal ''Applied Ontology''. We especially invite the authors of the paper presented at FOCA 2006 to submit an extended version of their contribution. However, anyone is invited to submit a relevant contribution for the topic of the special issue described below.

Deadline (extended) is January 19, 2007. For more information, see http://www.applied-ontology.org/ or here.

The annual Symposium on Principles of Programming Languages is a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Both experimental and theoretical papers are welcome.

For more information, see http://www.cse.ucsd.edu/popl/07/

On Friday January 19th 2007 there will be a small workshop organized by the Dutch Logic Society on "Logics for Interacting Agents" linked to the interdisciplinairy NIAS-project 'Games, Action and Social Software' (http://www.nias.knaw.nl/en/research_group_2006_07/nucleus/).

The meeting takes place in the Regardz Meeting Center La Vie Utrecht (Lange Viestraat 351, 3511BK Utrecht). This is a short walk from the Central Station.

For more information, see http://www.verenigingvoorlogica.nl/activiteiten/2007/agents.html

Papers are invited to a special issue of the Journal of Logic, Language and Information, based on an ESSLLI 2006 workshop on logics for resource-bounded agents. Deadline 20/01/2007.

For more information, see here or contact nza at cs.nott.ac.uk

Confirmed speakers include Carl Jockusch, Julia Knight, Manuel Lerman, Anil Nerode, Gerald Sacks, Stephen Simpson, Theodore Slaman and Robert Soare.

For more information, see http://www.math.uwaterloo.ca/~csima/shore/

Recent years saw the emergence of Ordinal Computability - the generalization of standard computability theory to ordinal time or ordinal space. Ordinal computability theory links computability, complexity, descriptive set theory, constructibility theory and other fields in innovative and fruitful ways.

The Bonn International Workshop on Ordinal Computability BIWOC aims at bringing together specialists, interested graduate students, and representatives from neighbouring fields. The program will consist of morning talks which will represent the current spectrum of ordinal machine models and identify relevant research questions and projects. Afternoons will be reserved for informal discussions, collaborations, and presentations. We expect that some progress may already be reported at an open session at the end of the workshop.

For more information, see http://www.math.uni-bonn.de/people/logic/biwoc/

Confirmed speakers include Carl Jockusch, Julia Knight, Manuel Lerman, Anil Nerode, Gerald Sacks, Stephen Simpson, Theodore Slaman and Robert Soare.

For more information, see http://www.math.uwaterloo.ca/~csima/shore/

Recent years saw the emergence of Ordinal Computability - the generalization of standard computability theory to ordinal time or ordinal space. Ordinal computability theory links computability, complexity, descriptive set theory, constructibility theory and other fields in innovative and fruitful ways.

The Bonn International Workshop on Ordinal Computability BIWOC aims at bringing together specialists, interested graduate students, and representatives from neighbouring fields. The program will consist of morning talks which will represent the current spectrum of ordinal machine models and identify relevant research questions and projects. Afternoons will be reserved for informal discussions, collaborations, and presentations. We expect that some progress may already be reported at an open session at the end of the workshop.

For more information, see http://www.math.uni-bonn.de/people/logic/biwoc/

Recent years saw the emergence of Ordinal Computability - the generalization of standard computability theory to ordinal time or ordinal space. Ordinal computability theory links computability, complexity, descriptive set theory, constructibility theory and other fields in innovative and fruitful ways.

The Bonn International Workshop on Ordinal Computability BIWOC aims at bringing together specialists, interested graduate students, and representatives from neighbouring fields. The program will consist of morning talks which will represent the current spectrum of ordinal machine models and identify relevant research questions and projects. Afternoons will be reserved for informal discussions, collaborations, and presentations. We expect that some progress may already be reported at an open session at the end of the workshop.

For more information, see http://www.math.uni-bonn.de/people/logic/biwoc/

Recent years saw the emergence of Ordinal Computability - the generalization of standard computability theory to ordinal time or ordinal space. Ordinal computability theory links computability, complexity, descriptive set theory, constructibility theory and other fields in innovative and fruitful ways.

The Bonn International Workshop on Ordinal Computability BIWOC aims at bringing together specialists, interested graduate students, and representatives from neighbouring fields. The program will consist of morning talks which will represent the current spectrum of ordinal machine models and identify relevant research questions and projects. Afternoons will be reserved for informal discussions, collaborations, and presentations. We expect that some progress may already be reported at an open session at the end of the workshop.

For more information, see http://www.math.uni-bonn.de/people/logic/biwoc/

AutoMathA 2007 is the main conference of the programme AutoMathA of the European Science Foundation. This five-year multidisciplinary programme (2005-2010), at the crossroads of mathematics, theoretical computer science and applications, gathers 14 European countries. The goal of AutoMathA is to propose a set of co-ordinated actions for advancing the theory of automata and for increasing its application to challenging scientific problems.

For more information, see http://www.math.unipa.it/~ama07/

Recent years saw the emergence of Ordinal Computability - the generalization of standard computability theory to ordinal time or ordinal space. Ordinal computability theory links computability, complexity, descriptive set theory, constructibility theory and other fields in innovative and fruitful ways.

The Bonn International Workshop on Ordinal Computability BIWOC aims at bringing together specialists, interested graduate students, and representatives from neighbouring fields. The program will consist of morning talks which will represent the current spectrum of ordinal machine models and identify relevant research questions and projects. Afternoons will be reserved for informal discussions, collaborations, and presentations. We expect that some progress may already be reported at an open session at the end of the workshop.

For more information, see http://www.math.uni-bonn.de/people/logic/biwoc/

The International Conference on Rewriting Techniques and Applications RTA is the major forum for the presentation of research on all aspects of rewriting. The 18th Conference (RTA'07) is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP'07), which comprises, in addition to RTA'07, the conference on Typed Lambda Calculi and Applications (TLCA'07) and eight workshops (HOR, PATE, RULE, SecReT, UNIF, WFLP, WRS, and WST).

For more information, see http://www.lsv.ens-cachan.fr/rdp07/rta.html

CATS is the premier theoretical computer science conference in Australasia. It is held annually as part of Australasian Computer Science Week (ASCW) which comprises many other conferences and is overseen by the Computer Research and Education Association (CORE).

For more information, see http://www-staff.it.uts.edu.au/~cbj/cats07/

The mission of the TARK conferences is to bring together researchers from a wide variety of fields, including Artificial Intelligence, Cryptography, Distributed Computing, Economics and Game Theory, Linguistics, Philosophy, and Psychology, in order to further our understanding of interdisciplinary issues involving reasoning about rationality and knowledge. Topics of interest include, but are not limited to, semantic models for knowledge, belief, and uncertainty, bounded rationality and resource-bounded reasoning, commonsense epistemic reasoning, epistemic logic, knowledge and action, applications of reasoning about knowledge and other mental states, belief revision, and foundations of multi-agent systems.

For more information, see http://www.info.fundp.ac.be/~pys/TARK07/.

CATS is the premier theoretical computer science conference in Australasia. It is held annually as part of Australasian Computer Science Week (ASCW) which comprises many other conferences and is overseen by the Computer Research and Education Association (CORE).

For more information, see http://www-staff.it.uts.edu.au/~cbj/cats07/

The Call for Nominations for the 8th Donald E Knuth Prize for outstanding contributions to the foundations of computer science can be found at http://sigact.acm.org/prizes/knuth/. The Deadline for nominations is January 31, 2007.

Group decision-making problems occur every time a collective choice has to be made from several individuals that have conflicting interests or preferences. There has been recently a growing interest on the use of logic as the basic tool for formalizing and computing those problems. This is in particular true in two close fields of research. The first one lies at the intersection of game theory and logics, especially by exploring how modal logics may be used to model and reason about games. A second one, which focuses on the logical insights into rational collective choice, has recently emerged around problems of judgment aggregation and beliefs/goals merging, on the one hand, and logical formalization of welfare distribution processes (social software), on the other. These two domains propose further formal refinements, using logical tools, of the classical theories of collective decision-making, by offering new evaluation criteria of and new ways of building social choice procedures. The workshop aims at sparking off interaction between social choice theorists, computer scientists, logicians and philosophers.

For more information, see https://www.illc.uva.nl/LCD07/ or contact us via lcd07 at hotmail.fr.

Recent years have witnessed increased research activity on the interface between logic and universal algebra. In particular, the use of algebraic methods has proved to be fruitful in the study of non-classical logics -- such as modal logic, fuzzy logic, and substructural logics -- and ordered structures play a central role in this relationship. The purpose of the conference is to bring together researchers from these fields to foster collaboration and further research.

For more information, see http://www.math.vanderbilt.edu/~oal2007/

CATS is the premier theoretical computer science conference in Australasia. It is held annually as part of Australasian Computer Science Week (ASCW) which comprises many other conferences and is overseen by the Computer Research and Education Association (CORE).

For more information, see http://www-staff.it.uts.edu.au/~cbj/cats07/