CSL 2017: 2nd Call for papers

Dale Miller <[email protected]> Thu, 19 Jan 2017 11:50:54 +0100
Newsgroups gmane.comp.lang.lambda-prolog
Message-ID <CAGbLtfgfGR1rPWc_viizMwudA1X2pJaNJj+Vto9HcGfqqV3Uag@mail.gmail.com>
--===============1485257705==
Content-Type: multipart/alternative; boundary=001a113e012ac2b60e0546704e58

--001a113e012ac2b60e0546704e58
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

SECOND CALL FOR PAPERS
26th EACSL Annual Conference on Computer Science Logic  CSL2017
August 20 -- 24, 2017, Stockholm, Sweden
https://www.csl17.conf.kth.se


AIM AND SCOPE
Computer Science Logic (CSL) is the annual conference of the European
Association for Computer Science Logic (EACSL). It is an interdisciplinary
conference, spanning across both basic and application oriented research in
mathematical logic and computer science and is intended for computer
scientists whose research involves logic, as well as for logicians working
on issues essential for computer science.

CSL2017 is the 26th EACSL annual conference. It will be co-organised by
Stockholm University and KTH Royal Institute of Technology, and hosted by
Stockholm University. CSL2017 will be co-located with, and immediately
preceded by, the Logic Colloquium 2017 (LC2017). There will be a joint
session of CSL2017 and LC2017 in the morning of August 20, as well as
CSL-affiliated workshops during August 25-26.


IMPORTANT DATES:
------------------------------------------------------------
-----------------
Abstract submission for contributed papers: March 24, 2017
Paper submission: March 31, 2017
Notification: May 31, 2017
Abstract submission for short presentations: June 4, 2017
Notification on short presentations: June 14, 2017
---------------------------------------------------------------------------=
-


TOPICS OF INTEREST for CSL2017 include (but are not limited to):
------------------------------------------------------------
-----------------
 =E2=80=A2  automata and games, game semantics
 =E2=80=A2  automated deduction and interactive theorem proving
 =E2=80=A2  bounded arithmetic and propositional proof complexity
 =E2=80=A2  categorical logic and topological semantics
 =E2=80=A2  computational proof theory
 =E2=80=A2  constructive mathematics and type theory
 =E2=80=A2  decision procedures
 =E2=80=A2  domain theory
 =E2=80=A2  equational logic and rewriting
 =E2=80=A2  finite model theory
 =E2=80=A2  higher-order logic
 =E2=80=A2  lambda calculus and combinatory logic
 =E2=80=A2  linear logic and other substructural logics
 =E2=80=A2  logic programming and constraints
 =E2=80=A2  logical aspects of computational complexity
 =E2=80=A2  logical aspects of quantum computing
 =E2=80=A2  logic in database theory
 =E2=80=A2  logical foundations of programming paradigms
 =E2=80=A2  logical foundations of cryptography and information hiding
 =E2=80=A2  logics for multi-agent systems
 =E2=80=A2  modal and temporal logic
 =E2=80=A2  model checking and logic-based verification
 =E2=80=A2  nonmonotonic reasoning
 =E2=80=A2  SAT solving and automated induction
 =E2=80=A2  satisfiability modulo theories
 =E2=80=A2  specification, extraction and transformation of programs
 =E2=80=A2  verification and program analysis
 -----------------------------------------------------------
------------------


INVITED SPEAKERS
------------------------------
LC-CSL joint session highlight speakers:
Phokion Kolaitis, University of California Santa Cruz and IBM Research -
Almaden
Wolfgang Thomas, RWTH Aachen

CSL plenary speakers:
Laura Kov=C3=A1cs, Vienna University of Technology
Stephan Kreutzer, Technische Universit=C3=A4t Berlin
Meena Mahajan, Institute of Mathematical Sciences, Chennai
Margus Veanes, Microsoft Research


SPECIAL AND AFFILIATED EVENTS
--------------------------------------------------
In addition to the plenary and contributed talks CSL2017, the conference
will also include the following events:
 =E2=80=A2 Joint session of CSL2017 and LC2017 in the morning of August 20,
consisting of four plenary highlight talks, offered by speakers from both
conferences.
 =E2=80=A2  Presentation of the Alonzo Church award for Outstanding Contrib=
utions
to Logic and Computation,
 =E2=80=A2  Presentation of the EACSL Ackermann award for Outstanding Disse=
rtation
on Logic in Computer Science,
 =E2=80=A2  CSL-affiliated workshops, to be held as co-located events on Au=
gust 25
and (possibly) 26, including:
    =E2=80=A2  Workshop on Logical Aspects of Multi-Agent Systems LAMAS2017=
 (August
 25)
    =E2=80=A2  Workshop on Logic and Automata Theory (in memory of Zoltan E=
zik)
(August  25)
    =E2=80=A2  Workshop on Logic and Algorithms in Computational Linguistic=
s
LACompLing'17 (August  26)


SUBMISSIONS
---------------------
The CSL2017 conference proceedings will be published in Leibniz
International Proceedings in Informatics (LIPIcs).

Authors are invited to submit contributed papers of no more than 15 pages
in LIPIcs style (including references), presenting not previously published
 work, fitting the scope of the conference.

The submission of contributed papers will be in two stages:
* abstracts, due by March 24, 2017 (AoE);
* full papers, due by March 31, 2017 (AoE).

The submissions must be done via the EasyChair page for the conference:
https://easychair.org/conferences/?conf=3Dcsl2017.

Submitted papers must be in English and must provide sufficient detail to
allow the Programme Committee to assess the merits of the paper. Full
proofs may appear in a clearly marked technical appendix which will be read
at the reviewers' discretion.  Authors are strongly encouraged to include a
well written introduction which is directed at all members of the PC.

Papers may not be submitted concurrently to another conference with
refereed proceedings. The PC chairs should be informed of closely related
work submitted to a conference or a journal. Papers authored or co-authored
by members of the PC are not allowed.

In addition, there will be an opportunity for short oral presentations at
the conference. Abstracts for such oral presentations must be submitted
through the Easychair submission webpage, under the category ``short
presentations'', by June 4, 2017. They will not be included in the
proceedings.


PROGRAMME COMMITTEE
-------------------
=E2=80=A2 Parosh Aziz Abdulla (University of Uppsala),
=E2=80=A2 Lars Birkedal (University of Aarhus),
=E2=80=A2 Nikolaj Bjorner (Microsoft Research),
=E2=80=A2 Maria Paola Bonacina (Universit=C3=A0 degli Studi di Verona),
=E2=80=A2 Patricia Bouyer-Decitre (LSV, ENS Cachan),
=E2=80=A2 Agata Ciabattoni (University of Viena),
=E2=80=A2 Thierry Coquand (University of Gothenburg),
=E2=80=A2 Mads Dam (KTH, Stockholm), PC co-chair
=E2=80=A2 Ugo Dal Lago (University of Bologna),
=E2=80=A2 Anuj Dawar (Cambridge University),
=E2=80=A2 Valentin Goranko (Stockholm University), PC co-chair
=E2=80=A2 Maribel Fernandez (King's College London),
=E2=80=A2 Martin Grohe (RWTH Aachen),
=E2=80=A2 Lauri Hella (University of Tampere),
=E2=80=A2 Joost-Pieter Katoen (RWTH Aachen),
=E2=80=A2 Orna Kupferman (University of Jerusalem),
=E2=80=A2 Leonid Libkin (University of Edinburgh),
=E2=80=A2 Angelo Montanari (University of Udine),
=E2=80=A2 Catuscia Palamidessi (Paris, INRIA),
=E2=80=A2 Frank Pfenning (Carnegie Mellon University, Pittsburgh)
=E2=80=A2 Ram Ramanujam (Institute of Mathematical Sciences, Chennai),
=E2=80=A2 Jean-Francois Raskin (University of Bruxelles),
=E2=80=A2 Thomas Schwentick (TU Dortmund University),
=E2=80=A2 Viorica Sofronie-Stokkermans (University of Koblenz-Landau),
=E2=80=A2 Thomas Streicher (University of Darmstadt),
=E2=80=A2 Jean-Marc Talbot (University of Aix-Marseille),
=E2=80=A2 Luca Vigan=C3=B2 (King's College London),
=E2=80=A2 Ron van der Meyden (UNSW Australia),
=E2=80=A2 Lijun Zhang (Chinese Academy of Sciences, Beijing).


ORGANISING COMMITTEE
--------------------
=E2=80=A2 Mads Dam (OC co-chair), Department of Theoretical Computer Scienc=
e, KTH
=E2=80=A2 Valentin Goranko (OC co-chair), Department of Philosophy, Stockho=
lm
University
=E2=80=A2 Dilian Gurov (Workshops chair), Department of Theoretical Compute=
r
Science, KTH
=E2=80=A2 Roussanka Loukanova, Department of Mathematics, Stockholm Univers=
ity
=E2=80=A2 Peter LeFanu Lumsdaine, Department of Mathematics, Stockholm Univ=
ersity
=E2=80=A2 Anders Lundstedt, Department of Philosophy, Stockholm University
=E2=80=A2 Erik Palmgren (OC co-chair), Department of Mathematics, Stockholm
University
=E2=80=A2 Henning Strandin, Department of Philosophy, Stockholm University


CONTACTS AND ENQUIRIES:
--------------------
With enquiries on organising matters, send email to: csl2017<at>
philosophy.su.se
With enquiries on scientific and programme issues, send email to:
csl2017pc<at>gmail.com

--001a113e012ac2b60e0546704e58
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><div class=3D"gmail_quote"><div style=3D"word-wrap:break-w=
ord"><div><div><div>SECOND CALL FOR PAPERS=C2=A0</div><div><div>26th EACSL =
Annual Conference on Computer Science Logic =C2=A0CSL2017<br>August 20 -- 2=
4, 2017, Stockholm, Sweden <br><a href=3D"https://www.csl17.conf.kth.se" ta=
rget=3D"_blank">https://www.csl17.conf.kth.se</a><br><br><br>AIM AND SCOPE =
<br>Computer Science Logic (CSL) is the annual conference of the European A=
ssociation for Computer Science Logic (EACSL). It is an interdisciplinary c=
onference, spanning across both basic and application oriented research in =
mathematical logic and computer science and is intended for computer scient=
ists whose research involves logic, as well as for logicians working on iss=
ues essential for computer science. <br><br>CSL2017 is the 26th EACSL annua=
l conference. It will be co-organised by Stockholm University and KTH Royal=
 Institute of Technology, and hosted by Stockholm University. CSL2017 will =
be co-located with, and immediately preceded by, the Logic Colloquium 2017 =
(LC2017). There will be a joint session of CSL2017 and LC2017 in the mornin=
g of August 20, as well as CSL-affiliated workshops during August 25-26.<br=
><br><br>IMPORTANT DATES: =C2=A0=C2=A0=C2=A0<br>---------------------------=
---<wbr>------------------------------<wbr>-----------------<br>Abstract su=
bmission for contributed papers: March 24, 2017<br>Paper submission: March =
31, 2017<br>Notification: May 31, 2017<br>Abstract submission for short pre=
sentations: June 4, 2017<br>Notification on short presentations: June 14, 2=
017<br>------------------------------<wbr>------------------------------<wb=
r>----------------<br><br><br>TOPICS OF INTEREST for CSL2017 include (but a=
re not limited to):<br>------------------------------<wbr>-----------------=
-------------<wbr>-----------------<br> =C2=A0=E2=80=A2 =C2=A0automata and =
games, game semantics<br> =C2=A0=E2=80=A2 =C2=A0automated deduction and int=
eractive theorem proving<br> =C2=A0=E2=80=A2 =C2=A0bounded arithmetic and p=
ropositional proof complexity<br> =C2=A0=E2=80=A2 =C2=A0categorical logic a=
nd topological semantics <br> =C2=A0=E2=80=A2 =C2=A0computational proof the=
ory<br> =C2=A0=E2=80=A2 =C2=A0constructive mathematics and type theory<br> =
=C2=A0=E2=80=A2 =C2=A0decision procedures<br> =C2=A0=E2=80=A2 =C2=A0domain =
theory<br> =C2=A0=E2=80=A2 =C2=A0equational logic and rewriting<br> =C2=A0=
=E2=80=A2 =C2=A0finite model theory<br> =C2=A0=E2=80=A2 =C2=A0higher-order =
logic<br> =C2=A0=E2=80=A2 =C2=A0lambda calculus and combinatory logic<br> =
=C2=A0=E2=80=A2 =C2=A0linear logic and other substructural logics <br> =C2=
=A0=E2=80=A2 =C2=A0logic programming and constraints<br> =C2=A0=E2=80=A2 =
=C2=A0logical aspects of computational complexity<br> =C2=A0=E2=80=A2 =C2=
=A0logical aspects of quantum computing<br> =C2=A0=E2=80=A2 =C2=A0logic in =
database theory<br> =C2=A0=E2=80=A2 =C2=A0logical foundations of programmin=
g paradigms<br> =C2=A0=E2=80=A2 =C2=A0logical foundations of cryptography a=
nd information hiding<br> =C2=A0=E2=80=A2 =C2=A0logics for multi-agent syst=
ems<br> =C2=A0=E2=80=A2 =C2=A0modal and temporal logic<br> =C2=A0=E2=80=A2 =
=C2=A0model checking and logic-based verification<br> =C2=A0=E2=80=A2 =C2=
=A0nonmonotonic reasoning<br> =C2=A0=E2=80=A2 =C2=A0SAT solving and automat=
ed induction<br> =C2=A0=E2=80=A2 =C2=A0satisfiability modulo theories <br> =
=C2=A0=E2=80=A2 =C2=A0specification, extraction and transformation of progr=
ams<br> =C2=A0=E2=80=A2 =C2=A0verification and program analysis<br> =C2=A0-=
----------------------------<wbr>------------------------------<wbr>-------=
-----------<br><br><br>INVITED SPEAKERS<br>------------------------------<b=
r>LC-CSL joint session highlight speakers: <br>Phokion Kolaitis, University=
 of California Santa Cruz and IBM Research - Almaden<br>Wolfgang Thomas, RW=
TH Aachen<br><br>CSL plenary speakers: <br>Laura Kov=C3=A1cs, Vienna Univer=
sity of Technology<br>Stephan Kreutzer, Technische Universit=C3=A4t Berlin<=
br>Meena Mahajan, Institute of Mathematical Sciences, Chennai<br>Margus Vea=
nes, Microsoft Research<br><br><br>SPECIAL AND AFFILIATED EVENTS<br>-------=
-----------------------<wbr>--------------------<br>In addition to the plen=
ary and contributed talks CSL2017, the conference will also include the fol=
lowing events: <br> =C2=A0=E2=80=A2 Joint session of CSL2017 and LC2017 in =
the morning of August 20, consisting of four plenary highlight talks, offer=
ed by speakers from both conferences. <br> =C2=A0=E2=80=A2 =C2=A0Presentati=
on of the Alonzo Church award for Outstanding Contributions to Logic and Co=
mputation, <br> =C2=A0=E2=80=A2 =C2=A0Presentation of the EACSL Ackermann a=
ward for Outstanding Dissertation on Logic in Computer Science, <br> =C2=A0=
=E2=80=A2 =C2=A0CSL-affiliated workshops, to be held as co-located events o=
n August 25 and (possibly) 26, including: <br> =C2=A0=C2=A0=C2=A0=C2=A0=E2=
=80=A2 =C2=A0Workshop on Logical Aspects of Multi-Agent Systems LAMAS2017 (=
August =C2=A025)<br> =C2=A0=C2=A0=C2=A0=C2=A0=E2=80=A2 =C2=A0Workshop on Lo=
gic and Automata Theory (in memory of Zoltan Ezik) (August =C2=A025) =C2=A0=
<br> =C2=A0=C2=A0=C2=A0=C2=A0=E2=80=A2 =C2=A0Workshop on Logic and Algorith=
ms in Computational Linguistics LACompLing&#39;17 (August =C2=A026) <br><br=
><br>SUBMISSIONS<br>---------------------<br>The CSL2017 conference proceed=
ings will be published in Leibniz International Proceedings in Informatics =
(LIPIcs).<br><br>Authors are invited to submit contributed papers of no mor=
e than 15 pages in LIPIcs style (including references), presenting not prev=
iously published =C2=A0work, fitting the scope of the conference.<br><br>Th=
e submission of contributed papers will be in two stages:<br> * abstracts, =
due by March 24, 2017 (AoE);<br> * full papers, due by March 31, 2017 (AoE)=
.<br><br>The submissions must be done via the EasyChair page for the confer=
ence:<br><a href=3D"https://easychair.org/conferences/?conf=3Dcsl2017" targ=
et=3D"_blank">https://easychair.org/<wbr>conferences/?conf=3Dcsl2017</a>. <=
br><br>Submitted papers must be in English and must provide sufficient deta=
il to allow the Programme Committee to assess the merits of the paper. Full=
 proofs may appear in a clearly marked technical appendix which will be rea=
d at the reviewers&#39; discretion.=C2=A0 Authors are strongly encouraged t=
o include a well written introduction which is directed at all members of t=
he PC.<br><br>Papers may not be submitted concurrently to another conferenc=
e with refereed proceedings. The PC chairs should be informed of closely re=
lated work submitted to a conference or a journal. Papers authored or co-au=
thored by members of the PC are not allowed.<br><br>In addition, there will=
 be an opportunity for short oral presentations at the conference. Abstract=
s for such oral presentations must be submitted through the Easychair submi=
ssion webpage, under the category ``short presentations&#39;&#39;, by June =
4, 2017. They will not be included in the proceedings. =C2=A0<br><br><br>PR=
OGRAMME COMMITTEE<br>-------------------<br>=E2=80=A2 Parosh Aziz Abdulla (=
University of Uppsala),<br>=E2=80=A2 Lars Birkedal (University of Aarhus), =
=C2=A0<br>=E2=80=A2 Nikolaj Bjorner (Microsoft Research),<br>=E2=80=A2 Mari=
a Paola Bonacina (Universit=C3=A0 degli Studi di Verona), =C2=A0<br>=E2=80=
=A2 Patricia Bouyer-Decitre (LSV, ENS Cachan),<br>=E2=80=A2 Agata Ciabatton=
i (University of Viena),<br>=E2=80=A2 Thierry Coquand (University of Gothen=
burg), =C2=A0<br>=E2=80=A2 Mads Dam (KTH, Stockholm), PC co-chair<br>=E2=80=
=A2 Ugo Dal Lago (University of Bologna),<br>=E2=80=A2 Anuj Dawar (Cambridg=
e University),<br>=E2=80=A2 Valentin Goranko (Stockholm University), PC co-=
chair<br>=E2=80=A2 Maribel Fernandez (King&#39;s College London),<br>=E2=80=
=A2 Martin Grohe (RWTH Aachen),<br>=E2=80=A2 Lauri Hella (University of Tam=
pere),<br>=E2=80=A2 Joost-Pieter Katoen (RWTH Aachen),<br>=E2=80=A2 Orna Ku=
pferman (University of Jerusalem),<br>=E2=80=A2 Leonid Libkin (University o=
f Edinburgh),<br>=E2=80=A2 Angelo Montanari (University of Udine),<br>=E2=
=80=A2 Catuscia Palamidessi (Paris, INRIA),<br>=E2=80=A2 Frank Pfenning (Ca=
rnegie Mellon University, Pittsburgh)<br>=E2=80=A2 Ram Ramanujam (Institute=
 of Mathematical Sciences, Chennai),<br>=E2=80=A2 Jean-Francois Raskin (Uni=
versity of Bruxelles),<br>=E2=80=A2 Thomas Schwentick (TU Dortmund Universi=
ty),<br>=E2=80=A2 Viorica Sofronie-Stokkermans (University of Koblenz-Landa=
u),<br>=E2=80=A2 Thomas Streicher (University of Darmstadt),<br>=E2=80=A2 J=
ean-Marc Talbot (University of Aix-Marseille),<br>=E2=80=A2 Luca Vigan=C3=
=B2 (King&#39;s College London),<br>=E2=80=A2 Ron van der Meyden (UNSW Aust=
ralia),<br>=E2=80=A2 Lijun Zhang (Chinese Academy of Sciences, Beijing).<br=
><br><br>ORGANISING COMMITTEE<br>--------------------<br>=E2=80=A2 Mads Dam=
 (OC co-chair), Department of Theoretical Computer Science, KTH<br>=E2=80=
=A2 Valentin Goranko (OC co-chair), Department of Philosophy, Stockholm Uni=
versity<br>=E2=80=A2 Dilian Gurov (Workshops chair), Department of Theoreti=
cal Computer Science, KTH<br>=E2=80=A2 Roussanka Loukanova, Department of M=
athematics, Stockholm University<br>=E2=80=A2 Peter LeFanu Lumsdaine, Depar=
tment of Mathematics, Stockholm University<br>=E2=80=A2 Anders Lundstedt, D=
epartment of Philosophy, Stockholm University<br>=E2=80=A2 Erik Palmgren (O=
C co-chair), Department of Mathematics, Stockholm University<br>=E2=80=A2 H=
enning Strandin, Department of Philosophy, Stockholm University<br><br><br>=
CONTACTS AND ENQUIRIES: <br>--------------------<br>With enquiries on organ=
ising matters, send email to: csl2017&lt;at&gt;<a href=3D"http://philosophy=
.su.se" target=3D"_blank">philosophy.su.se</a><br>With enquiries on scienti=
fic and programme issues, send email to: csl2017pc&lt;at&gt;<a href=3D"http=
://gmail.com" target=3D"_blank">gmail.com</a><br></div></div></div><br><div=
>
<div style=3D"color:rgb(0,0,0);font-family:Helvetica;font-style:normal;font=
-variant:normal;font-weight:normal;letter-spacing:normal;line-height:normal=
;text-align:-webkit-auto;text-indent:0px;text-transform:none;white-space:no=
rmal;word-spacing:0px;word-wrap:break-word"><span class=3D"m_47440562867617=
69929Apple-style-span" style=3D"border-collapse:separate;font-variant-ligat=
ures:normal;font-variant-numeric:normal;font-variant-alternates:normal;font=
-variant-east-asian:normal;line-height:normal;border-spacing:0px"><div styl=
e=3D"word-wrap:break-word"><span class=3D"m_4744056286761769929Apple-style-=
span" style=3D"border-collapse:separate;color:rgb(0,0,0);font-family:Helvet=
ica;font-style:normal;font-variant:normal;font-weight:normal;letter-spacing=
:normal;line-height:normal;text-align:-webkit-auto;text-indent:0px;text-tra=
nsform:none;white-space:normal;word-spacing:0px;border-spacing:0px"><div st=
yle=3D"word-wrap:break-word"><span class=3D"m_4744056286761769929Apple-styl=
e-span" style=3D"border-collapse:separate;color:rgb(0,0,0);font-family:Helv=
etica;font-size:12px;font-style:normal;font-variant:normal;font-weight:norm=
al;letter-spacing:normal;line-height:normal;text-indent:0px;text-transform:=
none;white-space:normal;word-spacing:0px;border-spacing:0px"><div style=3D"=
word-wrap:break-word"><span class=3D"m_4744056286761769929Apple-style-span"=
 style=3D"border-collapse:separate;color:rgb(0,0,0);font-family:Helvetica;f=
ont-size:12px;font-style:normal;font-variant:normal;font-weight:normal;lett=
er-spacing:normal;line-height:normal;text-indent:0px;text-transform:none;wh=
ite-space:normal;word-spacing:0px;border-spacing:0px"><span class=3D"m_4744=
056286761769929Apple-style-span" style=3D"border-collapse:separate;color:rg=
b(0,0,0);font-family:Helvetica;font-size:12px;font-style:normal;font-varian=
t:normal;font-weight:normal;letter-spacing:normal;line-height:normal;text-i=
ndent:0px;text-transform:none;white-space:normal;word-spacing:0px;border-sp=
acing:0px"><span class=3D"m_4744056286761769929Apple-style-span" style=3D"b=
order-collapse:separate;border-spacing:0px;color:rgb(0,0,0);font-family:Hel=
vetica;font-size:12px;font-style:normal;font-variant:normal;font-weight:nor=
mal;letter-spacing:normal;line-height:normal;text-indent:0px;text-transform=
:none;white-space:normal;word-spacing:0px"><span class=3D"m_474405628676176=
9929Apple-style-span" style=3D"border-collapse:separate;border-spacing:0px;=
color:rgb(0,0,0);font-family:Helvetica;font-size:12px;font-style:normal;fon=
t-variant:normal;font-weight:normal;letter-spacing:normal;line-height:norma=
l;text-indent:0px;text-transform:none;white-space:normal;word-spacing:0px">=
<span class=3D"m_4744056286761769929Apple-style-span" style=3D"border-colla=
pse:separate;border-spacing:0px;color:rgb(0,0,0);font-family:Helvetica;font=
-size:12px;font-style:normal;font-variant:normal;font-weight:normal;letter-=
spacing:normal;line-height:normal;text-indent:0px;text-transform:none;white=
-space:normal;word-spacing:0px"><span class=3D"m_4744056286761769929Apple-s=
tyle-span" style=3D"border-collapse:separate;border-spacing:0px;color:rgb(0=
,0,0);font-family:Helvetica;font-size:12px;font-style:normal;font-variant:n=
ormal;font-weight:normal;letter-spacing:normal;line-height:normal;text-inde=
nt:0px;text-transform:none;white-space:normal;word-spacing:0px"><div class=
=3D"m_4744056286761769929AppleMailSignature" id=3D"m_4744056286761769929F6E=
50787-05D9-4A56-9550-1F9F57B11F78"><div><br></div></div></span></span></spa=
n></span></span></span></div></span></div></span></div></span></div></div><=
/div></div></div><br></div>

--001a113e012ac2b60e0546704e58--

--===============1485257705==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

_______________________________________________
Lprolog mailing list
[email protected]
https://wwws.cs.umn.edu/mm-cs/listinfo/lprolog
--===============1485257705==--