[Om-announce] ICLP 2019 - Call for Participation (Early registration deadline is today)

Fioretto, Ferdinando fioretto.ferdinando at isye.gatech.edu
Thu Aug 15 16:11:51 CEST 2019 

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 Programs
  https://arxiv.org/abs/1907.10925
- Mario Alviano, Carmine Dodaro, Johannes K. Fichte, Markus Hecher, Tobias Philipp and Jakob Rath. Inconsistency Proofs for ASP: The ASP-DRUPE Format
  https://arxiv.org/abs/1907.10389
- Ariyam Das and Carlo Zaniolo. A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation
  https://arxiv.org/abs/1907.10278
- Mario Alviano, Nicola Leone, Pierfrancesco Veltri and Jessica Zangari. Enhancing magic sets for ontological reasoning
  https://arxiv.org/abs/1907.08424
- Angelos Charalambidis, Christos Nomikos and Panos Rondogiannis. The Expressive Power of Higher-Order Datalog
  https://arxiv.org/abs/1907.09820
- Joaquin Arias and Manuel Carro. Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP
  https://arxiv.org/abs/1908.00104
- Alessio Fiorentino, Nicola Leone, Marco Manna, Simona Perri and Jessica Zangari. Precomputing Datalog evaluation plans in large-scale scenarios
  https://arxiv.org/abs/1907.12495
- Giovanni Amendola, Francesco Ricca and Mirek Truszczynski. Beyond NP: Quantifying over Answer Sets
  https://arxiv.org/abs/1907.09559
- Jesús J. Doménech, John Gallagher and Samir Genaim. Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis
  https://arxiv.org/abs/1907.12345
- Matti Berthold, Ricardo Gonçalves, Matthias Knorr and Joao Leite. A Syntactic Operator for Forgetting that Satisfies Strong Persistence
  https://arxiv.org/abs/1907.12501
- David Spies, Jia-Huai You and Ryan Hayward. Domain-Independent Cost-Optimal Planning in ASP
  https://arxiv.org/abs/1908.00112
- Tiantian Gao, Paul Fodor and Michael Kifer. Querying Knowledge via Multi-Hop English Questions
  http://arxiv.org/abs/1907.08176
- Stefania Costantini. About epistemic negation and world views in Epistemic Logic Programs
  https://arxiv.org/abs/1907.09867
- Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Perez and Concepcion Vidal. Revisiting Explicit Negation in Answer Set Programming
  https://arxiv.org/abs/1907.11467
- Yi Wang, Shiqi Zhang and Joohyung Lee. Bridging Commonsense Reasoning and Probabilistic Planning via a Probabilistic Action Language (Application Paper)
  https://arxiv.org/abs/1907.13482
- Fernando Saenz-Perez. Applying Constraint Logic Programming to SQL Semantic Analysis
  https://arxiv.org/abs/1907.10914
- Efthimis Tsilionis, Nikolaos Koutroumanis, Panagiotis Nikitopoulos, Christos Doulkeridis and Alexander Artikis. Online Event Recognition from Moving Vehicles: Application Paper
  https://arxiv.org/abs/1907.11007
- Arpit Sharma. Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge
  https://arxiv.org/abs/1907.11112

Technical communications (EPTCS)

- Falco Nogatz, Philipp Koerner and Sebastian Krings. Prolog Coding Guidelines: Status and Tool Support
- Richard Taupe, Konstantin Schekotihin, Peter Schüller, Antonius Weinzierl and Gerhard Friedrich. Exploiting Partial Knowledge in Declarative Domain-Specific Heuristics for ASP
- João Barbosa, Mário Florido and Vítor Santos Costa. A Three-Valued Semantics for Typed Logic Programming
- Michael Morak. Epistemic Logic Programs: A Different World View
- Ignacio Casso, José F. Morales, Pedro López and Manuel Hermenegildo. Computing Abstract Distances in Logic Programs
- Emily Leblanc, Marcello Balduccini and Joost Vennekens. Reasoning about Problems of Actual Causation using an Action Language Approach
- Sarthak Ghosh and C. R. Ramakrishnan. Value of Information in Probabilistic Logic Programs
- Giovanni Amendola, Tobias Berei and Francesco Ricca. Unit Testing in ASP Revisited: Language and Test-Driven Development Environment
- Craig Olson and Yuliya Lierler. Information Extraction Tool Text2ALM: From Narratives to Action Language System Descriptions
- Adrien Husson and Jean Krivine. A tractable logic for molecular biology
- Bin Wang, Shen Jun, Shutao Zhang and Zhizheng Zhang. On the Strong Equivalences of LPMLN Programs
- Daniela Inclezan. RESTKB: A Library of Commonsense Knowledge about Dining at a Restaurant
- David Spies, Jia-Huai You and Ryan Hayward. Mutex Graphs and Multicliques: Reducing Grounding Size for Planning
- Santiago Escobar and Julia Sapiña. Most General Variant Unifiers
- Mateusz Ślażyński, Salvador Abreu and Grzegorz J. Nalepa. Generating Local Search Neighborhood with Synthesized Logic Programs
- Daoming Lyu, Fangkai Yang, Bo Liu and Steven Gustafson. PACMAN: A Planner--Actor-Critic Architecture for Human Centered Planning and Reinforcement Learning
- Joohyung Lee and Man Luo. Strong Equivalence for LPMLN Programs
- Vincent Barichard and Igor Stéphan. Quantified Constraint Handling Rules
- Paul Tarau, Jan Wielemaker and Tom Schrijvers. Lazy Stream Programming in Prolog
- Maximiliano Klemen, Pedro Lopez-Garcia, John Gallagher, José F. Morales and Manuel V. Hermenegildo. A General Framework for Static Cost Analysis of Parallel Logic Programs
- K. Tuncay Tekle and Yanhong A. Liu. Extended Magic for Negation: Efficient Demand-Driven Evaluation of Stratified Datalog with Precise Complexity Guarantees
- Carlo Zaniolo, Ariyam Das, Jiaqi Gu, Mingda Li, Youfu Li and Jin Wang. Pre-Mappable Constraints in Recursive Programs
- Giacomo Da Col and Erich Teppan. Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem
- Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, Brais Muñiz, Gilberto Pérez and Francisco Suárez. A Rule-Based System for Explainable Donor-Patient Matching in Liver Transplantation
- Ariyam Das, Youfu Li, Jin Wang, Mingda Li and Carlo Zaniolo. BigData Applications from Graph Analytics to Machine Learning by Aggregates in Recursion
- Christian Haubelt, Kai Neubauer, Torsten Schaub and Philipp Wanko. Design Space Exploration via Answer Set Programming Modulo Theories
- Van Nguyen, Tran Cao Son and Enrico Pontelli. Natural Language Generation for Non-Expert Users
- Tarek Khaled and Belaid Benhamou. An ASP-based Approach for Attractor Enumeration in Synchronous and Asynchronous Boolean networks
- Liu Liu and Mirek Truszczynski. Encoding Selection for Solving Hamiltonian Cycle Problems with ASP
- Nicos Angelopoulos and Jan Wielemaker. Advances in big data bio analytics
- José Luis Vilchis Medina, Pierre Siegel, Andrei Doncescu and Vincent Risch. An Implementation of a Nonmonotonic Logic in an Embedded Computer for a Motor-glider
- Daoming Lyu, Fangkai Yang, Bo Liu and Steven Gustafson. SDRL: Interpretable and Data-efficient Deep Reinforcement Learning Leveraging Symbolic Planning
- Stefania Costantini, Giovanni De Gasperis and Raffaele Olivieri. Digital Forensics and Investigations meets Artificial Intelligence
- Pedro Cabalar, Martín Diéguez and Torsten Schaub. Towards Dynamic Answer Set Programming
- Christian Haubelt, Kai Neubauer, Torsten Schaub and Philipp Wanko. Hybrid Answer Set Programming for Design Space Exploration
- Yuanlin Zhang, Jianlan Wang, Fox Bolduc and William G Murray. LP Based Integration of Computing and Science Education in Middle Schools
- Da Shen and Yuliya Lierler. SMT-based Constraint Answer Set Solver EZSMT+ for Non-tight Programs
- Wolfgang Faber, Michael Morak and Stefan Woltran. Strong Equivalence for Epistemic Logic Programs Made Easy: Extended Abstract
- Yanhong A. Liu and Scott Stoller. Rules with Negation in Recursion: Founded Semantics and Constraint Semantics
- Joohyung Lee and Yi Wang. Weight Learning in a Probabilistic Extension of Answer Set Programs
- Jessica Zangari, Francesco Calimeri and Simona Perri. Hypertree-Decomposition Rewritings for Optimizing Logic Programs under Answer Set Semantics
- Abeer Dyoub, Stefania Costantini and Francesca A. Lisi. Towards Ethical Machines Via Logic Programming
- Valentina Pitoni and Stefania Costantini. A Temporal Module for Logical Frameworks
- Carmen Leticia García Mata. Solving a Flowshop Scheduling Problem with Answer Set Programming: Exploiting the Problem to Reduce the Number of Combinations

------------------------------------------------------------------------------
ORGANIZATION

- General Chairs - Enrico Pontelli, Tran Cao Son
- Program Chairs - Esra Erdem, German Vidal
- Publicity Chair - Ferdinando Fioretto
- Workshops Chair - Martin Gebser
- Tutorials Chair - Pedro Cabalar
- DC Chairs - Paul Fodor, Daniela Inclezan
- Programming Competition Chairs - José Morales, Orkunt Sabuncu
- Applications Track Chairs - Andrea Formisano, Fangkai Yang
- Sister Conferences and Journal Presentation Track Chairs - Bart Bogaerts,
  Giovambattista Ianni
- Research Challenges in Logic Programming Track Chairs - Alessandro dal Palu,
  Amelia Harrison, Joohyung Lee
- Women in Logic Programming Special Session Chairs - Alicia Villanueva,
  Marina De Vos
- Program Committee - Hassan Ait-Kaci, Mario Alviano, Roman Bartak, Rachel
  Ben-Eliyahu-Zohary, Bart Bogaerts, Gerhard Brewka, Pedro Cabalar, Michael
  Codish, Stefania Costantini, Marina De Vos, Agostino Dovier, Thomas Eiter,
  Wolfgang Faber, Fabio Fioravanti, Andrea Formisano, John Gallagher, Martin
  Gebser, Michael Gelfond, Michael Hanus, Amelia Harrison, Manuel Hermenegildo,
  Giovambattista Ianni, Daniela Inclezan, Katsumi Inoue, Tomi Janhunen, Angelika
  Kimmig, Ekaterina Komendantskaya, Vladimir Lifschitz, Evelina Lamma, Joohyung
  Lee, Nicola Leone, Yanhong Annie Liu, Fred Mesnard, Jose F. Morales, Emilia
  Oikarinen, Carlos Olarte, Magdalena Ortiz, Mauricio Osorio, Barry O'Sullivan,
  Simona Perri, Enrico Pontelli, Ricardo Rocha, Alessandra Russo, Orkunt
  Sabuncu, Chiaki Sakama, Torsten Schaub, Guillermo R. Simari, Theresa Swift,
  Francesca Toni, Paolo Torroni, Tran Cao	Son, Alicia Villanueva, Kewen Wang,
  Jan Wielemaker, Stefan Woltran, Fangkai Yang, Roland Yap, Jia-Huai You,
  Zhizheng Zhang

More information about the Om-announce mailing list