You are here

ICLP Accepted Papers

Download the Proceedings of the 31st International Conference on Logic Programming (ICLP 2015).

Download the Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015).

  • Tabling as a Library with Delimited Control
    Benoit Desouter, Marko van Dooren and Tom Schrijvers.
  • Parallel Bottom-Up Evaluation of Logic Programs: DeALS on Shared-Memory Multicore Machines
    Mohan Yang, Alexander Shkapsky and Carlo Zaniolo.
  • Improved Answer-Set Programming Encodings for Abstract Argumentation
    Sarah Alice Gaggl, Norbert Manthey, Alessandro Ronca, Johannes Peter Wallner and Stefan Woltran.
  • Abstract Gringo
    Martin Gebser, Amelia Harrison, Roland Kaminski, Vladimir Lifschitz and Torsten Schaub.
  • Grid Mind: Prolog-Based Simulation Environment for Future Energy Grids
    Jan Rosecky, Filip Prochazka and Barbora Buhnova.
  • Knowledge Compilation of Logic Programs Using Approximation Fixpoint Theory
    Bart Bogaerts and Guy Van den Broeck.
  • Logic Programming and Bisimulation
    Agostino Dovier.
  • Parallel Execution of the ASP Computation - an Investigation on GPUs
    Andrea Formisano, Flavio Vella, Agostino Dovier and Enrico Pontelli.
  • On Type-directed Generation of Lambda Terms
    Paul Tarau.
  • A Logic Programming Approach to Predict Effective Compiler Settings for Embedded Software
    Craig Blackmore, Oliver Ray and Kerstin Eder.
  • QuLog: A flexibly typed logic based language with function and action rules
    Keith Clark and Peter Robinson.
  • Answer Set Application Programming: a Case Study on Tetris
    Peter Schüller and Antonius Weinzierl.
  • Dual-normal Logic Programs - the Forgotten Class
    Johannes Klaus Fichte, Miroslaw Truszczynski and Stefan Woltran.
  • Learning Weak Constraints in Answer Set Programming
    Mark Law, Alessandra Russo and Krysia Broda.
  • Soundness of Coinduction via Structural Resolution
    Patricia Johann and Ekaterina Komendantskaya.
  • Debugging ASP using ILP
    Tingting Li, Marina De Vos, Julian Padget, Ken Satoh and Tina Balke.
  • Learning Probabilistic Action Models from Interpretation Transitions
    David Martínez, Tony Ribeiro, Katsumi Inoue, Guillem Alenyà and Carme Torras.
  • Logic Programming for Cellular Automata
    Marcus Völker and Katsumi Inoue.
  • Horn Clauses as an Intermediate Representation for Program Analysis and Transformation
    Graeme Gange, Jorge A Navas, Peter Schachte, Harald Sondergaard and Peter J. Stuckey.
  • Planning as Tabled Logic Programming
    Neng-Fa Zhou, Roman Bartak and Agostino Dovier.
  • Rewriting recursive aggregates in answer set programming: back to monotonicity
    Mario Alviano, Wolfgang Faber and Martin Gebser.
  • Complexity and Compilation of GZ-Aggregates in Answer Set Programming
    Mario Alviano and Nicola Leone.
  • Fuzzy Answer Set Computation via Satisfiability Modulo Theories
    Mario Alviano and Rafael Peñaloza.
  • Optimizing Phylogenetic Supertrees using Answer Set Programming
    Laura Koponen, Emilia Oikarinen, Tomi Janhunen and Laura Säilä.
  • A Denotational Semantics for Equilibrium Logic
    Felicidad Aguado, Pedro Cabalar, David Pearce, Gilberto Pérez and Concepcion Vidal.
  • Relating Concrete Argumentation Formalisms and Abstract Argumentation
    Michael Maher.
  • CHR Exhaustive Execution - Revisited
    Ahmed Elsawy, Amira Zaki and Slim Abdennadher.
  • A logic-based approach to understanding lone-actor terrorism
    Dalal Alrajeh and Paul Gill.
  • Abstract Answer Set Solvers for Cautious Reasoning
    Remi Brochenin and Marco Maratea.
  • Transforming Delimited Control: Fast and Modular Effect Handlers
    Amr Hany Saleh, Tom Schrijvers and Daniel De Schreye.
  • Thread-Aware Logic Programming For Data-Driven Parallel Programs
    Flavio Cruz, Ricardo Rocha and Seth Goldstein.
  • Proving Correctness of Imperative Programs by Linearizing Constrained Horn Clauses
    Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi and Maurizio Proietti.
  • Adding Partial Functions to Constraint Logic Programming with Sets
    Maximiliano Cristià, Gianfranco Rossi and Claudia Frydman.
  • An Infinitary Encoding of Temporal Equilibrium Logic
    Pedro Cabalar, Martín Diéguez and Concepcion Vidal.
  • Semantics of templates in a compositional framework for building logics
    Ingmar Dasseville, Matthias van der Hallen, Marc Denecker and Gerda Janssens.
  • Taming Primary Key Violations to Query Large Inconsistent Data via ASP
    Marco Manna, Francesco Ricca and Giorgio Terracina.
  • Towards a Generic Interface to Integrate CLP and Tabled Execution
    Joaquin Arias Herrero and Manuel Carro.
  • Stable Models of Markov Logic Networks
    Joohyung Lee, Yunsong Meng and Yi Wang.
  • On Structural Analysis of Non-Ground Answer-Set Programs
    Benjamin Kiesl, Peter Schüller and Hans Tompits.
  • Concolic Testing in Logic Programming
    Fred Mesnard, Étienne Payet and German Vidal.
  • A logical approach to working with biological databases
    Nicos Angelopoulos and Georgios Giamas.
  • Practical Run-time Checking via Unobtrusive Property Caching
    Nataliia Stulova, Jose F. Morales and Manuel V. Hermenegildo.
  • Automated Reasoning about XACML 3.0 Delegation Using Answer Set Programming
    Joohyung Lee, Yi Wang and Yu Zhang.
  • Unifying Justifications and Debugging for Answer-Set Programs
    Joao Moura, Anastasia Analyti and Carlos Viegas Damásio.
  • Abductive Logic Programming for Datalog+/- ontologies
    Marco Gavanelli, Evelina Lamma, Fabrizio Riguzzi, Elena Bellodi, Riccardo Zese and Giuseppe Cota.
  • Expressing and Supporting Efficiently Greedy Algorithms as Locally Stratified Logic Programs
    Carlo Zaniolo.