Logics in Artificial Intelligence

This two-volume set LNAI 16093-16094 constitutes the proceedings of the 19th European Conference on Logics in Artificial Intelligence, JELIA 2025, held in Kutaisi, Georgia, during September 14, 2025.

The 39 full papers and 5 short papers included in this volume were carefully reviewed and selected from 108 submissions. They were organized in the following topics:

Part I: Special Track: Logics for Explainable and Trustworthy AI; Argumentation; Constraint Satisfaction and Optimization; Deontic Reasoning; Description Logics and Ontological Reasoning; Higher-order and Non-classical Logics; Logic Programming and Answer Set Programming.

Part II: Non-monotonic Reasoning and Belief Change; Propositional Reasoning, QBF, and Satisfiability Problems; Temporal Reasoning; Theorem Proving.

Inhalt

.- Special Track: Logics for Explainable and Trustworthy AI.
.- A Uniform Language for Safety, Robustness and Explainability.
.- Reinforcement Learning Meets Logic Programming: Towards Explainable AI.
.- Formal Explanations of Black-Box Ranking Functions.
.- Why This and not That? A Logic-based Framework for Contrastive Explanations.
.- Argumentation.
.- On the Sensitivity of Extension Semantics to Similarity.
.- SCC-recursiveness in Infinite Argumentation.
.- Completing Structured Arguments in Assumption-based Argumentation.
.- Constraint Satisfaction and Optimization.
.- Engineering and Evaluating Multi-objective Pseudo-Boolean Optimizers.
.- Unsupervised Automata Learning via Discrete Optimization.
.- Finding Short Tree-like Unit Refutations in UTVPI Constraint Systems.
.- Deontic Reasoning.
.- GL-based Calculi for PCL and its Deontic Cousin.
.- deon-B: A Language for Well-Founded Deontic Planning.
.- Dual Scale Detachment.
.- Description Logics and Ontological Reasoning.
.- Towards Practicable Defeasible Reasoning for ABoxes.
.- Closure-Based Tractable Possibilistic Inference from Partially Ordered DL-Lite Ontologies.
.- Higher-order and Non-classical Logics.
.- Strongly First Order Disjunctive Embedded Dependencies in Team Semantics.
.- A Kripke Semantics for Intuitionistic Lukasiewicz Logic with Weak Excluded Middle.
.- From Modal Ockham Algebras to Modal Berman Variety: Relational Semantics and Kripke-Completeness.
.- Logic Programming and Answer Set Programming.
.- Lazy Atom Discovery in Compilation-Based ASP Solving.
.- Encoding Action Reversibility In Planning Using Quantified ASP and Bule.
.- DIRT: a Literature-based Benchmark Suite for Grounders.
.- An Experiment with Anthem: Semantic Equivalence of Tiling Programs.
.- Generalizing the Syntax of Terms in Mini-gringo.