ICLP 2019 Main Conference Programme
September 22: Sunday
8:15--8:30 Conference opening
8:30--9:30 Invited Talk: Adnan Darwiche. What Logic Can Do for AI Today
9:30--10:00 The Alain Colmerauer 10 year test-of-time award: Martin Gebser, Max Ostrowski, Torsten Schaub. Constraint Answer Set Solving 
Coffee 10:00—10:30
10:30--12:00 Epistemic LP (Michael Gelfond)
  
10:30 Jorge Fandinno. Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting 
11:00 Stefania Costantini. About epistemic negation and world views in Epistemic Logic Programs
11:30 Michael Morak. Epistemic Logic Programs: A Different World View
10:30--12:00 Constraints & LP (Yuanlin Zhang)
 
10:30 Best Applications Paper Award: Fernando Saenz-Perez. Applying Constraint Logic Programming to SQL Semantic Analysis
11:00 Joaquin Arias and Manuel Carro. Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP
11:30 Gonzague Yernaux and Wim Vanhoof. Anti-unification in Constraint Logic Programming
Lunch 12:00—13:00
13:00--14:30 Semantics (Mario Alviano) 
    
13:00 Giovanni Amendola, Francesco Ricca and Mirek Truszczynski. Beyond NP: Quantifying over Answer Sets 
13:30 Vincent Barichard and Igor Stéphan. Quantified Constraint Handling Rules
14:00 João Barbosa, Mário Florido and Vítor Santos Costa. A Three-Valued Semantics for Typed Logic Programming
13:00--14:30 Applications 1 (Andrea Formisano)
 
13:00 Richard Taupe, Konstantin Schekotihin, Peter Schüller, Antonius Weinzierl and Gerhard Friedrich. Exploiting Partial Knowledge in Declarative Domain-Specific Heuristics for ASP
13:30 Giacomo Da Col and Erich Teppan. Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem  (Short paper)
13:45 Tarek Khaled and Belaid Benhamou. An ASP-based Approach for Attractor Enumeration in Synchronous and Asynchronous Boolean networks (Short paper)
14:00 Liu Liu and Mirek Truszczynski. Encoding Selection for Solving Hamiltonian Cycle Problems with ASP (Short paper)
14:15 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 (Short paper) 
 
Coffee 14:30—15:00
15:00--16:30 Equivalence of Programs (Thomas Eiter) 
    
15:00 Wolfgang Faber, Michael Morak and Stefan Woltran. On the Uniform Equivalence of Epistemic Logic Programs   
15:30 Bin Wang, Shen Jun, Shutao Zhang and Zhizheng Zhang. On the Strong Equivalences of LPMLN Programs 
16:00 Joohyung Lee and Man Luo. Strong Equivalence for LPMLN Programs
15:00--16:30 Testing LP (Manuel Hermenegildo)
    
15:00 Mario Alviano, Carmine Dodaro, Johannes K. Fichte, Markus Hecher, Tobias Philipp and Jakob Rath. Inconsistency Proofs for ASP: The ASP-DRUPE Format
15:30 Falco Nogatz, Philipp Koerner and Sebastian Krings. Prolog Coding Guidelines: Status and Tool Support
16:00 Giovanni Amendola, Tobias Berei and Francesco Ricca. On Improving Unit Testing in IDEs for ASP (Extended Abstract)
Coffee 16:30—17:00
17:00--18:00 Tutorial: Chitta Baral. Knowledge Representation and Reasoning issues in Natural Language Question Answering
Reception 18:00
 
September 23: Monday
8:30--9:30 Invited Talk: Nicola Leone. ASP Applications for AI and Industry
9:30--10:00 Best Systems Paper Award: Thomas Eiter, Paul Ogris and Konstantin Schekotihin. A Distributed Approach to LARS Stream Reasoning (System paper)
Coffee 10:00—10:30
10:30--12:00 Efficient Grounding (Martin Gebser)
  
10:30 Francesco Calimeri, Giovambattista Ianni, Francesco Pacenza, Simona Perri and Jessica Zangari. Incremental answer set programming with overgrounding
11:00 Bernardo Cuteri, Carmine Dodaro, Francesco Ricca and Peter Schüller. Partial Compilation of ASP Programs
11:30 David Spies, Jia-Huai You and Ryan Hayward. Mutex Graphs and Multicliques: Reducing Grounding Size for Planning    
10:30--12:00 Datalog 1 (Carlo Zaniolo)
 
10:30 TPLP Best Student Paper Award: Ariyam Das and Carlo Zaniolo. A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation
11:00 K. Tuncay Tekle and Yanhong A. Liu. Extended Magic for Negation: Efficient Demand-Driven Evaluation of Stratified Datalog with Precise Complexity Guarantees
11:30 Alessio Fiorentino, Nicola Leone, Marco Manna, Simona Perri and Jessica Zangari. Precomputing Datalog evaluation plans in large-scale scenarios
Lunch 12:00—13:00
13:00--14:00 Tutorial: Guy Van den Broeck. Tractable Probabilistic Circuits
14:00--14:45 Probabilistic LP

14:00--14:30 Sarthak Ghosh and C. R. Ramakrishnan. Value of Information in Probabilistic Logic Programs
14:30--14:45 Joohyung Lee and Yi Wang. Weight Learning in a Probabilistic Extension of Answer Set Programs (Sister Conferences & Journals)
Excursion (15:00 -- 20:00)
 
September 24: Tuesday
8:30--9:30 Invited Talk (Women in LP): Yuliya Lierler. System PROJECTOR: An Automatic Program Rewriting Tool for Non-Ground Answer Set Programs
9:30--10:00 Best DC paper award: Yusuf Izmirlioglu. Reasoning about Qualitative Direction and Distance between Extended Objects using Answer Set Programming
Coffee 10:00—10:30
10:30--12:00 Argumentation (Wolfgang Faber)
  
10:30 Giovanni Amendola, Carmine Dodaro and Francesco Ricca. Better Paracoherent Answer Sets with Less Resources
11:00 Giovanni Amendola and Francesco Ricca. Paracoherent Answer Set Semantics meets Argumentation Frameworks
11:30 Joao Alcantara, Samy Sá and Juan Carlos Acosta-Guadarrama. On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs 
10:30--12:00 Women in LP (Alicia Villanueva)
 
10:30 Daniela Inclezan. RESTKB: A Library of Commonsense Knowledge about Dining at a Restaurant
11:00 Jessica Zangari, Francesco Calimeri and Simona Perri. Tree Decomposition Rewritings for Optimizing Logic Programs under Answer Set Semantics
11:15 Abeer Dyoub, Stefania Costantini and Francesca A. Lisi. Towards Ethical Machines Via Logic Programming  (Short paper)
11:30 Valentina Pitoni and Stefania Costantini. A Temporal Module for Logical Frameworks (Short paper)
11:45 Carmen Leticia García Mata and Pedro Rafael Márquez-Rodríguez. Solving a Flowshop Scheduling Problem with Answer Set Programming: Exploiting the Problem to Reduce the Number of Combinations (Short paper)
Lunch 12:00—13:00
13:00--14:30 Planning (Yuliya Lierler)
 
13:00 Yi Wang, Shiqi Zhang and Joohyung Lee. Bridging Commonsense Reasoning and Probabilistic Planning via a Probabilistic Action Language (Application Paper)
13:30 David Spies, Jia-Huai You and Ryan Hayward. Domain-Independent Cost-Optimal Planning in ASP
14:00 Daoming Lyu, Fangkai Yang, Bo Liu and Steven Gustafson. A Human-Centered Data-Driven Planner-Actor-Critic Architecture via Logic Programming
13:00--14:30 Systems 1 (Manuel Carro)
 
13:00 María Alpuente, Demis Ballis, Santiago Escobar and Julia Sapiña. Symbolic Analysis of Maude Theories with Narval (system description) 
13:30 Elvira Albert, Miquel Bofill, Cristina Borralleras, Enrique Martin-Martin and Albert Rubio. Resource Analysis driven by (Conditional) Termination Proofs
14:00 Santiago Escobar and Julia Sapiña. Most General Variant Unifiers
Coffee 14:30—15:00
15:00--16:30 Analysis of LP (Gopal Gupta)
    
15:00 Jesús J. Doménech, John Gallagher and Samir Genaim. Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis
15:30 Mateusz Ślażyński, Salvador Abreu and Grzegorz J.Nalepa. Generating Local Search Neighborhood with Synthesized Logic Programs
16:00 Maximiliano Klemen, Pedro Lopez-Garcia, John Gallagher, José F. Morales and Manuel V. Hermenegildo. Towards a General Framework for Static Cost Analysis of Parallel Logic Programs
15:00--16:30 Sister Conferences & Journals (Short papers) (Giovambattista Ianni)
    
15:00 Stefania Costantini, Giovanni De Gasperis and Raffaele Olivieri. Digital Forensics and Investigations meets Artificial Intelligence
15:15 Pedro Cabalar, Martín Diéguez and Torsten Schaub. Towards Dynamic Answer Set Programming
15:30 Christian Haubelt, Kai Neubauer, Torsten Schaub and Philipp Wanko. Hybrid Answer Set Programming for Design Space Exploration
15:45 Yuanlin Zhang, Jianlan Wang, Fox Bolduc and William G Murray. LP Based Integration of Computing and Science Education in Middle Schools
16:00 Da Shen and Yuliya Lierler. SMT-based Constraint Answer Set Solver EZSMT+ for Non-tight Programs
16:15 Yanhong A. Liu and Scott Stoller. Rules with Negation in Recursion: Founded Semantics and Constraint Semantics
Coffee 16:30—17:00
17:00--18:00 Tutorial: Serdar Kadıoğlu. Constraint Programming for Resource Management
Banquet (Banquet Speaker: Michael Gelfond)
 
September 25: Wednesday
8:30--9:30 Invited Talk: Sheila McIlraith. Reward Machines: Structuring reward function specifications and reducing sample complexity in reinforcement learning
9:30--10:00 Amelia Harrison and Vladimir Lifschitz. Relating Two Dialects of Answer Set Programming 
Coffee 10:00—10:30
10:30--12:15 Systems 2 (Francesco Ricca)
 
10:30 Best Technical Paper Award: Giovanni Amendola, Carmine Dodaro and Marco Maratea. Abstract Solvers for Computing Cautious Consequences of ASP programs
11:00 Paul Tarau, Jan Wielemaker and Tom Schrijvers. Lazy Stream Programming in Prolog
11:30 Ignacio Casso, José F. Morales, Pedro López and Manuel Hermenegildo. Towards Computing Abstract Distances in Logic Programs
10:30--12:00 Commonsense Reasoning (Vladimir Lifschitz)
 
10:30 Tiantian Gao, Paul Fodor and Michael Kifer. Querying Knowledge via Multi-Hop English Questions
11:00 Arpit Sharma. Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge
11:30 Van Nguyen, Tran Cao Son and Enrico Pontelli. Natural Language Generation for Non-Expert Users   
Lunch 12:00—13:00
13:00--14:30 Languages (Paul Fodor)
 
13:00 Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Perez and Concepcion Vidal. Revisiting Explicit Negation in Answer Set Programming
13:30 Matti Berthold, Ricardo Gonçalves, Matthias Knorr and Joao Leite. A Syntactic Operator for Forgetting that Satisfies Strong Persistence
14:00 Adrien Husson and Jean Krivine. A tractable logic for molecular biology
13:00--14:30 Applications 2 (David Warren)
 
13:00 Efthimis Tsilionis, Nikolaos Koutroumanis, Panagiotis Nikitopoulos, Christos Doulkeridis and Alexander Artikis. Online Event Recognition from Moving Vehicles: Application Paper
13:30 Ariyam Das, Youfu Li, Jin Wang, Mingda Li and Carlo Zaniolo. Big Data Applications from Graph Analytics to Machine Learning by Aggregates in Recursion (Short paper)
13:45 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 (Short paper)
14:00--14:15 Walter Wilson. Axiomatic Language: A Short Presentation
14:15--14:30 Farhad Shakerin. Induction of Non-Monotonic Logic Programs To Explain Statistical Learning Models. (DC)
Coffee 14:30—15:00
15:00--16:30  Datalog 2 (Jose Morales)
    
15:00 Angelos Charalambidis, Christos Nomikos and Panos Rondogiannis. The Expressive Power of Higher-Order Datalog
15:30 Carlo Zaniolo, Ariyam Das, Jiaqi Gu, Mingda Li, Youfu Li and Jin Wang. Pre-Mappable Constraints in Recursive Programs   
16:00 Mario Alviano, Nicola Leone, Pierfrancesco Veltri and Jessica Zangari. Enhancing magic sets for ontological reasoning
15:00--16:30 Action languages (Jorge Fandinno & Giovambattista Ianni)
    
15:00 Craig Olson and Yuliya Lierler. Information Extraction Tool Text2ALM: From Narratives to Action Language System Descriptions 
15:30 Daoming Lyu, Fangkai Yang, Bo Liu and Steven Gustafson. SDRL: Interpretable and Data-efficient Deep Reinforcement Learning Leveraging Symbolic Planning (Sister conferences and journals)
15:45--16:00 Wolfgang Faber, Michael Morak and Stefan Woltran. Strong Equivalence for Epistemic Logic Programs Made Easy: Extended Abstract (Sister conferences and journals)
16:00--16:15 Francesco Fabiano. Design of a Solver for Multi-Agent Epistemic Planning. (DC)
Coffee 16:30—17:00
17:00--18:00 ALP meeting
18:00 Conference closing