Issue 1 – January 2025
- Probabilistic Answer Set Programming with Discrete and Continuous Random Variables. Damiano Azzolini and Fabrizio Riguzzi, pp 1-32
- Solving Decision Theory Problems with Probabilistic Answer Set Programming. DAMIANO AZZOLINI, ELENA BELLODI, RAFAEL KIESEL, FABRIZIO RIGUZZI, pp 33-63
- Catamorphic Abstractions for Constrained Horn Clause Satisfiability EMANUELE DE ANGELIS, FABIO FIORAVANTI, ALBERTO PETTOROSSI, MAURIZIO PROIETTI, pp. 64-91 [Rapid Communication]
- Direct Encoding of Declare Constraints in ASP. Francesco Chiariello, Antonio Ielo, Valeria Fionda, Francesco Ricca, pp 92-131
Issue 2 (Special Issue on RuleML+RR 2022) – March 2025
- Introduction to the Special Issue. GUIDO GOVERNATORI, ANNI-YASMIN TURHAN, pp 132-133.
- plingo: A system for probabilistic reasoning in Answer Set Programming. Susana Hahn, Tomi Janhunen, Roland Kaminski, Javier Romero, Nicolas Rühling, Torsten Schaub, 134-167
- The Temporal Vadalog System: Temporal Datalog-based Reasoning LUIGI BELLOMARINI, LIVIA BLASI, MARKUS NISSL, EMANUEL SALLINGER, pp 168-196
- On the generalization of learned constraints for ASP solving in temporal domains JAVIER ROMERO, TORSTEN SCHAUB, KLAUS STRAUCH, pp 197-224
- Practical Reasoning in DatalogMTL. Dingmin Wang, Przemyslaw Walega, Pan Hu, Pan, Bernardo Cuenca Grau, pp 225-255
Issue 3 – March 2025
- Provenance Guided Rollback Suggestions. Zhao, David, Subotić, Pavle, Raghothaman, Mukund, Scholz, Bernhard, 256-280 [Rapid Communication]
- ASP-based Multi-Shot Reasoning via DLV2 with Incremental Grounding F. Calimeri, G.B. Ianni, F. Pacenza, S. Perri, J. Zangari, 281-303
- Existential Notation3 Logic Dörthe Arndt, Stephan Mennicke, pp 304-339
- FreeCHR: An Algebraic Framework for CHR-Embeddings Sascha Rechenberger, Thom Frühwirth, pp 340-373
- A novel framework for systematic propositional formula simplification based on existential graphs. Jordina Francès de Mas, Juliana Bowles, pp 374-393 [Rapid Communication]
Issue 4 – July 2025 – Special Issue on ICLP 2025
-
Introduction to the 41st International Conference on Logic Programming Special Issue.
MARTIN GEBSER, DANIELA INCLEZAN, FRANCESCO RICCA, 394-401 -
Comparing Non-minimal Semantics for Disjunction in Answer Set Programming.
Felicidad Aguado, Pedro Cabalar, Brais Muñiz Castro, Gilberto Pérez and Concepcion Vidal, 402-416 - ASP Chef grows Mustache to look better.
Mario Alviano, Wolfgang Faber and Luis Angel Rodriguez Reiners, pp. 417-436 - Application Placement with Constraints Relaxation.
Damiano Azzolini, Marco Duca, Stefano Forti, Francesco Gallo and Antonio Ielo, pp. 437-454 - Integrating Belief Domains into Probabilistic Logic Programming.
Damiano Azzolini, Fabrizio Riguzzi and Theresa Swift, pp. 455-472 - Smart Expansion Techniques for ASP-based Interactive Configuration.
Lucia Balažová, Richard Comploi-Taupe, Susana Hahn, Nicolas Rühling and Gottfried Schenner, pp. 473-488 - Automated Hybrid Grounding Using Structural and Data-Driven Heuristics.
Alexander Beiser, Markus Hecher and Stefan Woltran, pp. 489-506 - Splitting a Disjunctive Logic Program. Rachel Ben-Eliyahu-Zohary, pp. 507-521
- Fine-grained Timing Analysis of Digital Integrated Circuits in Answer Set Programming.
Alessandro Bertagnon, Marcello Dalpasso, Michele Favalli and Marco Gavanelli, pp. 522-539 - A General Framework for Dynamic MAPF using Multi-Shot ASP and Tunnels.
Aysu Bogatarkan and Esra Erdem, pp. 540-557 - Improving ASP-based ORS Schedules through Machine Learning Predictions.
Pierangela Bruno, Carmine Dodaro, Giuseppe Galatà, Marco Maratea and Marco Mochi, pp. 558-578 - Towards Constraint Temporal Answer Set Programming.
Pedro Cabalar, Martín Diéguez, François Olivier, Torsten Schaub and Igor Stéphan, pp. 579-594 - The Power of Negation in Higher-Order Datalog.
Angelos Charalambidis, Babis Kostopoulos, Christos Nomikos and Panos Rondogiannis, pp. 595-611 - Hiord#: An Approach to the Specification and Verification of Higher-Order (C)LP Programs.
Marco Ciccalè, Daniel Jurjo, Jose F. Morales, Pedro Lopez-Garcia and Manuel V. Hermenegildo, pp. 612-630 - On systematic construction of correct logic programs.
Wlodek Drabent, pp. 631-648 - ASP-FZN: A Translation-based Constraint Answer Set Solver.
Thomas Eiter, Tobias Geibinger, Nysret Musliu, Johannes Oetsch and Tobias Kaminski, pp. 649-667 - Finding Personalized Good-Enough Solutions to Unsatisfiable Stable Roommates Problems.
Müge Fidan and Esra Erdem, pp. 685-702 - Counting Answer Sets of Disjunctive Answer Set Programs. Supratik Chakraborty and Kuldeep S Meel, pp. 703-721
- Symbolic Rule Extraction from Attention-Guided Sparse Representations in Vision Transformers.
Parth Padalkar and Gopal Gupta, pp. 722-738 - Non-Termination of Logic Programs Using Patterns.
Etienne Payet, pp. 739-755 - GPU Accelerated Compact-Table Propagation.
Enrico Santi, Fabio Tardivo, Agostino Dovier and Andrea Formisano, pp. 756-774 - Complexity of Faceted Explanations in Propositional Abduction.
Johannes Schmidt, Mohamed Maizia, Victor Lagerkvist and Johannes K. Fichte, pp. 775-793 - A CASP-based Solution for Traffic Signal Optimisation.
Alice Tarzariol, Marco Maratea and Mauro Vallati, pp. 794-812 - Generating Solvable Benchmark Instances for Stable Roommates Problems with Optimization.
Baturay Yılmaz and Esra Erdem, pp. 813-828 - ANTHEM: Answer Set Programming and Automated Theorem Proving. Jorge Fandinno, Christoph Glinzer, Zachary Hansen, Jan Heuer, Yuliya Lierler, Vladimir Lifschitz, Torsten Schaub and Mohimenul Kabir, Tobias Stolzmann.