Accepted papers

  • Weronika T. Adrian, Nicola Leone and Marco Manna. Entity set expansion from the Web via answer set programming (application paper).
  • Marìa Alpuente, Angel Cuenca-Ortega, Santiago Escobar and Julia Sapiña. Inspecting Maude Variants with GLINTS (Tool paper).
  • Mario Alviano. Model enumeration in propositional circumscription via unsatisfiable core analysis.
  • Mario Alviano. The ingredients of the argumentation reasoner pyglaf: python, circumscription, and glucose to taste (system and tool paper).
  • Giovanni Amendola, Nicola Leone and Marco Manna. Finite model reasoning over existential rules.
  • Giovanni Amendola, Nicola Leone, Marco Manna and Pierfrancesco Veltri. Reasoning on anonymity in Datalog+/-.
  • Harald Beck, Thomas Eiter and Christian Folie. Ticker: A System for Incremental ASP-based Stream Reasoning.
  • Melisachew Wudage Chekol and Heiner Stuckenschmidt. Rule Based Temporal Inference.
  • Zhuo Chen, Elmer Salazar, Kyle Marple, Lakshman Tamil, Gopal Gupta, Sandeep Das and Alpesh Amin. Improving Adherence to Heart Failure Management Guidelines via Abductive Reasoning.
  • Michael Codish, Michael Frank, Amit Metodi and Morad Muslimany. Logic Programming with Max-Clique and its Application to Graph Coloring.
  • Bernardo Cuteri, Carmine Dodaro, Francesco Ricca and Peter Schüller. Constraints, Lazy Constraints, or Propagators in ASP Solving: An Empirical Analysis.
  • Marco Gavanelli, Maddalena Nonato, Andrea Peano and Davide Bertozzi. Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper).
  • Guido Governatori and Michael Maher. Annotated Defeasible Logic.
  • Ricardo Gonçalves, Matthias Knorr, Joao Leite and Stefan Woltran. When You Must Forget: beyond strong persistence when forgetting in answer set programming.
  • Michael Hanus. Semantic Versioning Checking in a Declarative Package Manager.
  • Amelia Harrison, Vladimir Lifschitz and Dhananjay Raju. Program Completion in the Input Language of GRINGO.
  • Daniela Inclezan, Qinglin Zhang, Marcello Balduccini and Ankush Israney. Understanding Restaurant Stories Using an ASP Theory of Intentions.
  • Tomi Janhunen, Roland Kaminski, Max Ostrowski, Torsten Schaub, Sebastian Schellhorn and Philipp Wanko. Clingo goes Linear Constraints over Reals and Integers.
  • Jianmin Ji, Fangfang Liu and Jia-Huai You. Well-Founded Operators for Normal Hybrid MKNF Knowledge Bases.
  • Ekaterina Komendantskaya and Yue Li. Productive Corecursion in Logic Programming.
  • Joohyung Lee, Nikhil Loney and Yunsong Meng. Representing Hybrid Automata by Action Language Modulo Theories.
  • Joohyung Lee, Samidh Talsania and Yi Wang. Computing LPMLN Using ASP and MLN Solvers.
  • Vladimir Lifschitz. Achievements in Answer Set Programming.
  • Panos Rondogiannis and Ioanna Symeonidou. The Intricacies of 3-Valued Extensional Semantics for Higher-Order Logic Programs.
  • Alejandro Serrano and Jurriaan Hage. Constraint Handling Rules with Binders, Patterns and Generic Quantification.
  • Rolf Schwitter. Learning Effect Axioms via Probabilistic Logic Programming.
  • Farhad Shakerin, Elmer Salazar and Gopal Gupta. A New Algorithm to Automate Inductive Learning of Default Theories.
  • Nataliia Stulova, Jose F. Morales and Manuel V. Hermenegildo. Term Hiding and its Impact on Run-time Check Simplification.
  • Paul Tarau. A Hitchhiker’s Guide to Reinventing a Prolog Machine.
  • Ibrahim Faruk Yalciner, Ahmed Nouman, Volkan Patoglu and Esra Erdem. Hybrid Conditional Planning using Answer Set Programming.
  • Ryan Young, Marcello Balduccini and Ankush Israney. Reasoning Agents in Hybrid Domains with Action Language H.
  • Carlo Zaniolo, Mohan Yang, Matteo Interlandi, Ariyam Das, Alexander Shkapsky and Tyson Condie. Fixpoint Semantics and Optimization of Recursive Datalog Programs with Aggregates.
  • Neng-Fa Zhou and Roman Barták. Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding.