From mboxrd@z Thu Jan  1 00:00:00 1970
Return-Path: <Jorge.Fandinno@irit.fr>
Received: from mail2-relais-roc.national.inria.fr (mail2-relais-roc.national.inria.fr [192.134.164.83])
	by sympa.inria.fr (Postfix) with ESMTPS id BC3117F61F;
	Thu, 21 Mar 2019 11:52:10 +0100 (CET)
Authentication-Results: mail2-smtp-roc.national.inria.fr; spf=None smtp.pra=Jorge.Fandinno@irit.fr; spf=Pass smtp.mailfrom=Jorge.Fandinno@irit.fr; spf=None smtp.helo=postmaster@smtp1.irit.fr
Received-SPF: None (mail2-smtp-roc.national.inria.fr: no sender
  authenticity information available from domain of
  Jorge.Fandinno@irit.fr) identity=pra; client-ip=141.115.24.2;
  receiver=mail2-smtp-roc.national.inria.fr;
  envelope-from="Jorge.Fandinno@irit.fr";
  x-sender="Jorge.Fandinno@irit.fr";
  x-conformance=sidf_compatible
Received-SPF: Pass (mail2-smtp-roc.national.inria.fr: domain of
  Jorge.Fandinno@irit.fr designates 141.115.24.2 as permitted
  sender) identity=mailfrom; client-ip=141.115.24.2;
  receiver=mail2-smtp-roc.national.inria.fr;
  envelope-from="Jorge.Fandinno@irit.fr";
  x-sender="Jorge.Fandinno@irit.fr";
  x-conformance=sidf_compatible; x-record-type="v=spf1"
Received-SPF: None (mail2-smtp-roc.national.inria.fr: no sender
  authenticity information available from domain of
  postmaster@smtp1.irit.fr) identity=helo;
  client-ip=141.115.24.2;
  receiver=mail2-smtp-roc.national.inria.fr;
  envelope-from="Jorge.Fandinno@irit.fr";
  x-sender="postmaster@smtp1.irit.fr";
  x-conformance=sidf_compatible
IronPort-PHdr: =?us-ascii?q?9a23=3ANTg3LhV1vXHnVY49XliZaMGZxZ/V8LGtZVwlr6E/?=
 =?us-ascii?q?grcLSJyIuqrYZhKBv6dThVPEFb/W9+hDw7KP9fy5ASpesN3Z7DgrS99lb1c9k8?=
 =?us-ascii?q?IYnggtUoauKHbQC7rUVRE8B9lIT1R//nu2YgB/Ecf6YEDO8DXptWZBUhrwOhBo?=
 =?us-ascii?q?KevrB4Xck9q41/yo+53Ufg5EmCexbal9IRmrsQndrMgbjI9tJqotxRbCv2dFdf?=
 =?us-ascii?q?lRyW50P1yYggzy5t23/J5t8iRQv+wu+stdWqjkfKo2UKJVAi0+P286+MPkux/D?=
 =?us-ascii?q?TRCS5nQHSWUZjgBIAwne4x7kWJr6rzb3ufB82CmeOs32UKw0VDG/5KplVBPklC?=
 =?us-ascii?q?EKPCM+/2/Kl8xwl7pbrwy9qBxjzYDUZ4SVO+B/fqPbYNgWQWVMU8JUWyFHBYyy?=
 =?us-ascii?q?cowPD/AdPelGsobzu0UBoge/BQm0Gu/k1ztEi3Dq0aE/1ekqDAPI0xE6H98WrH?=
 =?us-ascii?q?varM/1OqkMX++6z6fG0DvMYfxN1Dfh8YjFaAwtre2WUL9yd8fa1EkhFxnCjlWV?=
 =?us-ascii?q?sYHpMTeb1uMXs2iU8eVrSOKhhHQhqw5sozivwMAshofUjY8Szl7E8j95wIkrKt?=
 =?us-ascii?q?GiSEB0e9ikH4ZRtyGcMYt2RdgvQ2ByuCY71r0Ko5C7fDITxZkh2hXRZfuHc42S?=
 =?us-ascii?q?7RLiUuacOS13hGhqebK+mRa+60+gyvfzVsWs31ZKqS1FktbItn8TzRDc9s+HSv?=
 =?us-ascii?q?5l8ke6wTaPzQHT6udLIU8qj6rXMYIuwrk1lpcVrE/NHTf2lV3rgKKZa0ko4PWk?=
 =?us-ascii?q?5/nnb7n8uJOROJV4hh/mPqgzlcGzHP40PhUTU2Wb4+ix26fv8EzkTLhMk/Y4iL?=
 =?us-ascii?q?PWsIrAKsQevqO5AxFa0oIk6xunFDem1cgYnWEaIF5feRKHlYnpO03ULPD2F/ez?=
 =?us-ascii?q?m1WskDF1yPDaJrDtH5rAImXZnLv8YLpw61RQxBQ8wNxF+Z5YErQBL+jyWk/1ut?=
 =?us-ascii?q?zYFBg5MwmszujjD9V9zIweVnyVDqGZKqzSt0KH5uMpI+mKY48Yozf9K+Ik5/7y?=
 =?us-ascii?q?l3M5l0UdcbGz3ZQLcHC4AuhmI0KBbHrih9cBEHsFvhElQezxiFyCVCZTaGyoU6?=
 =?us-ascii?q?I94DE7EoOmAp3ZSoCjmryLxD27EYFOZmBaFlCMFm/leJmeVPcJbCKeO8thkj0f?=
 =?us-ascii?q?Vbi9UIIhzhGvtAriy7V9NObU+ysYtYji1Ndv/eHTmwsypnRICJGU3GyLU3pclX?=
 =?us-ascii?q?hOWjo81+ZyrVE5gl6H3rBihPNwHttW4/pDFAAqc5fXifF5T5j7XgbpbsyDDl2h?=
 =?us-ascii?q?R5HuCCsuC9k2xtoPf1pwFv2plRuF2yu0RbYe0aGIQNQ++6jR2z3+PcFg017M3a?=
 =?us-ascii?q?Msix8iWY1BNCu7nqs5+hOXT4XAn0ixlrq3M6gfmGbG/WOOy2aHpmlTVwtoTLnI?=
 =?us-ascii?q?RzYYfESS5d/w40eHS761FZwmNBFAwIiMMO8CYd30l15GAf7lPtPDZWm8s2yrQx?=
 =?us-ascii?q?yVgL6Acc6icGUAxi7dTUEClQcO+32LHQMlHGGrviTTACEqXVnue0Ph66x1pmuT?=
 =?us-ascii?q?T0I5wkSRYkZ8zbup61gSn/PYA/gX07sC/SMgsClcB1280tTdBpyaukxneOEUat?=
 =?us-ascii?q?Qy+1xG/WnC8RB2MtqhIuQqjVkbdw19l0jp0hF+AMNHgY4jpzU3z046IqWd1RZd?=
 =?us-ascii?q?dz6fx4HYO7DaJy/15h/rI6XR31TX+NKX4bsUrvgyolSloBy2F0cktXxsldBJlz?=
 =?us-ascii?q?OX4ZDSCA0deZnqFEAy7AU8qr3HJmE24IbMz3p8GaWzuXnD0JQgD604yVLodNBZ?=
 =?us-ascii?q?O76eDgL0GNwyDNevbuou3xCidhIPeetV8qAcPcK9fP6P2artNe0mgTHixWhG+5?=
 =?us-ascii?q?xn00iR6ydwD+fJ95QE2Pqd1wqDET73ykqi9oj7nIlCaC06DHKljzXiBctSYaB2?=
 =?us-ascii?q?e8AHBCPmLtezz9NxwofwVmVE9VmlHHsLwsugfxXUaEbymUVdy0kRvVSmn22k0n?=
 =?us-ascii?q?l/lzg0tbaf1SiIz+mmPBQIf2dRT0FmjEzwOs6pidFfREGkYhIjkwGjo0r3g+BV?=
 =?us-ascii?q?oeF2KW/UXEFDci37KX15eq+xraaZJchG85puviJJFKyyZFGRUZb8pQEb2if7En?=
 =?us-ascii?q?AYyip/Pz+toJDwmTRzg2fbK2x86DLXftt1xAz36N3EQPdNmCcARTF3zzjLQhCy?=
 =?us-ascii?q?J/Gi5pOfkoqFv+yjEyquTJx7cC/lypmFvTe65it3Bxz6hfeohtrsEk423Guz2M?=
 =?us-ascii?q?RuTWDBqBLUc4Dr0KO1K+V6ZlIuD1j5r4J6HYU7k40+g7kU2GMGndOO+mcdmmr9?=
 =?us-ascii?q?Ns9U1OT4YWZJDT8Fwsb94QbkwAtkNDSA28axV3CRz8JJbN27eiUa2yt74cEMFb?=
 =?us-ascii?q?+RqrFf2WN0pFalph7Qf/U4hDoE1PY19FYegvoVowc30GOABLpUFkAcdS/2kx2C?=
 =?us-ascii?q?qdmyqaRRTGmqeLm0kkF5mJTpCLCJuSlGVW30c40pHWl648F7dVbF2ma14YbhPJ?=
 =?us-ascii?q?HUat0SvViMiRDPleFQLZM3mdIOhDF7IiTlvHYs16s/hBphm5ags8zPL2Ji/amR?=
 =?us-ascii?q?BxdENnvoYcJW8Dbri+BSk4Le2omyEpgkBy4GRoDARunuDTMPvrLqOxvKWDg9uH?=
 =?us-ascii?q?6BXLTYBxKawEJnvXvVVY20PTeaKGRf1dEmDB+EOExaxR0PUS8htpUiUB22ydzo?=
 =?us-ascii?q?awF06i1VrljnsgcJy+RmMDH7U3zDv0GpbTxyRZXbZB1Q8gZG4EjEGcaD4Ox6Gy?=
 =?us-ascii?q?Ye85G86ESVMGuUIgBBC24hVk2HGhbvPf3m/cPH8eWTGq+1Jv/FfLGDrPFFf/WB?=
 =?us-ascii?q?zpWlyc57+TeSO9+UP2VzSfE2ngJZUHR8Gs/C3jEnTicSnjnRYtTdrx74sjZ6q8?=
 =?us-ascii?q?m57PXgRw/lzZqGC7xVPs9o5gitx6yEMqrYnydyMipFzdYR3nLS05AE3VUJzTpj?=
 =?us-ascii?q?M3G2ELsJryXNCafdn6VaFQUzbyJoKNBF9bx61wJIf8nBhZe9zb93lvcvEFoAUV?=
 =?us-ascii?q?36humtZNcWOCe0Ml/dCVnNP7GbYzDH3oW/eqKzUblZiqBdsRu3pDCQHmfnPy+f?=
 =?us-ascii?q?jDTzSVamOuQKizuUeFRFuY6mexMoB3LiQdTqcTW/McRrljAs3/s9jXaMMnQTdX?=
 =?us-ascii?q?BnckxWp7jV6C5diPhlAERF72F5NuSehWCQ5OyeLYwZ9bNwByAxk+NB/Fwx0P1e?=
 =?us-ascii?q?6TwCSfBo3GPJstdgrXmqmOCOjCZ6TxtDrHBCj8SCoQEqIrnQ+JdoV3He5wMR4C?=
 =?us-ascii?q?OMFgsLqt0jA9apsrwUgsPTnaz9ADRYtc7J4soRAY7dI4SOLD5pLRrkHyTFSQIt?=
 =?us-ascii?q?ST+wKXrSnVIblvae/37To5Qn7tDwmJcJUK5dSHQxF+gGEUl/ApoEJ5t+XXUpna?=
 =?us-ascii?q?PfxNIZ/XelhBLQX4NHpp3BULSfDeirYCuCgKNfTx4P07riMcEUJMv8wUMmIkZ3?=
 =?us-ascii?q?loHDAFbdR/hAqzFqdUkzukoJuGd/ZmQy1UijdwWspXwaD/qvhAM2h01ybKBl5j?=
 =?us-ascii?q?nr+UoyDlHNoS85mg82iZPsinaMc23LIb+0TL1RXijzrUc8PJr9Twdzawqakklt?=
 =?us-ascii?q?NTOCTLVU3JV6cmU+wi3bo5RCUdBVS6FFZhhajaW1YO8n3BJyoyOrxElB4sPEE5?=
 =?us-ascii?q?p+0gUwJ83/50lc0h5uOYZmbZfbI7BEmwgB3/PcjmqTzuk0hTQmCQMI+WKWdjQP?=
 =?us-ascii?q?vR1aN6MnO2ym5L41sFDQq354YGEJEsESjLdy7EpsaeWazj6m3aQRchnsZdzaFL?=
 =?us-ascii?q?uQvi37reDNQl400RpVxVJA4aAvl8Y5clbSWVp9lLY=3D?=
X-IronPort-Anti-Spam-Filtered: true
X-IronPort-Anti-Spam-Result: =?us-ascii?q?A0A1PABSa5NchwIYc41ZCg6CC4EpN4EGE?=
 =?us-ascii?q?YEDJ4QOkzyFJoFfiVpYiFBdgQQDVA8YDYk4GgcBBDQSAQEDAQEJAQMBAQETAQE?=
 =?us-ascii?q?BCgsJCCkKGQxCFgGBYQwMAwMBgnkBCRIGCAEzCQUFKhICJgICLwEOAQgVAiuDC?=
 =?us-ascii?q?QGBXQEBGguqVIEvDRGDZQF8BTCCKgQKgkUTeCQBAYswghaBESqEKoFdAQGBNgS?=
 =?us-ascii?q?DMYJXA4o0EIInmBwHAgKBHoErAYUWhAmHTiOCT4pIDFiFbINEh1SGAI1GXoEGV?=
 =?us-ascii?q?oEhdIF/GoEfCQmCEoNUhRSFBAQ4PjOIXYJtgk0BAQ?=
X-IPAS-Result: =?us-ascii?q?A0A1PABSa5NchwIYc41ZCg6CC4EpN4EGEYEDJ4QOkzyFJoF?=
 =?us-ascii?q?fiVpYiFBdgQQDVA8YDYk4GgcBBDQSAQEDAQEJAQMBAQETAQEBCgsJCCkKGQxCF?=
 =?us-ascii?q?gGBYQwMAwMBgnkBCRIGCAEzCQUFKhICJgICLwEOAQgVAiuDCQGBXQEBGguqVIE?=
 =?us-ascii?q?vDRGDZQF8BTCCKgQKgkUTeCQBAYswghaBESqEKoFdAQGBNgSDMYJXA4o0EIInm?=
 =?us-ascii?q?BwHAgKBHoErAYUWhAmHTiOCT4pIDFiFbINEh1SGAI1GXoEGVoEhdIF/GoEfCQm?=
 =?us-ascii?q?CEoNUhRSFBAQ4PjOIXYJtgk0BAQ?=
X-IronPort-AV: E=Sophos;i="5.60,252,1549926000"; 
   d="scan'208";a="375072590"
X-MGA-submission: =?us-ascii?q?MDHWx9lE4lP++eMLCY/S8/iIsKHDQ/sTqIhQPF?=
 =?us-ascii?q?p9ki777W5U3vmDHEeiooIhFjUBIhSpqkUxEcfvgRvaLp1spmkTmlZY9d?=
 =?us-ascii?q?CRo+Z196pgLCTFm6Li/Exlp2V3mwIFrlo/mlUjWc8qT7tdLNaMLFK0t5?=
 =?us-ascii?q?V2/rhOwAU2HCHG7rG/aUn+MA=3D=3D?=
Received: from smtp1.irit.fr ([141.115.24.2])
  by mail2-smtp-roc.national.inria.fr with ESMTP/TLS/DHE-RSA-AES256-GCM-SHA384; 21 Mar 2019 11:52:09 +0100
Received: from irit.fr
Received: from wwwap4.irit.fr (wwwap4 [141.115.4.61]) by mailhost1.irit.fr at Thu, 21 Mar 2019 11:40:46 +0100 with id x2LAekbo025069
Received: (from sogo@localhost) by wwwap4.irit.fr at Thu, 21 Mar 2019 11:40:34 +0100 with id x2LAeYW1027837
X-Authentication-Warning: wwwap4.irit.fr: sogo set sender to Jorge.Fandinno@irit.fr using -f
Content-Type: text/plain; charset="utf-8"
From: "Jorge Fandino" <Jorge.Fandinno@irit.fr>
Reply-To: jorgefandinno@gmail.com
X-Forward: 141.115.75.30
Date: Thu, 21 Mar 2019 11:40:34 +0100
To: agents@cs.umbc.edu, algprog@comlab.ox.ac.uk, all@xsb.com,
        arw-committee@csc.liv.ac.uk, babel-group@babel.ls.fi.upm.es,
        cade@itu.dk, calendar@computer.org, caml-list@inria.fr,
        church-announce@cs.bu.edu, church-announce@csr.bu.edu,
        cipher-cfp@ieee-security.org, clean-list@science.ru.nl,
        cogsci@cs.tcd.ie, comlab@comlab.ox.ac.uk, comm-theory@ieee.org,
        comma@lists.dbai.tuwien.ac.at, complog@cs.nmsu.edu,
        comprox@doc.ic.ac.uk, concurrency@cwi.nl, cphc-conf@jiscmail.ac.uk,
        distributed-ai@jiscmail.ac.uk, dmanet@zpr.uni-koeln.de,
        erlang-questions@erlang.org, event@in.tu-clausthal.de,
        fg-arc@lists.uni-paderborn.de, fm-announcements@lists.nasa.gov,
        fmics@inrialpes.fr, forman@acm.org, formis@dipmat.unipg.it,
        fp@cs.cmu.edu, gri@informatik.uni-rostock.de, gulp-all@yahoogroups.com,
        hol-info@lists.sourceforge.net, ifip@ifip.or.at,
        imdea@clip.dia.fi.upm.es, inductive-request@listserv.unb.ca,
        krlab.admin@gmail.com, lics@research.bell-labs.com,
        logic-programming@lists.picat-lang.org, logic@math.uni-bonn.de,
        maude-users@cs.uiuc.edu, mizar-forum@mizar.uwb.edu.pl,
        nqthm-users@cs.utexas.edu, nwpt-info@lists.ioc.ee,
        ontology@buffalo.edu, prog-lang@diku.dk,
        project-calculemus@jacobs-university.de, relmics-l@mcmaster.ca,
        semanticweb@yahoogroups.com, sicstus-users@sics.se,
        sigarch-members@listserv.acm.org, sigparse-list@lists.andrew.cmu.edu,
        sigplan-announce@listserv.acm.org, sigsam-friends@listserv.acm.org,
        sigsam-members@listserv.acm.org, sml-list@cs.cmu.edu,
        staff@dbai.tuwien.ac.at, staff@forsyte.tuwien.ac.at,
        staff@kr.tuwien.ac.at, theory-a@listserv.nodak.edu,
        theorynt@listserv.nodak.edu, types@cis.upenn.edu, users@mozart-oz.org,
        webmaster@eatcs.org, wi@aifb.uni-karlsruhe.de, zforum@comlab.ox.ac.uk
MIME-Version: 1.0
Message-ID: <3842-5c936a00-4c9-7d4cb40@21205733>
User-Agent: SOGoMail 4.0.7
Content-Transfer-Encoding: quoted-printable
X-Validation-by: jorgefandinno@gmail.com
Subject: [Caml-list] ASPOCP 2019 - call for papers

[Apologies for multiple postings]

=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D
                                                                  CALL FOR =
PAPERS=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20
                                                                       ASPO=
CP 2019
                    12th Workshop on Answer Set Programming and Other Compu=
ting Paradigms
                                                  https://sites.google.com/=
site/aspocp2019
                                                      June 3 or 4, 2019 (LP=
NMR Workshop)

=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
        Affiliated with 15th International Conference on Logic Programming =
and Nonmonotonic Reasoning,
                                                 Saint Joseph=E2=80=99s Uni=
versity, Philadelphia, PA (USA)
                                                                          J=
une 4-7, 2019
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
AIMS AND SCOPE=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
 Since its introduction in the late 1980s, Answer Set Programming (ASP) has=
 been widely applied to
 various knowledge-intensive tasks and combinatorial search problems. ASP w=
as found to be
 closely related to SAT, which led to a new method of computing answer sets=
 using SAT solvers and
 techniques adapted from SAT. This has been a much studied relationship, an=
d is currently extended
 towards satisfiability modulo theories (SMT). The relationship of ASP to o=
ther computing paradigms,
 such as constraint satisfaction, quantified Boolean formulas (QBF), Constr=
aint Logic Programming
 (CLP), first-order logic (FOL), and FO(ID) is also the subject of active r=
esearch. Consequently, new
 methods of computing answer sets are being developed based on relationship=
s to these formalisms.
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
 Furthermore, the practical applications of ASP also foster work on multi-p=
aradigm problem-solving,
 and in particular language and solver integration. The most prominent exam=
ples in this area
 currently are the integration of ASP with description logics (in the realm=
 of the Semantic Web) and
 constraint satisfaction (which recently led to the Constraint Answer Set P=
rogramming (CASP)
 research direction).
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
 A large body of general results regarding ASP is available and several eff=
icient ASP solvers have
 been implemented. However, there are still significant challenges in apply=
ing ASP to real life
 applications, and more interest in relating ASP to other computing paradig=
ms is emerging. This
 workshop will provide opportunities for researchers to identify these chal=
lenges and to exchange
 ideas for overcoming them.

TOPICS=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
 Topics of interests include (but are not limited to):=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20
 - ASP and classical logic formalisms (SAT/FOL/QBF/SMT/DL).=20=20=20=20=20=
=20=20=20=20=20=20=20
 - ASP and constraint programming.=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
 - ASP and other logic programming paradigms, e.g., FO(ID).=20=20=20=20=20=
=20=20=20=20=20=20=20
 - ASP and other nonmonotonic languages, e.g., action languages.=20=20=20=
=20=20=20=20
 - ASP and external means of computation.=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
 - ASP and probabilistic reasoning.=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
 - ASP and knowledge compilation.=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
 - ASP and machine learning.=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20
 - New methods of computing answer sets using algorithms or systems of=20
   other paradigms.=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20
 - Language extensions to ASP.=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20
 - ASP and multi-agent systems.=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20
 - ASP and multi-context systems.=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
 - Modularity and ASP.=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20
 - ASP and argumentation.=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20
 - Multi-paradigm problem solving involving ASP.=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20
 - Evaluation and comparison of ASP to other paradigms.=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20
 - ASP and related paradigms in applications.=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
 - Hybridizing ASP with procedural approaches.=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
 - Enhanced grounding or beyond grounding.=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
SUBMISSIONS=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20
 Papers must describe original research and should not exceed 13 pages (exc=
luding
 references).

Submissions must be written in English, present original research, and be f=
ormatted according to Springer=E2=80=99s guidelines and technical instructi=
ons available at:

https://www.springer.com/gp/authors-editors/conference-proceedings/conferen=
ce-proceedings-guidelines

 Paper submission will be handled electronically by means of the Easychair =
system.
 The submission page is available here
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
IMPORTANT DATES (tentative)=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20
Abstract submission deadline:                     March 26, 2019
 Paper submission deadline:                        April 1, 2019
 Notification:                                                 May 1, 2019
 Camera-ready articles due:                         May 12, 2019
 Workshop:                                                 June 3 or 4, 2019

=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
PROCEEDINGS=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
 Accepted papers will be made available online as inofficial proceedings wi=
th
 Arxiv.org.

 A selection of extended and revised versions of accepted papers will appear
 in a special issue. We are currently negotiating with potential journals.
 Such papers will go through a second formal selection process to meet
 the high quality standard of the journal.

=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
LOCATION
Saint Joseph=E2=80=99s University, Philadelphia, PA (USA)

=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
WORKSHOP CO-CHAIRS
 Jorge Fandinno, IRIT, Toulouse, France
 Johannes K. Fichte, TU Wien, Austria=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=
=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20=20
PROGRAM COMMITTEE
Alessandro	Mosca
Amelia	Harrison	The University of Texas at Austin
Anne	Siegel	IRISA, CNRS
Antti	Hyv=C3=A4rinen	USI
Bart	Bogaerts	Vrije Universiteit Brussel
Bernhard	Bliem	University of Helsinki
Carmine	Dodaro	University of Genova
Chitta	Baral	Arizona State University
Cristina	Feier	University of Bremen
Daniela	Inclezan	Miami University
Enrico	Giunchiglia	University Genova
Fangkai	Yang	Maana Inc.
Francesco	Ricca	University of Calabria
Guillermo R.	Simari	Universidad del Sur in Bahia Blanca
Javier	Romero	University of Potsdam
Jia-Huai	You	University of Alberta
Joao	Leite	Universidade NOVA de Lisboa
Johannes K.	Fichte	TU Dresden
Johannes P.	Wallner	Vienna University of Technology
Joohyung	Lee	Arizona State University
J=C3=B6rg	P=C3=BChrer	Leipzig University
Jorge	Fandi=C3=B1o	IRIT, University of Toulouse, CNRs
Marc	Denecker	Katholieke Universiteit Leuven
Marcello	Balduccini	Saint Joseph's University
Marco	Maratea	University of Genova
Mario	Alviano	University of Calabria
Markus	Hecher	Vienna University of Technology
Martin	Gebser	University of Potsdam
Max	Ostrowski
Michael	Morak
Michael	Gelfond	Texas Tech University
Mirek	Truszczynski	University of Kentucky
Mutsunori	Banbara	IKobe University,
Nicola	Leone	University of Calabria
Orkunt	Sabuncu	TED University, Ankara
Pedro	Cabalar	University of Corunna
Richard	Watson	Texas Tech University, Department of Computer Science
Stefan	Ellmauthaler	Leipzig University
Stefan	Woltran	Vienna University of Technology
Stefania	Costantini	University of Aquila
Tomi	Janhunen	Aalto University
Tran Cao	Son	New Mexico State University
Vladimir	Lifschitz	The University of Texas at Austin
Wolfgang	Faber	Alpen-Adria-Universit=C3=A4t Klagenfurt
Yusuf	Izmirlioglu	Sabanci University