Symposium Program (tentative)

9:25: Opening of the Symposium

9:30 - 10:30: Session 1 (chair: Elvira Albert)

• Hirohisa Seki. Proving Properties of Co-logic Programs with Negation by Program Transformations
• Céline Dandois and Wim Vanhoof. Semantic clone pairs in logic programs

11:00 - 12:00: Session 2 (chair: Henning Christiansen)

• Kyle Marple and Gopal Gupta. Galliwasp: A Goal-Directed Answer Set Solver
• Carroline Dewi Puspa Kencana Ramli, Hanne Riis Nielson and Flemming Nielson. XACML 3.0 in Answer Set Programming

14:00 - 15:30: Session 3 (chair: Johan Nordlander)

• Colin Nicholson and Danny De Schreye. Relevancy analysis as a basis for improved tabling in CHRiSM
• Maarten van Emden. Programming in Logic without Prolog
• Claus Zinn. Program Analysis and Manipulation to Reproduce Student's Erroneous Reasoning

16:00 - 17:30: Session 4 (chair: Gerda Janssens)

• Mohamed Nassim Seghir and Martin Brain. Simplifying the Verification of Quantified Array Assertions via Code Transformation
• José Miguel Rojas and Miguel Gómez-Zamalloa. Towards a Generic Framework for Guided Test Case Generation in CLP
• Heiko Mantel and Henning Sudbrock. Types vs. PDGs in Information Flow Analysis

9:30 - 10:30: PPDP/LOPSTR Invited Talk (chair: Danny De Schreye)

• Jürgen Giesl. Symbolic Evaluation Graphs and Term Rewriting -- A General Methodology for Analyzing Logic Programs

11:00 - 12:00: LOPSTR Invited Talk (chair: Elvira Albert)

• Tom Schrijvers. Search Combinators

  The ability to model search in a constraint solver can be an essential asset for solving combinatorial problems. However, existing infrastructure for defining search heuristics is often inadequate. Either modeling capabilities are extremely limited or users are faced with a general-purpose programming language whose features are not tailored towards writing search heuristics. As a result, major improvements in performance may remain unexplored. This talk introduces search combinators, a lightweight and solver-independent method that bridges the gap between a conceptually simple modeling language for search (high-level, functional and naturally compositional) and an efficient implementation (low-level, imperative and highly non-modular). By allowing the user to define application-tailored search strategies from a small set of primitives, search combinators effectively provide a rich domain-specific language (DSL) for modeling search to the user. Remarkably, this DSL comes at a low implementation cost to the developer of a constraint solver.

13:00: Excursion and Banquet

9:30 - 10:30: PPDP Invited Talk (chair: Andy King)

• Torsten Schaub. Answer Set Solving in Practice.

11:00 - 12:30: Session 5 (chair: German Vidal)

• Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi and Maurizio Proietti. Branching Preserving Specialization for Software Model Checking
• Henning Christiansen, Christian Theil Have, Ole Torp Lassen and Matthieu Petit. A declarative pipeline language for big data analysis
• David Insa, Josep Silva and César Tomás. Enhancing Declarative Debugging Through Loop Expansion

Lunch

14:00 - 15:30: Session 6 (chair: Carsten Fuhs)

• Naoki Nishida and German Vidal. Computing More Specific Versions of Conditional Rewriting Systems
• Neda Saeedloei and Gopal Gupta. An Extension of $\pi$-Calculus with Real-Time and its Realization in Logic Programming
• Minami Niwa, Naoki Nishida and Masahiko Sakai. Extending Matching Operation in Grammar Program for Program Inversion

Coffee Break