[Hol-info] WORDS 2019 - 2nd call for participation

[Words 2019]

[Apologies if you receive multiple copies of this message]

==
=== *WORDS 2019 2nd call for PARTICIPATION* ===
==
12th International Conference on WORDS
Loughborough, UK, September 9-13, 2019
http://words2019.lboro.ac.uk


*REGISTRATION* is open:
You can do this by either accessing directly the Loughborough University Store 
from the link 

https://store.lboro.ac.uk/conferences-and-events/computer-science/upcoming-conferencesevents/international-conference-on-words-words-2019

or by accessing the same link from the Conference Information section on our 
website www.words2019.lboro.ac.uk.


*KEYNOTE SPEAKERS*

Florin Manea (Kiel University)
Matching Patterns with Variables 

Svetlana Puzynina (Saint Petersburg State University)
Abelian properties of words 

Antonio Restivo (University of Palermo)
On Sets of Words of Rank Two 

Gwenaël Richomme (Université Paul-Valéry Montpellier 3)
S-adicity and property preserving morphisms 

Aleksi Saarela (University of Turku)
Independent Systems of Word Equations: From Ehrenfeucht to Eighteen 

Kristina Vušković (University of Leeds)
Structure of graph classes and algorithms 


*ACCEPTED PAPERS *
Author(s)   Paper Title

Adrian Atanasiu, Ghajendran Poovanandran, Wen Chean Teh 
Parikh Determinants

Aseem Baranwal, Jeffrey Shallit
Critical exponent of infinite balanced words via the Pell number system

Aseem Baranwal, Jeffrey Shallit 
Repetitions in infinite palindrome-rich words

Amanda Burcroff, Eric Winsor
Generalized Lyndon Factorizations of Infinite Words

Arturo Carpi, Flavio Dalessandro
On the commutative equivalence of bounded semi-linear codes

Trevor Clokie, Daniel Gabric, Jeffrey Shallit
Circularly squarefree words and unbordered conjugates: a new approach

James D. Currie, Lucas Mol
The undirected repetition threshold

Alessandro De Luca, Alma D'Aniello
Characteristic parameters and special trapezoidal words

Francesco Dolce, Dominique Perrin
Return words and bifix codes in eventually dendric sets

Marisa Gaetz, Caleb Ji
Enumeration and Extensions of Word-representable Graphs

Cyril Gavoille, Ghazal Kachigar, Gilles Zémor
Localisation-Resistant Random Words with Small Alphabet

Vladimir Gusev, Elena Pribavkina
On codeword lengths guaranteeing synchronization

Štěpán Holub
Binary intersection revisited

Václav Košík, Štěpán Starosta
On substitutions closed under derivation: examples

Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
Templates for the k-binomial complexity of the Tribonacci word

Kateřina Medková
Derivated sequences of Arnoux--Rauzy sequences

Tim Ng, Pascal Ochem, Jeffrey Shallit, Narad Rampersad
New results on pseudosquare avoidance

Jarkko Peltomäki, Markus Whiteland
Every nonnegative real number is a critical abelian exponent

Josef Rukavicka
Construction Of A Rich Word Containing Given Two Factors

Andrew Ryzhikov
Mortality and Synchronization of Unambiguous Finite Automata

Luigi Santocanale
On discrete idempotent paths


*WE LOOK FORWARD TO SEE YOU IN Loughborough!!!
Robert Mercas and Daniel Reidenbach
___
hol-info mailing list
hol-info@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/hol-info

[Hol-info] FroCoS-12 and TABLEAUX-28, London, September 2-6. Second call for participation (early registration closes on August 21)

[geoff]

The 2019 editions of FroCoS (the 12th International Symposium on Frontiers of
Combining Systems) and TABLEAUX (the 28th International Conference on Automated
Reasoning with Analytic Tableaux and Related Methods), as well as their
affiliated workshops and tutorials, will take place in London, at Middlesex
University, on the week of September 2-6.

This year we have an exciting program of contributed and invited talks, and
affiliated events. Please see
https://tableaux2019.org/Program_FroCoS_TABLEAUX_2019.pdf
for detailed program information. Moreover, information on traveling and
accommodation (including affordable accommodation for budget-constrained
participants), and on the sites and activities that can be enjoyed in the
Middlesex University's beautiful campus, is available from the conferences'
websites:
https://frocos2019.org  and  https://tableaux2019.org

Information on registration and fees is also available from these websites. The
deadline for early registration is August 21st, 2019.

INVITED TALKS
* Jeremy Avigad. Automated Reasoning for the Working Mathematician
* Maria Paola Bonacina. Conflict-Driven Reasoning in Unions of Theories
* Stephane Graham-Lengrand. Recent and Ongoing Developments of
Model-Constructing Satisfiability
* Stephane Graham-Lengrand and Sara Negri. Remembering Roy Dyckhoff
* Uli Sattler. Modularity and Automated Reasoning in Description Logics

AFFILIATED WORKSHOPS
* The 25th Workshop on Automated Reasoning (ARW 2019), organized by Alexander
Bolotov and Florian Kammueller
* Journeys in Computational Logic: Tributes to Roy Dyckhoff, organized by
Stephane Graham-Lengrand, Ekaterina Komendantskaya and Mehrnoosh Sadrzadeh

AFFILIATED TUTORIALS
* Formalising Concurrent Computation: CLF, Celf, and Applications by Sonia Marin
* How to Build an Automated Theorem Prover -- An Introductory Tutorial (invited
TABLEAUX tutorial) by Jens Otten

For any questions, please contact the organizers at ch...@tableaux2019.org or
ch...@frocos2019.org. We hope to see many of you this September in London.

Best wishes,
Serenella Cerrito, Andreas Herzig, Andrei Popescu and Franco Raimondi
(program chairs and local organizers)



___
hol-info mailing list
hol-info@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/hol-info

Re: [Hol-info] 0 / 0 = 0 ???

[Norrish, Michael (Data61, Acton)]

My comment is about how this is done in HOL, where the existing axiomatization 
is sufficient to give the behaviour as I have explained it.

Michael

From: Saburou Saitoh 
Date: Saturday, 10 August 2019 at 10:28
To: "Norrish, Michael (Data61, Acton)" 
Cc: "Chun Tian (binghe)" , hol-info 

Subject: Re: [Hol-info] 0 / 0 = 0 ???


Dear  Michael

For  x/0, the essential problem is on its definition.
I think the division by zero is trivial and clear all.
However, we will need a new axiom.
So, I would like to ask for your kind help for the axiom problem; Foundation of 
Mathematics.

Please look the draft:


viXra:1908.0100 submitted on 2019-08-06 
20:03:01,

Fundamental of Mathematics; Division by Zero Calculus and a New Axiom


With best regards,
Sincerely yours,

Saburou Saitoh
2019.8.10.9:25



2019年8月10日(土) 9:07 Norrish, Michael (Data61, Acton) 
mailto:michael.norr...@data61.csiro.au>>:
It’s still defined inasmuch as it is perfectly legitimate to write x/0 and use 
that term to define other things in turn.   For example, I can define foo = x/0 
+ 1 and then quite successfully prove that x/0 < foo.

I would avoid the use of the word undefined in this context; rather x/0 has an 
unspecified value.  All functions are total so all applications of functions to 
all possible arguments have values.

Michael

> On 9 Aug 2019, at 21:46, Chun Tian (binghe) 
> mailto:binghe.l...@gmail.com>> wrote:
>
> A follow-up of this old topic:
>
> Finally I found the following definitions of `extreal_inv` and `extreal_div` 
> based on new_specification():
>
> local
>  val lemma = Q.prove (
> `?i. (i NegInf = Normal 0) /\
>  (i PosInf = Normal 0) /\
>  (!r. r <> 0 ==> (i (Normal r) = Normal (inv r)))`,
>   (* proof *)
>  Q.EXISTS_TAC `\x. if (x = PosInf) \/ (x = NegInf) then Normal 0
>else if x = Normal 0 then ARB
>else Normal (inv (real x))` \\
>  RW_TAC std_ss [extreal_not_infty, real_normal]);
> in
>  (* |- extreal_inv NegInf = Normal 0 /\
>extreal_inv PosInf = Normal 0 /\
>!r. r <> 0 ==> extreal_inv (Normal r) = Normal (inv r)
>   *)
>  val extreal_inv_def = new_specification
>("extreal_inv_def", ["extreal_inv"], lemma);
> end;
>
> local
>  val lemma = Q.prove (
> `?d. (!r. d (Normal r) PosInf = Normal 0) /\
>  (!r. d (Normal r) NegInf = Normal 0) /\
>  (!x r. r <> 0 ==> (d x (Normal r) = extreal_mul x (extreal_inv 
> (Normal r`,
>   (* proof *)
>  Q.EXISTS_TAC `\x y.
>if ((y = PosInf) \/ (y = NegInf)) /\ (?r. x = Normal r) then Normal 0
>else if y = Normal 0 then ARB
>else extreal_mul x (extreal_inv y)` \\
>  RW_TAC std_ss [extreal_not_infty, real_normal]);
> in
>  (* |- (!r. extreal_div (Normal r) PosInf = Normal 0) /\
>(!r. extreal_div (Normal r) NegInf = Normal 0) /\
>!x r. r <> 0 ==> extreal_div x (Normal r) = x * extreal_inv (Normal r)
>   *)
>  val extreal_div_def = new_specification
>("extreal_div_def", ["extreal_div"], lemma);
> end;
>
> In this way, things like `extreal_inv 0` and `extreal_div x 0` are *really* 
> undefined.
>
> --Chun
>
> Il 20/02/19 06:48, 
> michael.norr...@data61.csiro.au ha 
> scritto:
>> Your right hand side is no better than ARB really.  You say that your aim is 
>> to avoid x/0 = y, with y a literal extreal.  But if you believe ARB is a 
>> literal extreal, then I will define
>>
>>  val pni_def = Define`pni = @x. (x = PosInf) \/ (x = NegInf)`;
>>
>> and then I can certainly prove that x/0 = pni.  If ARB is a literal extreal, 
>> surely pni is too.
>>
>> (Recall that ARB's definition is `ARB = @x. T`.)
>>
>> Michael
>>
>>
>> On 20/2/19, 09:31, "Chun Tian (binghe)" 
>> mailto:binghe.l...@gmail.com>> wrote:
>>
>>Some further updates:
>>
>>With my last definition of `extreal_div`, I still have:
>>
>> |- !x. x / 0 = ARB
>>
>>and
>>
>> |- 0 / 0 = ARB
>>
>>trivially holds (by definition). This is still not satisfied to me.
>>
>>Now I tried the following new definition which looks more reasonable:
>>
>>val extreal_div_def = Define
>>   `extreal_div x y = if y = Normal 0 then
>>  (@x. (x = PosInf) \/ (x = NegInf))
>>  else extreal_mul x (extreal_inv y)`;
>>
>>literally, it says anything (well, let's ignore zero) divides zero is
>>equal to either +Inf or -Inf.  But actually the choice of +Inf/-Inf is
>>irrelevant, as the sole purpose is to prevent any theorem like ``|- x /
>>0 = y`` being proved, in which y is a literal extreal. For example, if I
>>try to prove ``!x. x / 0 = ARB``:
>>
>>(* with the new definition, ``x / 0 = ARB`` (or any other extreal) can't
>>be proved, e.g.
>>val test_div = prove (
>>   `!x. extreal_div x (Normal 0) = ARB`,
>>RW_TAC std_ss [extreal_div_def]
 Suff `(\f. f = ARB) (@x. (x = PosInf) ∨ (x = NegInf))`
>>> - RW_TAC 

[Hol-info] Third CfP: Formal Techniques for Safety-Critical Systems (FTSCS'19 -- an ICFEM event)

[Osman Hasan via hol-info]

 Call for Papers

   FTSCS 2019

7th International Workshop on Formal Techniques for Safety-Critical Systems

   Shenzhen, China, November, 9, 2019
   (satellite workshop of ICFEM 2019)

 http://www.ftscs.org

-
*** Science of Computer Programming special issue ***
*** Springer CCIS proceedings ***

Submission deadline: September 3, 2019

Aims and Scope:

There is an increasing demand for using formal methods to validate and
verify safety-critical systems in fields such as power generation and
distribution, avionics, automotive systems, medical systems, and
autonomous vehicles. In particular, newer standards, such as DO-178C
(avionics), ISO 26262 (automotive systems), IEC 62304 (medical
devices), and CENELEC EN 50128 (railway systems), emphasize the need
for formal methods and model-based development, thereby speeding up
the adaptation of such methods in industry.

The aim of this workshop is to bring together researchers and engineers
who are interested in the application of formal and semi-formal methods
to improve the quality of safety-critical computer systems. FTSCS
strives to promote research and development of formal methods and
tools for industrial applications, and is particularly interested in
industrial applications of formal methods.

Specific topics include, but are not limited to:

* case studies and experience reports on the use of formal methods for
  analyzing safety-critical systems, including avionics, automotive,
  medical, railway, and other kinds of safety-critical and
  QoS-critical systems
* methods, techniques and tools to support automated analysis,
  certification, debugging, etc., of safety/QoS-critical systems
* analysis methods that address the limitations of formal methods in
  industry (usability, scalability, etc.)
* formal analysis support for modeling languages used in industry,
  such as AADL, Ptolemy, SysML, SCADE, Modelica, etc.
* code generation from validated models.

The workshop will provide a platform for discussions and the exchange of
innovative ideas, so submissions on work in progress are encouraged.

Submission:

We solicit submissions reporting on:

A- original research contributions (16 pages max);
B- applications and experiences (16 pages max);
C- surveys, comparisons, and state-of-the-art reports (16 pages max);
D- tool papers (6 pages max);
E- position papers and work in progress (6 pages max)

related to the topics mentioned above.

All submissions must be original, unpublished, and not submitted
concurrently for publication elsewhere. Paper submission is done
via EasyChair at https://easychair.org/my/conference?conf=ftscs2019.
The final version of the paper must be prepared in LaTeX, adhering to
the LNCS format available at
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0.

Springer encourages authors to include their ORCIDs (https://goo.gl/hbsa4D)
 in their papers. In addition, the corresponding author of each paper,
acting on behalf of all of the authors of that paper, must complete and
sign a Consent-to-Publish form. The corresponding author signing the
copyright
form should match the corresponding author marked on the paper. Once the
files
have been sent to Springer, changes relating to the authorship of the
papers cannot be made.

Publication:

All accepted papers will appear in the pre-proceedings of FTSCS 2019.
Accepted papers in the categories A-D above will appear in the
workshop proceedings that will be published as a volume in
Springer's CCIS series.

The authors of a selected subset of accepted papers will be invited to
submit extended versions of their papers to appear in a special issue
of the Science of Computer Programming journal.

Important dates:

Submission deadline: September 3, 2019
Notification of acceptance: October 4, 2019
Workshop: November 9, 2019

Venue:

Shenzhen, China

Program chairs:

Frederic Mallet (INRIA Sophia Antipolis, France)
Osman Hasan (National University of Sciences & Technology, Pakistan)

Program committee:

Cyrille Artho (KTH Royal Institute of Technology, Sweden)
Peter Csaba Ölveczky (University of Oslo, Norway)
Thomas Noll (RWTH Aachen University, Germany)
Klaus Havelund (Jet Propulsion Laboratory, USA)
Étienne André (University Paris 13, France)
Robi Malik (University of Waikato, New Zealand)
Roberto Nardone (Mediterranean University of Reggio Calabria, Italy)
Ralf Huuck (UNSW, Australia)
Sofiène Tahar (Concordia University, Canada)
Toshiaki Aoki (JAIST, Japan)
Kyungmin Bae (Pohang University of Science and Technology, Korea)
Fuyuki Ishikawa (National Institute of Infomatics, Japan)
Carolyn Talcott (SRI International, USA)
Tatsuhiro Tsuchiya (Osaka University, Japan)
Huibiao Zhu (East China Normal University, China)
Alexander Knapp (Universität 

[Hol-info] ICLP 2019 - CALL FOR PARTICIPATION

[Fioretto, Ferdinando]

CALL FOR PARTICIPATION - ICLP 2019 - https://www.cs.nmsu.edu/ALP/iclp2019/

The 35th International Conference on Logic Programming
September 20-25, 2019, Las Cruces, New Mexico, USA
---

Since the first conference held in Marseille in 1982, ICLP has been the premier
international event for presenting research in logic programming.
THE ICLP 2019 program will include presentations of high-quality scientific work
in all areas of logic programming.
Besides the main track, ICLP 2019 will host additional tracks and special 
sessions:
- Applications Track
- Sister Conferences and Journal Presentation Track
- Research Challenges in Logic Programming Track
- Special Session: Women in Logic Programming

---
WORKSHOPS

Associated with the conference are two workshops:
- Workshop on Epistemic Extensions of Logic Programming (EELP 2019)
  https://www.semsys.aau.at/events/eelp2019/
- The 6th Workshop on Probabilistic Logic Programming (PLP 2019)
  http://stoics.org.uk/plp/plp2019/

---
DOCTORAL CONSORTIUM - 
https://sites.google.com/cs.stonybrook.edu/iclp2019dc/iclp-2019-doctoral-consortium

Additionally, ICLP 2019 will host the 15th Doctoral Consortium (DC) on Logic
Programming (September, 22, 2019)

---
TUTORIALS AND INVITED TALKS - 
https://www.cs.nmsu.edu/ALP/iclp2019/tutorials.html

Tutorials
- Serdar Kadioglu - Constraint Programming for Resource Management
- Chitta Baral - Knowledge Representation and Reasoning issues in Natural
  Language Question Answering
- Guy Van den Broeck - Tractable Probabilistic Circuits

Invited talks
- Nicola Leone - ASP Applications for AI and Industry
- Sheila McIlraith - Reward Machines: Structuring reward function specifications
  and reducing sample complexity in reinforcement learning -
- Adnan Darwiche - What Logic Can Do for AI Today

Women in LP Invited talk
- Yuliya Lierler - System PROJECTOR: An Automatic Program Rewriting Tool for
  Non-Ground Answer Set Programs

--
REGISTRATION - https://shopcart.nmsu.edu/shop/icpl2019

The registration costs and deadlines are as follows:

- General
  + Early registration - August, 10, 2019 - 600.00 USD
  + Late registration - 650.00 USD
- Student
  + Early registration - August, 10, 2019 - 400.00 USD
  + Late registration - 450.00 USD
- Workshop only
  + Early registration - August, 10, 2019 - 200.00 USD
  + Late registration - 250.00 USD

--
TRAVEL INFORMATION - https://www.cs.nmsu.edu/ALP/iclp2019/travel.html

--
ACCEPTED PAPERS - https://www.cs.nmsu.edu/ALP/iclp2019/schedule.html

Rapid communications (TPLP)

- Thomas Eiter, Paul Ogris and Konstantin Schekotihin. A Distributed Approach 
to LARS Stream Reasoning (System paper)
  https://arxiv.org/abs/1907.12344
- Jorge Fandinno. Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic 
Splitting
  https://arxiv.org/abs/1907.09247
- Amelia Harrison and Vladimir Lifschitz. Relating Two Dialects of Answer Set 
Programming
  https://arxiv.org/abs/1907.12139
- Giovanni Amendola, Carmine Dodaro and Marco Maratea. Abstract Solvers for 
Computing Cautious Consequences of ASP programs
  https://arxiv.org/abs/1907.09402
- Bernardo Cuteri, Carmine Dodaro, Francesco Ricca and Peter Schüller. Partial 
Compilation of ASP Programs
  https://arxiv.org/abs/1907.10469
- Giovanni Amendola, Carmine Dodaro and Francesco Ricca. Better Paracoherent 
Answer Sets with Less Resources
  https://arxiv.org/abs/1907.09560
- Elvira Albert, Miquel Bofill, Cristina Borralleras, Enrique Martin-Martin and 
Albert Rubio. Resource Analysis driven by (Conditional) Termination Proofs
  https://arxiv.org/abs/1907.10096
- Gonzague Yernaux and Wim Vanhoof. Anti-unification in Constraint Logic 
Programming
  https://arxiv.org/abs/1907.10333
- Francesco Calimeri, Giovambattista Ianni, Francesco Pacenza, Simona Perri and 
Jessica Zangari. Incremental answer set programming with overgrounding
  https://arxiv.org/abs/1907.09212
- María Alpuente, Demis Ballis, Santiago Escobar and Julia Sapiña. Symbolic 
Analysis of Maude Theories with Narval (system description)
  https://arxiv.org/abs/1907.10919
- Joao Alcantara, Samy Sá and Juan Carlos Acosta-Guadarrama. On the Equivalence 
Between Abstract Dialectical Frameworks and Logic Programs
  https://arxiv.org/abs/1907.09548
- Giovanni Amendola and Francesco Ricca. Paracoherent Answer Set Semantics 
meets Argumentation Frameworks
  https://arxiv.org/abs/1907.09426
- Wolfgang Faber, Michael Morak and Stefan Woltran. On the Uniform Equivalence 
of Epistemic Logic 

[Hol-info] Second call for papers Software Verfication and Testing (SVT) at SAC 2020

[Matthias Güdemann]

   35th Annual ACM Symposium on Applied Computing
   Software Verification and Testing Track
  Brno, Czech Republic
March 30 - April 3, 2020

 http://www.sigapp.org/sac/sac2020/
 SAC SVT 2020 Website : http://guedemann.org/svt2020/

Important dates
===

Sep. 15, 2019 - Submission of regular papers and SRC research abstracts
Nov. 10, 2019 - Notification of paper / SRC abstract acceptance/rejection
Nov. 25, 2019 - Camera-ready copies of accepted papers/SRC
Dec. 10, 2019 - Author registration due date


ACM Symposium on Applied Computing
==

The ACM Symposium on Applied Computing (SAC) has gathered scientists from
different areas of computing over the last thirty years. The forum represents an
opportunity to interact with different communities sharing an interest in
applied computing.

SAC 2020 is sponsored by the ACM Special Interest Group on Applied Computing
(SIGAPP), and will take place in Brno, Czech Republic.

Software Verification and Testing Track
===

The Software Verification and Testing track aims at contributing to the
challenge of improving the usability of formal methods in software
engineering. The track covers areas such as formal methods for verification and
testing, based on theorem proving, model checking, static analysis, and run-time
verification. We invite authors to submit new results in formal verification and
testing, as well as development of technologies to improve the usability of
formal methods in software engineering. Also are welcome detailed descriptions
of applications of mechanical verification to large scale software. Possible
topics include, but are not limited to:

* model checking
* theorem proving
* correct by construction development
* model-based testing
* software testing
* symbolic execution
* static and dynamic analysis
* abstract interpretation
* analysis methods for dependable systems
* software certification and proof carrying code
* fault diagnosis and debugging
* verification and validation of large scale software systems
* real world applications and case studies applying software testing
and verification
* benchmarks and data sets for software testing and verification

Submission Guidelines
=

Paper submissions must be original, unpublished work. Author(s) name(s) and
address(es) must not appear in the body of the paper, and self-reference should
be avoided and made in the third person. Submitted paper will undergo a blind
review process. Authors of accepted papers should submit an editorial revision
of their papers that fits within eight two-column pages (an extra two pages, to
a total of ten pages, may be available at a charge). The length of a
poster is limited to three
pages (plus one extra page may be available at a charge). Please
comply to this page
limitation already at submission time. Accepted papers will be published in the
ACM SAC 2020 proceedings.

Paper registration is required, allowing the inclusion of papers/posters
in the conference proceedings. An author or a proxy attending SAC
MUST present the work. This is a requirement for the presented work to be
included in the ACM digital library. No-show of registered papers and posters
will result in excluding them from the ACM digital library.

It is planned to arrange a journal special issue after the conference.

Student Research Competition


As previous editions, SAC 2020 organises a Student Research Competition (SRC)
Program to provide graduate students the opportunity to meet and exchange ideas
with researchers and practitioners in their areas of interest. Guidelines and
information about the SRC program can be found at
http://www.sigapp.org/sac/sac2020/.

SAC-SVT Program Committee Chairs
===

Matthias Güdemann, IOHK, Hong Kong
Nikolai Kosmatov, CEA List, France

SAC-SVT Program Committee
=

 - Wolfgang Ahrendt, Chalmers University, Sweden
 - Sébastien Bardin, CEA, France
 - Ezio Bartocci, TU Vienna, Austria
 - Radu Calinescu, University of York, UK
 - Christian Colombo, University of Malta, Malta
 - Maxime Cordy, University of Luxembourg, Luxembourg
 - Cristina David, University of Cambridge, UK
 - Giovanni Denaro, University of Milano Bicocca, Milano, Italy
 - Cathérine Dubois, ENSIIE, France
 - Gidon Ernst, LMU Munich, Germany
 - Yliès Falcone,  University Grenoble Alpes, Inria, France
 - Carlo A. Furia, Università della Svizzera Italiana, Switzerland
 - Maria del Mar Gallardo,  University of Malaga, Spain
 - Sylvain Hallé, Université du Québec à Chicoutimi, Canada
 - Ralf Huuck, The University of New South Wales, Australia
 - Thierry Jéron, Inria, France
 - Maurizio Leotta, University of Genoa, Italy
 - Martin Leucker, University of Lübeck, Germany
 - Stefan Leue, University of Konstanz, 

[Hol-info] ICLP 2019 - Call for Participation (Early registration deadline is today)

[Fioretto, Ferdinando]

CALL FOR PARTICIPATION - ICLP 2019 - https://www.cs.nmsu.edu/ALP/iclp2019/

The 35th International Conference on Logic Programming
September 20-25, 2019, Las Cruces, New Mexico, USA
---

Since the first conference held in Marseille in 1982, ICLP has been the premier
international event for presenting research in logic programming.
THE ICLP 2019 program will include presentations of high-quality scientific work
in all areas of logic programming.
Besides the main track, ICLP 2019 will host additional tracks and special 
sessions:
- Applications Track
- Sister Conferences and Journal Presentation Track
- Research Challenges in Logic Programming Track
- Special Session: Women in Logic Programming

---
WORKSHOPS

Associated with the conference are two workshops:
- Workshop on Epistemic Extensions of Logic Programming (EELP 2019)
  https://www.semsys.aau.at/events/eelp2019/
- The 6th Workshop on Probabilistic Logic Programming (PLP 2019)
  http://stoics.org.uk/plp/plp2019/

---
DOCTORAL CONSORTIUM - 
https://sites.google.com/cs.stonybrook.edu/iclp2019dc/iclp-2019-doctoral-consortium

Additionally, ICLP 2019 will host the 15th Doctoral Consortium (DC) on Logic
Programming (September, 22, 2019)

---
TUTORIALS AND INVITED TALKS - 
https://www.cs.nmsu.edu/ALP/iclp2019/tutorials.html

Tutorials
- Serdar Kadioglu - Constraint Programming for Resource Management
- Chitta Baral - Knowledge Representation and Reasoning issues in Natural
  Language Question Answering
- Guy Van den Broeck - Tractable Probabilistic Circuits

Invited talks
- Nicola Leone - ASP Applications for AI and Industry
- Sheila McIlraith - Reward Machines: Structuring reward function specifications
  and reducing sample complexity in reinforcement learning -
- Adnan Darwiche - What Logic Can Do for AI Today

Women in LP Invited talk
- Yuliya Lierler - System PROJECTOR: An Automatic Program Rewriting Tool for
  Non-Ground Answer Set Programs

--
REGISTRATION - https://shopcart.nmsu.edu/shop/icpl2019

The registration costs and deadlines are as follows:

- General
  + Early registration - August, 15, 2019 - 600.00 USD
  + Late registration - 650.00 USD
- Student
  + Early registration - August, 15, 2019 - 400.00 USD
  + Late registration - 450.00 USD
- Workshop only
  + Early registration - August, 15, 2019 - 200.00 USD
  + Late registration - 250.00 USD

--
TRAVEL INFORMATION - https://www.cs.nmsu.edu/ALP/iclp2019/travel.html

--
ACCEPTED PAPERS - https://www.cs.nmsu.edu/ALP/iclp2019/schedule.html

Rapid communications (TPLP)

- Thomas Eiter, Paul Ogris and Konstantin Schekotihin. A Distributed Approach 
to LARS Stream Reasoning (System paper)
  https://arxiv.org/abs/1907.12344
- Jorge Fandinno. Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic 
Splitting
  https://arxiv.org/abs/1907.09247
- Amelia Harrison and Vladimir Lifschitz. Relating Two Dialects of Answer Set 
Programming
  https://arxiv.org/abs/1907.12139
- Giovanni Amendola, Carmine Dodaro and Marco Maratea. Abstract Solvers for 
Computing Cautious Consequences of ASP programs
  https://arxiv.org/abs/1907.09402
- Bernardo Cuteri, Carmine Dodaro, Francesco Ricca and Peter Schüller. Partial 
Compilation of ASP Programs
  https://arxiv.org/abs/1907.10469
- Giovanni Amendola, Carmine Dodaro and Francesco Ricca. Better Paracoherent 
Answer Sets with Less Resources
  https://arxiv.org/abs/1907.09560
- Elvira Albert, Miquel Bofill, Cristina Borralleras, Enrique Martin-Martin and 
Albert Rubio. Resource Analysis driven by (Conditional) Termination Proofs
  https://arxiv.org/abs/1907.10096
- Gonzague Yernaux and Wim Vanhoof. Anti-unification in Constraint Logic 
Programming
  https://arxiv.org/abs/1907.10333
- Francesco Calimeri, Giovambattista Ianni, Francesco Pacenza, Simona Perri and 
Jessica Zangari. Incremental answer set programming with overgrounding
  https://arxiv.org/abs/1907.09212
- María Alpuente, Demis Ballis, Santiago Escobar and Julia Sapiña. Symbolic 
Analysis of Maude Theories with Narval (system description)
  https://arxiv.org/abs/1907.10919
- Joao Alcantara, Samy Sá and Juan Carlos Acosta-Guadarrama. On the Equivalence 
Between Abstract Dialectical Frameworks and Logic Programs
  https://arxiv.org/abs/1907.09548
- Giovanni Amendola and Francesco Ricca. Paracoherent Answer Set Semantics 
meets Argumentation Frameworks
  https://arxiv.org/abs/1907.09426
- Wolfgang Faber, Michael Morak and Stefan Woltran. On the Uniform Equivalence 
of Epistemic Logic