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 1–4, 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.
Edited by:
Giovanni Casini,
Besik Dundua,
Temur Kutsia
Imprint: Springer Nature Switzerland AG
Country of Publication: Switzerland
Dimensions:
Height: 235mm,
Width: 155mm,
ISBN: 9783032045898
ISBN 10: 3032045894
Series: Lecture Notes in Computer Science
Pages: 328
Publication Date: 02 September 2025
Audience:
General/trade
,
ELT Advanced
Format: Paperback
Publisher's Status: Active
.- Non-monotonic Reasoning and Belief Change. .- Comparing Dialectical Systems: Contradiction and Counterexample in Iterated Belief Revision. .- The InfOCF Library for Reasoning with Conditional Belief Bases. .- Lockean Beliefs that are Deductively Closed and Minimal Change. .- Extending Defeasibility for Propositional Standpoint Logics. .- Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback. .- Propositional Reasoning, QBF, and Satisfiability Problems. .- AxSAT - Bringing Axioms to SAT Planning. .- On Extracting Legal Arguments. .- Inclusion with Repetitions and Boolean Constants – Implication Problems Revisited. .- Enhancing Query Efficiency for d-DNNF Representations Through Preprocessing. .- Explanations of Unsatisfiability Beyond Minimal Subsets. .- Refined Notions of QBF Equivalences. .- Refinement-Based Enumeration of QBF Solutions. .- Interpolating Parametric Array Theories. .- Maximum Satisfiability Formulations for Nonlinear Integer Programming. .- Exact Approaches for the Diverse Satisfiability Problem. .- Temporal Reasoning. .- A Framework for Computing Upper Bounds in Passive Learning Settings. .- On Temporal References via Definite Descriptions in First-Order Monadic Logic of Order. .- Alternating-Time Temporal Logic with Default Actions. .- Theorem Proving. .- Deciding Non-Fregean Identities: A Dual Tableau Approach. .- Exposure and Hiding: Approaching the Objective Probability and Hiding the Secret in Zero-Knowledge Proof. .- On a Second-Order Version of Russellian Theory of Definite Descriptions.