Sauerwald / Thimm | Symbolic and Quantitative Approaches to Reasoning with Uncertainty | Buch | 978-3-032-05133-2 | www.sack.de

Buch, Englisch, 514 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 791 g

Reihe: Lecture Notes in Computer Science

Sauerwald / Thimm

Symbolic and Quantitative Approaches to Reasoning with Uncertainty

18th European Conference, ECSQARU 2025, Hagen, Germany, September 23-26, 2025, Proceedings
Erscheinungsjahr 2025
ISBN: 978-3-032-05133-2
Verlag: Springer

18th European Conference, ECSQARU 2025, Hagen, Germany, September 23-26, 2025, Proceedings

Buch, Englisch, 514 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 791 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-032-05133-2
Verlag: Springer


This volume LNAI 16099 constitutes the refereed proceedings of the 19th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2025, held in Hagen, Germany, during September 23-26, 2025.

The 34 full papers presented in this volume were carefully reviewed and selected from 48 submissions. The papers are organized in the following topical sections: Bayesian Networks; Learning and Probability; Game Theory and Social Choice; Conditionals, Inference, Change; Argumentation; Logic and Inconsistency.

Sauerwald / Thimm Symbolic and Quantitative Approaches to Reasoning with Uncertainty jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


.- Bayesian Networks.
.- Inverse Marginalisation for Safely Expanding Bayesian Networks.
.- Classifying Control Room Operators’ Performance Using Bayesian Networks.
.- Wrong Data Detection in Electricity Grids Using Bayesian Networks.
.- Maximum Entropy-based Quantification for Probability Elicitation in Bayesian Networks.
.- Involving Uncertainty in Bayesian Network Tuning.
.- Learning and Probability.
.- Discrete Minimax Probabilistic Classifier Chains for Multi-Label Classification Under Label Imbalance.
.- Noise-Robust Weighted Logistic Regression Based on Outlier Detection with Expectation Maximization.
.- From RBMs to BN2A models: Parameter Transformation for Interpretable Educational Diagnostics.
.- Denoising the Future: Top-p Distributions for Moving Through Time.
.- Distortions of lower probabilities as a tool for avoiding conflict.
.- Analogical proportions between probabilities.
.- Robust Explanations: The Case of Prime Implicants.
.- Consensus in Motion: A Case of Dynamic Rationality of Sequential Learning in Probability Aggregation.
.- Arithmetic Circuit Compilation using Symbolic Probabilistic Inference and Indicator-Determined Buckets.
.- Game Theory and Social Choice.
.- Counting Agents in Partially Observable Stochastic Games.
.- Expected Shapley Value is Shapley Value for Expected Utility Game.
.- Upper Expected Meeting Times for Interdependent Stochastic Agents.
.- Elicit and Weigh: A Voting-Based Approach to Optimal Weights in Imprecise Linear Pooling.
.- Conditionals, Inference, Change.
.- Gärdenfors’s Supplementary Postulates for Partial Product Contractions.
.- Explaining Changes in Total Preorders and Ranking Functions.
.- Implementing Lexicographic Inference Using Partial MaxSAT.
.- Conditional Logics of Nondeterministic Change.
.- Towards an algebraic and probabilistic setting for iterated Boolean conditionals.
.- On measuring the possibility of selection-function based conditionals, general updates, and qualitative capacities.
.- Possibilistic logic and inference for linear systems.
.- Argumentation.
.- Assumption-Based Argumentation for General Extended Disjunctive Logic Programming with Negation as Failure in the Head.
.- Winning by Numbers: Connecting Strong Admissibility to Optimal Play in Argumentation.
.- First steps towards forgetting in ASPIC+.
.- Strong Admissibility and Infinite Argumentation Frameworks.
.- Recognizing the Impact among Relevant Elements for Reaching Stability in Incomplete Argumentation Frameworks.
.- Logic and Inconsistency.
.- Privacy-Preserving Inconsistency Measurement.
.- Using Sentence Embeddings to Identify Conflicts in Propositional Logic.
.- Dynamic Logic for Quantum Probability.
.- A Kripke Semantics for Monadic BL Chains.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.