Del 16094 - Lecture Notes in Computer Science

Logics in Artificial Intelligence

19th European Conference, JELIA 2025, Kutaisi, Georgia, September 1–4, 2025, Proceedings, Part II

Häftad, Engelska, 2025

AvGiovanni Casini,Besik Dundua,Temur Kutsia

929 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2025-09-02
Mått155 x 235 x 20 mm
Vikt534 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor328
FörlagSpringer Nature Switzerland AG
ISBN9783032045898

Tillhör följande kategorier

Programmeringsböcker inom Data och IT
Tillämpad datateknik inom Data och IT
Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT

.- 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.