ICLP 2021

Accepted Papers

The TPLP papers of ICLP 2021 are online and available here.

The EPTCS volume with the Technical Communications and the Doctoral Consortium papers of ICLP 2021 is online and available here.

• Main Track

Regular Papers
• Here and There with Arithmetic
  Vladimir Lifschitz
• Optimizing Probabilities in Probabilistic Logic Programs
  Damiano Azzolini and Fabrizio Riguzzi
• Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures
  Loris Bozzato, Thomas Eiter and Rafael Kiesel
• Planning for an Efficient Implementation of Hypothetical Bousi~Prolog
  Pascual Julian-Iranzo and Fernando Saenz-Perez
• Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
  Viktor Besin, Markus Hecher and Stefan Woltran
• Harnessing Incremental ASP Solving for Reasoning in Assumption-Based Argumentation
  Tuomo Lehtonen, Johannes P. Wallner and Matti Järvisalo
• Non-ground Abductive Logic Programming with Probabilistic Integrity Constraints
  Elena Bellodi, Marco Gavanelli, Riccardo Zese, Evelina Lamma and Fabrizio Riguzzi
• Modal Logic S5 Satisfiability in Answer Set Programming
  Mario Alviano, Sotiris Batsakis and George Baryannis
• I-DLV-SR: A Stream Reasoning System based on I-DLV
  Francesco Calimeri, Marco Manna, Elena Mastria, Maria Concetta Morelli, Simona Perri and Jessica Zangari
• Planning with Incomplete Information in Quantified Answer Set Programming
  Jorge Fandinno, François Laferriere, Javier Romero, Torsten Schaub and Tran Cao Son
• Solution Enumeration by Optimality in Answer Set Programming
  Jukka Pajunen and Tomi Janhunen
• VeriFly: On-the-fly Assertion Checking via Incrementality (tool paper)
  Miguel A. Sanchez-Ordaz, Isabel Garcia-Contreras, Victor Perez, Jose F. Morales, Pedro Lopez-Garcia and Manuel V. Hermenegildo
• A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction
  Angelos Charalambidis, Panos Rondogiannis and Antonis Troumpoukis
• An asymptotic analysis of probabilistic logic programming, with implications for expressing projective families of distributions
  Felix Weitkämper
• Transformation-Enabled Precondition Inference
  Bishoksan Kafle, Graeme Gange, Peter Schachte, Harald Sondergaard and Peter J. Stuckey
• Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming
  Wolfgang Faber, Michael Morak and Lukas Chrpa
• FOLASP: FO(.) as Input Language for Answer Set Solvers
  Kylian Van Dessel, Jo Devriendt and Joost Vennekens

Technical Communications
• Reasoning over Streams of Events with Temporally-Constrained Effects
  Periklis Mantenoglou, Manolis Pitsikalis and Alexander Artikis
• Unifying Framework for Optimizations in CASP; SMT; ILP
  Yuliya Lierler
• Towards a Semantics for hybrid ASP systems
  Pedro Cabalar, Jorge Fandinno, Torsten Schaub and Philipp Wanko
• Natlog: a Lightweight Logic Programming Language with a Neuro-symbolic Touch
  Paul Tarau
• A note on occur-check
  Wlodek Drabent
• Splitting a Logic Program Efficiently
  Rachel Ben-Eliyahu-Zohary
• Verification of Locally Tight Programs
  Jorge Fandinno and Vladimir Lifschitz
• APIA: An Architecture for Policy-Aware Intentional Agents
  John Meyer and Daniela Inclezan
• Refining the Semantics of Epistemic Specifications
  Ezgi Iraz Su
• Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat
  Neng-Fa Zhou
• DMAPF: A Decentralized and Distributed Solver for Multi-Agent Path Finding Problem with Obstacles
  Poom Pianpak and Tran Cao Son
• Towards Selective and Compact Query Abduction for Existential Rules
  Zhe Wang, Peng Xiao and Kewen Wang
• An Answer Set Programming based framework for High-Utility Pattern Mining extended with Facets and Advanced Utility Functions
  Francesco Cauteruccio and Giorgio Terracina
• Probabilistic Defeasible Logic Programming: Towards Explainable and Tractable Query Answering
  Mario A. Leiva, Alejandro J. García, Paulo Shakarian and Gerardo I. Simari
• A Logic Program Transformation for Strongly Persistent Forgetting
  Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, Gilberto Pérez and Concepción Vidal
• Generating Explainable Rule Sets from Tree-Ensemble Learning Methods by Answer Set Programming
  Akihiro Takemura and Katsumi Inoue

Short Papers
• Fixpoint Semantics for Recursive SHACL
  Bart Bogaerts and Maxime Jakubowski
• Weighted Conditional EL Knowledge Bases with integer weights: an ASP Approach
  Laura Giordano and Daniele Theseider Dupre
• exp(ASPc) : Explaining ASP Programs with Choice Atoms and Constraint Rules
  Ly Ly Trieu, Tran Cao Son and Marcello Balduccini


• Applications Track

Regular Papers
• Refactoring the Whitby Intelligent Tutoring System for Clean Architecture
  Paul Brown, Vania Dimitrova, Glen Hart, Anthony Cohn and Paulo Moura
• An ASP-based Solution to the Chemotherapy Treatment Scheduling problem
  Carmine Dodaro, Giuseppe Galatà, Andrea Grioni, Marco Maratea, Marco Mochi and Ivan Porro
• Knowledge-Based Stable Roommates Problem: A Real-World Application
  Müge Fidan and Esra Erdem

Technical Communications
• Geolog: Scalable Logic Programming on Spatial Data
  Tobias Grubenmann and Jens Lehmann
• Syntactic Requirements for Well-defined Hybrid Probabilistic Logic Programs
  Damiano Azzolini and Fabrizio Riguzzi
• Combining deep learning and ASP-based models for the semantic segmentation of medical images
  Pierangela Bruno, Francesco Calimeri, Cinzia Marte and Marco Manna
• DiscASP: A Graph-based ASP System for Finding Relevant Consistent Concepts with Applications to Conversational Socialbots
  Fang Li, Huaduo Wang, Kinjal Basu, Elmer Salazar and Gopal Gupta
• Automatically Generating Concurrent Programs From Sequential Data Structure Knowledge using Answer Set Programming
  Sarat Chandra Varanasi, Neeraj Mittal and Gopal Gupta
• Stable Marriage Problems: An Empirical Comparison of ASP, CP, ILP, and Local Search Methods
  Selin Eyupoglu, Müge Fidan, Yavuz Gulesen, Ilayda Begum Izci, Berkan Teber, Baturay Yilmaz, Ahmet Alkan and Esra Erdem

Short Papers
• Logic-Based Multi Agent System for Ethical Monitoring and Evaluation in Dialogue Systems
  Abeer Dyoub, Stefania Costantini, Francesca A. Lisi and Ivan Letteri


• Recently Published Research Track
• Semantics for Hybrid Probabilistic Logic Programs with Function Symbols
  Damiano Azzolini, Fabrizio Riguzzi and Evelina Lamma
• Towards solving path planning in keyhole neurosurgery with Answer Set Programming
  Valentina Corbetta, Alice Segato, Jessica Zangari, Simona Perri, Francesco Calimeri and Elena De Momi
• Extended Abstract: Non-monotonic Logical Reasoning and Deep Learning for Transparent Decision Making in Robotics
  Mohan Sridharan, Tiago Mota and Ales Leonardis
• In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem
  Neng-Fa Zhou

Sponsors