Humanist Discussion Group, Vol. 18, No. 637.
Centre for Computing in the Humanities, King's College London
www.kcl.ac.uk/humanities/cch/humanist/
www.princeton.edu/humanist/
Submit to: humanist_at_princeton.edu
[1] From: COSTA LEITE Alexandre <costaleite_at_gmail.com> (58)
Subject: School of Logic - Montreux - Switzerland
[2] From: lpnmr05.publicity_at_MAT.UNICAL.IT (58)
Subject: LPNMR'05: Submission Deadline Approaching
[3] From: Paola Bruscoli <Paola.Bruscoli_at_Inf.TU-Dresden.DE> (46)
Subject: Structures and Deduction Workshop 2nd cfp - ICALP'05
Satellite
--[1]------------------------------------------------------------------
Date: Wed, 16 Mar 2005 07:27:25 +0000
From: COSTA LEITE Alexandre <costaleite_at_gmail.com>
Subject: School of Logic - Montreux - Switzerland
FIRST WORLD SCHOOL ON UNIVERSAL LOGIC
Montreux - Switzerland, March 26-30, 2005
This unique event includes 21 tutorials on general techniques for the study=
=20
of logics. Note that 12 tutorials will be fully available during the Easter=
=20
week-end, Saturday 26th - Sunday 27 th - Monday 28th. The second series of=
=20
9 tutorials will be given on Tuesday 29th and Wednesday 30th.
See the detailed programme on the website www.uni-log.org
LIST OF THE 21 TUTORIALS
1. Combination of Logics - Carlos Caleiro - IST, Portugal
2. Introduction to Universal Logic - Jean-Yves Beziau - SNF, Switzerland
3. Abstract Model Theory - Marta Garcia-Matos - Helsinki, Finland
4. Tableaux Systems - Andreas Herzig - IRIT, France
5. Many-Valued Semantics - Walter Carnielli & Juliana Bueno - UNICAMP,=
Brazil
6. Abstract Proof Theory - Luiz Carlos Pereira & Ana Teresa Martins -
PUC/UFC, Brazil
7. Adaptive Logics - Diderik Batens & Joke Meheus - Ghent, Belgium
8. Kripke Structures - Darko Sarenac - Stanford, US
9. Category Theory and Logic - Andrei Rodin - ENS, Paris
10. Consequence Operators - Piotr Wojtylak - Katowice, Poland
11. Multiple-Conclusion Logics - Jo=E3o Marcos - IST, Portugal
12. Nonmonotonic Logics - David Makinson - King's College, London
13. Abstract Algebraic Logic - Josep Maria Font - Barcelona,Spain
14. Substructural Logics - Francesco Paoli - Cagliari, Italy
15. Universal Computation - Roberto Lins - Rio de Janeiro, Brazil
16. Labelled Deductive Systems - Luca Vigano - ETH, Zurich
17. Logics and Games - Jacques Duparc - Lausanne, Switzerland
18. Combinatory Logic and Lambda Calculus - Henri Volken - Lausanne,=20
Switzerland
19. Universal Algebra for Logics - Joanna Grygiel - Czestochowa, Poland
20. Fuzzy Logics - Petr H=E1jek and Petr Cintula - Academy of Sciences,=
Prague
21. Logics for semistructured data - Maarten Marx - Amsterdam, The=
Netherlands
The School will be followed by the
FIRST WORLD CONGRESS ON UNIVERSAL LOGIC
Montreux - Switzerland, March 31- April 3, 2005
Featuring 14 invited spakers (A.Avron, D.Batens, J.Czelakowski, K.Dosen,=20
M.Dunn,
D.Gabbay, R.Jansana, A.Koslow, V.de Paiva, K.Segerberg, J.Vaananen,=
V.Vasyukov,
Y.Venema, plus a mysterious secret speaker),
and more that 120 contributed talks.
A contest will also happen during this event.
See details at
www.uni-log.org
************************************************************************
Regular registration fees:
Congress only or School only: CHF 280 / USD 250 / Euro 190
Congress + School: CHF 380 / USD 330 / Euro 260
Reduced fees for students or people from countries with low currencies:
Half of the School (26-27-28 or 29-30): CHF 75 / USD 60 / Euro 50
School: CHF 150 / USD 130 / Euro 100
Congress: CHF 150 / USD 130 / Euro 100
Congress + School: CHF 200 / USD 180 / Euro 140
--[2]------------------------------------------------------------------
Date: Wed, 16 Mar 2005 07:33:42 +0000
From: lpnmr05.publicity_at_MAT.UNICAL.IT
Subject: LPNMR'05: Submission Deadline Approaching
Call for Papers
8th International Conference on Logic Programming
and Nonmonotonic Reasoning
(LPNMR'05)
Diamante, Cosenza, Italy
September 5-8, 2005
http://www.mat.unical.it/lpnmr05/
LPNMR'05 is the eighth in the series of international meetings on logic
programming and nonmonotonic reasoning. Seven previous meetings were held
in Washington, D.C., (1991), in Lisbon, Portugal (1993), in Lexington,
Kentucky (1995), in Dagstuhl, Germany (1997), in El Paso, Texas (1999),
in Vienna, Austria (2001), and in Fort Lauderdale, Florida (2004).
LPNMR'05 will be organized by the Department of Mathematics of University
of Calabria (Italy), and will be co-located with the INFOMIX Workshop
on Data Integration.
The proceedings of the conference will be published by Springer -
Lecture Notes in Artificial Intelligence series (to be verified).
AIMS AND SCOPE
--------------
LPNMR is a forum for exchanging ideas on declarative logic programming,
nonmonotonic reasoning and knowledge representation. The aim of the conference
is to facilitate interactions between researchers interested in the design
and implementation of logic based programming languages and database systems,
and researchers who work in the areas of knowledge representation and
nonmonotonic reasoning. LPNMR strives to encompass these theoretical and
exprimental studies that lead to the construction of practical systems
for declarative programming and knowledge representation.
Authors are invited to submit papers presenting original and unpublished
research on nonmonotonic aspects of logic programming and knowledge
representation. We particularly encourage papers on application of LPNMR
techniques to build significant applications.
A non-exhaustive list of topics of interest includes:
1. Development and mathematical studies of logical systems
with nonmonotonic entailment relations:
- Semantics of new and existing languages;
- Relationships between formalisms;
- Complexity and expressive power;
- Development of inference algorithms and search heuristics for
LPNMR systems;
- Extensions of ''classical'' LPNMR languages by new logical
connectives and new inference capabilities such as abduction,
reasoning by cases, etc;
- Updates and other operations on LPNMR systems;
- Uncertainty in LPNMR systems.
2. Implementation of LPNMR systems:
- system descriptions, comparisons, evaluations;
- LPNMR benchmarks.
3. Applications of LPNMR systems:
- LPNMR languages and algorithms in planning, diagnosis,
software engineering, decision making, and other domains;
- Applications of LPNMR languages in Data Integration and Exchange
systems;
- Methodology of representing knowledge in LPNMR languages:
theory and practice;
- Integration of LPNMR systems with other computational
paradigms;
- Embedded LPNMR systems: Systems using LPNMR subsystems.
[...]
--[3]------------------------------------------------------------------
Date: Wed, 16 Mar 2005 07:34:22 +0000
From: Paola Bruscoli <Paola.Bruscoli_at_Inf.TU-Dresden.DE>
Subject: Structures and Deduction Workshop 2nd cfp - ICALP'05
Satellite
(ICALP Workshop-Lisbon July 16-17, 2005)
STRUCTURES AND DEDUCTION
The quest for the essence of proofs
http://www.prooftheory.org/sd05
Submissions page is now open!
http://www.easychair.org/SD05/submit/
This meeting is about new algebraic and geometric methods in proof
theory, with the aim of expanding our ability to manipulate proofs,
eliminate bureaucracy from deductive systems, and ultimately provide:
1) a satisfying answer to the problem of identity of proofs and 2)
tools for improving our ability to implement logics.
Stimulated by computer science, proof theory is progressing at fast
pace. However, it is becoming very technical, and runs the risk of
splitting into esoteric specialties. The history of science tells us
that this has happened several times before, and that these
centrifugal tendencies are very often countered by conceptual
reunifications, which occur when one is looking at a field after
having taken a few steps back.
Some emerging ideas are showing their unifying potential. Deep
inference's atomization of deductions simplifies and unifies the
design of deduction systems; it provides unprecedented plasticity to
proofs and has injected new impetus into the theory of proof nets.
New proof nets, and new associated semantics, are giving surprising
insight about the very subtle relationship between categories and
proofs, for example in the formerly intractable case of classical
logic. The field of deduction modulo, which turns out to be very much
in the spirit of deep inference, decreases our dependency on the
syntactic presentation of functional objects, and brings us closer to
their intrinsic nature, even from the computational point of view.
After studying all those trees for years we at last have the
impression of looking at the forest.
The core topics are organised along the axis:
algebraic semantics deduction
of proofs deep inference modulo
game semantics operads and specification
<--> structads <-->
proof nets proof search
calculus of
deductive structures implementations
proof nets
This workshop aims at being a meeting point for all those who are
interested in decreasing the dependency of logic from low-level
syntax. The list of topics above is not exhaustive: if you feel you
can contribute to the discussion along the broad lines outlined above,
please submit your contribution.
[...]
Received on Wed Mar 16 2005 - 02:54:13 EST
This archive was generated by hypermail 2.2.0 : Wed Mar 16 2005 - 02:54:14 EST