Answer Set Programming
Answer Set Programming (ASP) is a declarative programming paradigm used to solve complex combinatorial problems by finding "answer sets" – models that satisfy a given logic program. Current research focuses on extending ASP's capabilities, including handling probabilistic information, integrating with large language models for improved code generation and natural language reasoning, and developing efficient algorithms for optimization and explanation generation. These advancements are enhancing ASP's applicability in diverse fields like AI planning, traffic optimization, and explainable AI, driving improvements in both theoretical understanding and practical problem-solving.
Papers
Building Trustworthy AI: Transparent AI Systems via Large Language Models, Ontologies, and Logical Reasoning (TranspNet)
Fadi Al Machot, Martin Thomas Horsch, Habib Ullah
Symbolic-AI-Fusion Deep Learning (SAIF-DL): Encoding Knowledge into Training with Answer Set Programming Loss Penalties by a Novel Loss Function Approach
Fadi Al Machot, Martin Thomas Horsch, Habib Ullah
Quantifying over Optimum Answer Sets
Giuseppe Mazzotta, Francesco Ricca, Mirek Truszczynski
Optimising Dynamic Traffic Distribution for Urban Networks with Answer Set Programming
Matteo Cardellini, Carmine Dodaro, Marco Maratea, Mauro Vallati
Dominating Set Reconfiguration with Answer Set Programming
Masato Kato, Torsten Schaub, Takehide Soh, Naoyuki Tamura, Mutsunori Banbara
LLASP: Fine-tuning Large Language Models for Answer Set Programming
Erica Coppolillo, Francesco Calimeri, Giuseppe Manco, Simona Perri, Francesco Ricca
A Reliable Common-Sense Reasoning Socialbot Built Using LLMs and Goal-Directed ASP
Yankai Zeng, Abhiramon Rajashekharan, Kinjal Basu, Huaduo Wang, Joaquín Arias, Gopal Gupta