Volume 24 – Issue 1 – January 2024
Original Articles:
- The Stable Model Semantics of Datalog with Metric Temporal Operators Wałęga, Przemysław; Tena Cucala, David; Cuenca Grau, Bernardo; Kostylev, Egor V., pp 22-56
- Compositional verification in rewriting logic ÓSCAR MARTÍN, ALBERTO VERDEJO, NARCISO MARTÍ-OLIET, pp 57-109
- System Predictor: Grounding Size Estimator for Logic Programs under Answer Set Semantics. Daniel Bresnahan, Nicholas Hippen, and Yuliya Lierler. pp 132-156
- Human Conditional Reasoning in Answer Set Programming. Chiaki Sakama. pp 157-192
Technical Note:
- Tau Prolog: A Prolog Interpreter for the Web. JOSÉ A. RIAZA. pp 1-21
Rapid Communication:
- Disjunctive Delimited Control. ALEXANDER VANDENBROUCKE and TOM SCHRIJVERS, pp 110-131.
Volume 24 – Issue 2 – March 2024.
Selected Papers from Datalog 2.0 (2022)
- Editorial. By MARIO ALVIANO and ANDREAS PIERIS
Original Articles:
- CNL2ASP: Converting Controlled Natural Language Sentences into ASP. SIMONE CARUSO, CARMINE DODARO, MARCO MARATEA, MARCO MOCHI, and FRANCESCO RICCIO, pp 196-226
- Dyadic Existential Rules. Georg Gottlob, Marco Manna, and Cinzia Marte, pp. 227-249
- Querying Data Exchange Settings Beyond Positive Queries Calautti, Marco; Greco, Sergio; Molinaro, Cristian; Trubitsyna, Irina, pp. 250-278
- Querying Incomplete Data : Complexity and Tractability via Datalog and First-Order Rewritings. Amélie Gheerbrant, Leonid Libkin, Alexandra Rogova, Cristina Sirangelo, pp. 279-309
Selected papers from RuleML+RR202021
- Editorial. By SOTIRIS MOSCHOYIANNIS, RAFAEL PEÑALOZA, pp 310-312
Original Articles:
- Extended High-Utility Pattern Mining: An Answer Set Programming-Based Framework and Applications. By FRANCESCO CAUTERUCCIO, GIORGIO TERRACINA, pp. 313-343
- Solving Rehabilitation Scheduling Problems via a Two-Phase ASP Approach. MATTEO CARDELLINI, PAOLO DE NARDI, CARMINE DODARO, GIUSEPPE GALATÀ, ANNA GIARDINI, MARCO MARATEA, IVAN PORRO, pp. 344-367
- Evaluating Datalog Tools for Meta-reasoning over OWL 2 QL HAYA MAJID QURESHI, WOLFGANG FABER, pp. 368-393
- Distributed Subweb Specifications for Traversing the Web BART BOGAERTS, BAS KETSMAN, YOUNES ZEBOUDJ, HEBA AAMER, RUBEN TAELMAN, RUBEN VERBORGH, pp. 394-420
Addendum:
- Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling – ADDENDUM THOMAS EITER, TOBIAS GEIBINGER, NYSRET MUSLIU, JOHANNES OETSCH, PETER SKOCOVSKÝ, DARIA STEPANOVA, p. 421
Issue 3, May 2024 (Special Issue on LPNMR 2022)
- Metric Temporal Equilibrium Logic over Timed Traces
Arvid Becker, Pedro Cabalar, Martín Diéguez, Torsten Schaub, Anna Schuhmannm pp 425 – 452 - Multi-Shot Answer Set Programming for Flexible Payroll Management BENJAMIN CALLEWAERT, JOOST VENNEKENS, pp 453 – 481
- Epistemic Logic Programs: a study of some properties. Stefania Costantini and Andrea Formisano, pp 482 – 504
- IASCAR: Incremental Answer Set Counting by Anytime Refinement. Johannes Fichte, Sarah Gaggl, Marcus Hecher, and Dominik Rusovac, pp 505 – 532
- Clingraph: A System for ASP-based Visualization SUSANA HAHN, ORKUNT SABUNCU, TORSTEN SCHAUB, TOBIAS STOLZMANN, pp 533 – 559
- Knowledge-Based Support for Adhesive Selection: Will it Stick?
SIMON VANDEVELDE, JOOST VENNEKENS, JEROEN JORDENS, BART VAN DONINCK, MAARTEN WITTERS, pp 560 – 580
Issue 4 (ICLP 40 – special issue), JULY 2024
- Introduction to the 40th International Conference On Logic Programming Special Issue
PEDRO CABALAR, THERESA SWIFT, pp. 581-585 - On Lower Bounding Minimal Model Count
MOHIMENUL KABIR, KULDEEP S MEEL, pp. 586-605 - A Reliable Common-Sense Reasoning Socialbot Built Using LLMs and Goal-Directed ASP
YANKAI ZENG, ABHIRAMON RAJASEKHARAN, KINJAL BASU, HUADUO WANG, JOAQUÍN ARIAS, GOPAL GUPTA, pp. 606-627 - Towards Probabilistic Inductive Logic Programming with Neurosymbolic Inference and Relaxation
FIEKE HILLERSTRÖM, GERTJAN BURGHOUTS, pp. 628-643 - A Neurosymbolic Framework for Bias Correction in Convolutional Neural Networks
PARTH PADALKAR, NATALIA SLUSARZ, EKATERINA KOMENDANTSKAYA, GOPAL GUPTA, pp. 644-662 - CON-FOLD Explainable Machine Learning with Confidence
LACHLAN MCGINNESS, PETER BAUMGARTNER, pp. 663-681 - Fast Inference for Probabilistic Answer Set Programs Via the Residual Program
DAMIANO AZZOLINI, FABRIZIO RIGUZZI, pp. 682-697 - Symbolic Parameter Learning in Probabilistic Answer Set Programming
DAMIANO AZZOLINI, ELISABETTA GENTILI, FABRIZIO RIGUZZI, pp. 698-715 - Quantifying over Optimum Answer Sets
GIUSEPPE MAZZOTTA, FRANCESCO RICCA, MIREK TRUSZCZYNSKI, pp. 716-736 - The Stable Model Semantics for Higher-Order Logic Programming
BART BOGAERTS, ANGELOS CHARALAMBIDIS, GIANNOS CHATZIAGAPIS, BABIS KOSTOPOULOS, SAMUELE POLLACI, PANOS RONDOGIANNIS, pp. 737-754 - Dominating Set Reconfiguration with Answer Set Programming
MASATO KATO, MUTSUNORI BANBARA, TORSTEN SCHAUB, TAKEHIDE SOH, NAOYUKI TAMURA, pp. 755-771 - Winning Snake: Design Choices in Multi-Shot ASP
ELISA BÖHL, STEFAN ELLMAUTHALER, SARAH ALICE GAGGL, pp. 772-789 - Reasoning About Study Regulations in Answer Set Programming
SUSANA HAHN, TORSTEN SCHAUB, CEDRIC MARTENS, AMADE NEMES, HENRY OTUNUYA, JAVIER ROMERO, SEBASTIAN SCHELLHORN, pp. 790-804 - Automating Semantic Analysis of System Assurance Cases Using Goal-Directed ASP
ANITHA MURUGESAN, ISAAC WONG, JOAQUÍN ARIAS, ROBERT STROUD, SRIVATSAN VARADARAJAN, ELMER SALAZAR, GOPAL GUPTA, ROBIN BLOOMFIELD, JOHN RUSHBY, pp. 805-824 - Optimising Dynamic Traffic Distribution for Urban Networks with Answer Set Programming
MATTEO CARDELLINI, CARMINE DODARO, MARCO MARATEA, MAURO VALLATI, pp. 825-843 - Early Validation of High-Level System Requirements with Event Calculus and Answer Set Programming
ONDREJ VAŠÍCEK, JOAQUIN ARIAS, JAN FIEDOR, GOPAL GUPTA, BRENDAL HALL, BOHUSLAV KRENA, BRIAN LARSON, SARAT CHANDRA VARANASI, TOMÁŠ VOJNAR, pp. 844-862 - Abstract Environment Trimming DANIEL JURJO-RIVAS, JOSE F. MORALES, PEDRO LÓPEZ-GARCÍA, MANUEL V. HERMENEGILDO, pp. 863-884
- The Semantics of Metaprogramming in Prolog DAVID SCOTT WARREN, pp. 885-900
- On the Foundations of Conflict-Driven Solving for Hybrid MKNF Knowledge Bases
RILEY KINAHAN, SPENCER KILLEN, KEVIN WAN, JIA-HUAI YOU, pp. 901-920 - Cyclic Supports in Recursive Bipolar Argumentation Frameworks: Semantics and LP Mapping
GIANVINCENZO ALFANO, SERGIO GRECO, FRANCESCO PARISI, IRINA TRUBITSYNA, pp. 921-941
ISSUE 5 (September 2024)
- Locally Tight Programs
JORGE FANDINNO, VLADIMIR LIFSCHITZ, NATHAN TEMPLE, pp. 942-972 - Generating Global and Local Explanations for Tree-Ensemble Learning Methods by Answer Set Programming. By Akihiro Takemura and Katsumi Inoue, pp. 973-1010
- Combining Type Checking and Set Constraint Solving to Improve Automated Software Verification
Maximiliano Cristià, Gianfranco Rossi, pp 1011-1030 - (Technical note): Historical Review of Variants of Informal Semantics for Logic Programs under Answer Set Semantics: GL’88, GL’91, GK’14, D-V’12. YULIYA LIERLER, pp. 1031-1050
- Optimal matching for sharing and linearity analysis. Gianluca Amato, Francesca Scozzari, pp. 1051-1077