LPNMR 2017

LPNMR 2017

Program

Workshops

Proceedings

Registration

Travel & Lodging

For Authors

Committees

Program

Program at a Glance

Day Monday, July 3 Tuesday, July 4 Wednesday, July 5 Thursday, July 6

Time

Workshops

Nonmonotonic Reasoning

Applications

Systems and Extensions

08:30-09:00

Coffee

Coffee

Coffee

Coffee

09:00-10:00

Workshops

Opening & Invited talk:
Francesca Toni

Invited talk:
Tran Cao Son

Invited talk:
João Leite

10:00-12:00

Workshops

Session I: NMR

Session IV: Planning & LPNMR Apps

Session VI:
LPNMR Systems

12:00-13:30

Lunch

Lunch

Lunch

Lunch

13:30-15:00

Workshops

Session II: ASP

Session V:
LPNMR Apps

Session VII:
Extensions of ASP

15:00-15:30

Coffee

Coffee

Coffee

Coffee

15:30-17:00

Workshops

Session III: NMR

DC Posters, ASP Competition, Panel

Session VIII: Semantics
Closing

Late
Afternoon

Sightseeing Cruise
Departure 17:45

On-Site Competition
16:45-18:45

Evening

Get-Together
20:00-22:00

Espoo City Reception
Departure 18:45

Conference Dinner
Departure 17:45

The details of sessions and lists of accepted papers can be found below. All sessions of the main conference take place in conference hall Tetra.

Invited Speakers

João Leite, Universidade Nova de Lisboa, Lisbon, Portugal, invited speaker sponsored by EurAI

A Bird’s-Eye View of Forgetting in Answer-Set Programming

jleite

Abstract: Forgetting is an operation that allows the removal, from a knowledge base, of middle variables no longer deemed relevant, while preserving all relationships (direct and indirect) between the remaining variables. When investigated in the context of Answer-Set Programming, many different approaches to forgetting have been proposed, following different intuitions, and obeying different sets of properties. This talk will present a bird’s-eye view of the complex landscape composed of the properties and operators of forgetting defined over the years in the context of Answer-Set Programming, zooming in on recent findings triggered by the formulation of the so-called strong persistence, a property based on the strong equivalence between an answer-set program and the result of forgetting modulo the forgotten atoms, which seems to best encode the requirements of the forgetting operation.

Biography: João Leite is Associate Professor at the Computer Science Department of the Universidade Nova de Lisboa, Portugal, and member of the Nova Laboratory for Computer Science and Informatics (NOVA LINCS). João’s main research interests include Knowledge Representation and Non-Monotonic Reasoning, Multi-Agent Systems, Semantic Web, and Argumentation for the Social Web. He has authored one book, edited several books and journal special issues, co-authored more than 100 papers, and presented more than 10 courses and tutorials in Conferences and Summer Schools. He was Conference Chair of JELIA-2004, Program Committee Co-Chair of JELIA-2014, and Co-Chair of several editions of the CLIMA, LADS, and DALT workshops. He regularly serves in the Program Committees of major international conferences (IJCAI, AAAI, KR, AAMAS, ECAI, ICLP,…​).

Tran Cao Son, New Mexico State University, Las Cruses, New Mexico, USA, invited speaker sponsored by ALP

Answer Set Programming and its Applications in Planning and Multi-Agent Systems

tson

Abstract: The talk presents some applications in planning and multi-agent systems of answer set programming. It highlights the benefits of answer set programming based techniques in these applications. It also describes a class of multi-agent planning problems that is challenging to answer set programming.

Biography: Tran Cao Son received his doctoral degree from the University of Texas at El Paso in 2000. He is currently a Computer Science professor at the New Mexico State University in Las Cruces. Before joining NMSU, he was a post-doc at the Knowledge System Laboratory at Stanford University for almost a year. His main research interests are in knowledge representation and reasoning, especially logic programming and answer set programming and its applications in planning, negotiation, and multi-agent systems.

Francesca Toni, Imperial College, London, UK

From Logic Programming and Non-Monotonic Reasoning to Computational Argumentation and Beyond

ftoni

Abstract: Argumentation has gained popularity in AI in recent years to support several activities and forms of reasoning. This talk will trace back the logic programming and non-monotonic reasoning origins of two well-known argumentation formalisms in AI (namely abstact argumentation and assumption-based argumentation). Finally, the talk will discuss recent developments in AI making use of computational argumentation, in particular to support collaborative decision making.

Biography: Francesca Toni is Professor in Computational Logic in the Department of Computing, Imperial College London, UK, and the funder and leader of the CLArg (Computational Logic and Argumentation) research group. Her research interests lie within the broad area of Knowledge Representation and Reasoning in Artificial Intelligence, and in particular include Argumentation, Logic-Based Multi-Agent Systems,Logic Programming for Knowledge Representation and Reasoning, Non-monotonic and Default Reasoning. She graduated, summa cum laude, in Computing, at the University of Pisa, Italy, in 1990, and received her PhD in Computing in 1995, from Imperial College London. She has coordinated two EU projects, received funding from EPSRC and the EU, and awarded a Senior Research Fellowship from The Royal Academy of Engineering and the Leverhulme Trust. She has chaired ICLP2015 (the 31st International Conference on Logic Programming), is currently chair of KR 2018 (the 16th Conference on Principles of Knowledge Representation and Reasoning). She is a member of the steering committe of AT, the Executive Committee of the Board of ALP, the Association for Logic Programming, corner editor on Argumentation for the Journal of Logic and Computation, and in the editorial board of the Argument and Computation journal and (from January 2017) of the AI journal.

Sessions

Tuesday, July 4th, Tetra Conference Hall

OPENING AND INVITED TALK (09:00-10:30)

Chair: Pedro Cabalar

09:00 Official Opening of LPNMR 2017

09:30 F. Toni: From Logic Programming and Non-Monotonic Reasoning to Computational Argumentation and Beyond

SESSION I: Nonmonotonic Reasoning (10:30-12:00)

Chair: Christoph Redl

10:30 E.-A. Dietz et al: Contextual Reasoning: Usually Birds can Abductively Fly.
11:00 E. Iraz Su: A Monotonic View on Reflexive Autoepistemic Reasoning.
11:30 M. Wrona: The Minimal Inference Problem over Finite Domains: The Landscape of Complexity.

SESSION II: Answer Set Programming (13:30-15:00)

Chair: Tran Cao Son

13:30 J. Fichte et al: Answer Set Solving with Bounded Treewidth Revisited.
14:00 C. Redl: Answer Set Programs with Queries over Subprograms.
14:30 A. Weinzierl: Blending Lazy-Grounding and CDNL Search for Answer-Set Solving.

SESSION III: Nonmonotonic Reasoning (15:30-16:30)

Chair: Matthias Knorr

15:30 F. A. D’Asaro et al: Foundations for a Probabilistic Event Calculus.
15:50 R. Ben-Eliyahu-Zohary et al: Modular Construction of Minimal Models.
16:10 M. Pensel and A.-Y. Turhan: Including Quantification in Defeasible Reasoning for the Description Logic EL_bot.

Wednesday, July 5th, Tetra Conference Hall

INVITED TALK (09:00-10:00)

Chair: Torsten Schaub

09:00 T. C. Son: Answer Set Programming and its Applications in Planning and Multi-Agent Systems

SESSION IV: Planning & LPNMR Applications (10:00-12:00)

Chair: Peter Schüller

10:00 Y. Dimopoulos et al: plasp 3: Towards effective ASP Planning.
10:30 J. Remmel and A. Brik: Action Language Hybrid AL.

11:00 M. Dahlem et al: Automatic Synthesis of Optimal-Size Concentrators by Answer Set Programming.
11:20 C. Dodaro and M. Maratea: Nurse Scheduling via Answer Set Programming.
11:40 J. Leite and O. Sabuncu: moviola: Interpreting Dynamic Logic Programs via Multi-shot Answer Set Programming.

SESSION V: LPNMR Applications (13:30-15:00)

Chair: Giovambattista Ianni

13:30 P. Schüller: Adjudication of Coreference Annotations via Answer Set Optimization. Best Application Paper!
14:00 M. Banbara et al: catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming.
14:30 C. Frioux et al: Hybrid Metabolic Network Completion. Best Student Paper!

SPECIAL SESSION DC, ASP Competition, Panel (15:00-17:30)

15:00 DC Posters served with coffee
16:00 ASP Competition Report
16:30 Panel on the Past&Future of LPNMR
             Chair: Stefania Costantini
             Members: P. Cabalar, E. Dietz, M. Gelfond, N. Leone, T. Schaub, and F. Toni

Thursday, July 6th, Tetra Conference Hall

INVITED TALK (09:00-10:00)

Chair: Stefan Woltran

09:00 J. Leite: A Bird’s-Eye View of Forgetting in Answer-Set Programming

SESSION VI: LPNMR Systems (10:00-12:00)

Chair: Shahab Tasharrofi

10:00 C. Lopes et al: NoHR: Integrating XSB Prolog with the OWL 2 Profiles and Beyond.
10:30 J. Pührer: ArgueApply: A Mobile App for Argumentation. Best System Description!

11:00 M. Alviano et al: The ASP System DLV2.
11:20 J. Bomanson: lp2normal - A Normalization Tool for Extended Logic Programs.
11:40 A. Greßler et al: Harvey: A System for Random Testing in ASP.

SESSION VII: Extensions of Answer Set programming (13:30-15:00)

Chair: Orkunt Sabuncu

13:30 P. Cabalar et al: Gelfond-Zhang Aggregates as Propositional Formulas. Best Technical Paper!
14:00 M. Gelfond and Y. Zhang: Vicious Circle Principle and Formation of Sets in ASP Based Languages.
14:30 C. Redl: Explaining Inconsistency in Answer Set Programs and Extensions

SESSION VIII: Semantics (15:30-16:10)

Chair: Martin Gebser

15:30 S. Bistarelli and F. Santini: A Hasse Diagram for Weighted Skeptical Semantics with a Unique-status Grounded Semantics.
15:50 Z. Zhang: Answer Set Programming with Graded Modality.

Accepted Regular Papers

Mutsunori Banbara, Katsumi Inoue, Hiromasa Kaneyuki, Tenda Okimoto, Torsten Schaub, Takehide Soh, and Naoyuki Tamura: catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming.

Pedro Cabalar, Jorge Fandinno, Torsten Schaub, and Sebastian Schellhorn: Gelfond-Zhang Aggregates as Propositional Formulas. Best Technical Paper!

Emmanuelle-Anna Dietz, Steffen Hölldobler, and Luís Moniz Pereira: Contextual Reasoning: Usually Birds can Abductively Fly.

Yannis Dimopoulos, Martin Gebser, Patrick Lühne, Javier Romero, and Torsten Schaub: plasp 3: Towards effective ASP Planning.

Johannes Klaus Fichte, Markus Hecher, Michael Morak, and Stefan Woltran: Answer Set Solving with Bounded Treewidth Revisited.

Clémence Frioux, Torsten Schaub, Sebastian Schellhorn, Anne Siegel, and Philipp Wanko: Hybrid Metabolic Network Completion. Best Student Paper!

Michael Gelfond and Yuanlin Zhang: Vicious Circle Principle and Formation of Sets in ASP Based Languages.

Carlos Lopes, Matthias Knorr, and João Leite: NoHR: Integrating XSB Prolog with the OWL 2 Profiles and Beyond.

Jörg Pührer: ArgueApply: A Mobile App for Argumentation. Best System Description!

Christoph Redl: Answer Set Programs with Queries over Subprograms.

Christoph Redl: Explaining Inconsistency in Answer Set Programs and Extensions.

Jeffrey Remmel and Alex Brik: Action Language Hybrid AL.

Peter Schüller: Adjudication of Coreference Annotations via Answer Set Optimization. Best Application Paper!

Ezgi Iraz Su: A Monotonic View on Reflexive Autoepistemic Reasoning.

Antonius Weinzierl: Blending Lazy-Grounding and CDNL Search for Answer-Set Solving.

Michal Wrona: The Minimal Inference Problem over Finite Domains: The Landscape of Complexity.

Accepted Short Papers

Mario Alviano, Francesco Calimeri, Carmine Dodaro, Davide Fuscà, Nicola Leone, Simona Perri, Francesco Ricca, Pierfrancesco Veltri, and Jessica Zangari: The ASP System DLV2.

Rachel Ben-Eliyahu-Zohary, Fabrizio Angiulli, Fabio Fassetti, and Luigi Palopoli: Modular Construction of Minimal Models.

Stefano Bistarelli and Francesco Santini: A Hasse Diagram for Weighted Sceptical Semantics with a Unique-status Grounded Semantics.

Jori Bomanson: lp2normal - A Normalization Tool for Extended Logic Programs.

Marc Dahlem, Tripti Jain, Klaus Schneider, and Michael Gillmann: Automatic Synthesis of Optimal-Size Concentrators by Answer Set Programming.

Fabio Aurelio D’Asaro, Antonis Bikakis, Luke Dickens, and Rob Miller: Foundations For A Probabilistic Event Calculus.

Carmine Dodaro and Marco Maratea: Nurse Scheduling via Answer Set Programming.

Alexander Greßler, Johannes Oetsch, and Hans Tompits: Harvey: A System for Random Testing in ASP.

João Leite and Orkunt Sabuncu: moviola: Interpreting Dynamic Logic Programs via Multi-shot Answer Set Programming.

Maximilian Pensel and Anni-Yasmin Turhan: Including Quantification in Defeasible Reasoning for the Description Logic EL_bot.

Zhizheng Zhang: Answer Set Programming with Graded Modality.