Couso / Sioutis / Stefaneas | Scalable Uncertainty Management | Buch | 978-3-032-43513-2 | www.sack.de

Buch, Englisch, 385 Seiten, Format (B × H): 155 mm x 235 mm

Reihe: Lecture Notes in Computer Science

Couso / Sioutis / Stefaneas

Scalable Uncertainty Management

17th International Conference, SUM 2026, Athens, Greece, October 21–23, 2026, Proceedings
Erscheinungsjahr 2026
ISBN: 978-3-032-43513-2
Verlag: Springer

17th International Conference, SUM 2026, Athens, Greece, October 21–23, 2026, Proceedings

Buch, Englisch, 385 Seiten, Format (B × H): 155 mm x 235 mm

Reihe: Lecture Notes in Computer Science

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


This book constitutes the refereed proceedings of the 17th International Conference on Scalable Uncertainty Management, SUM 2026, held in Athens, Greece, during October 21–23, 2026.

The 23 full papers and 6 short papers included in the proceedings were carefully reviewed and selected from 38 submissions, also includes two invited extended abstracts. They focus on Artificial Intelligence, Uncertainty Reasoning, Logic, Databases, Machine Learning, Information Retrieval, Data Mining, Semantic Web, Risk Analysis, Conditionals, Inconsistency, Elicitation, Incomplete Knowledge, Argumentation.

Couso / Sioutis / Stefaneas Scalable Uncertainty Management jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


.- Regular Papers.

.- Temporal Argumentation for Continuous Cyber-Safety Assurance of AI-Enabled Aerospace Systems.
.- A Modal Framework for Relational Analogies.
.- From Logical Proportions to a New Clustering Algorithm.
.- lxp-SPARQL: Expressing Lexicographic Preferences for Knowledge Graphs.
.- Reconciling Consistency-Based Diagnosis with Actual-Causality-Based Explanations.
.- When AI Influence Helps or Hurts: Guarantees for Ranking-Based Human–AI Aggregation.
.- Uncertainty-Aware Discrete Bayesian Classification under Bounded Input Perturbations.
.- Prime Implicants Beyond Consistency.
.- Compositional Boundaries for Density Fusion.
.- Managing Uncertainty in LLM-Generated Procedural Knowledge for Virtual Laboratory Planning.
.- Causal Structure Preservation in Neural Assemblies under Encoding Uncertainty.
.- Spatial interpolation under incomplete covariate data set.
.- The Curious Case of Exploding DecPOMDPs: Containing the Fire through Policy Counting.
.- Lifted Model Construction under Approximate Commutativity.
.- Improving Multivariate Time Series Classification with Class-Wise Training and Model Aggregation.
.- Diversified and Perceptible Counterfactual Examples Leveraging Expert Knowledge.
.- An efficient integer programming formulation for producing robust covering explanations.
.- Governed Blind Commitment Planning under Null-Observation Windows.
.- TrustForest: Typed Semantic Trust Graphs for Uncertainty-Aware Cybersecurity Decision Fusion.
.- Explainable Analogical Learning of Preferences.
.- Making Implicit Premises Explicit in Logical Understanding of Enthymemes.
.- On Probabilistic Inference Through Parametric Tensor Decomposition in Base Tensor Networks.
.- Continuous Reasons for Random Forests via Budgeted Ordered Binary Decision Diagrams Compilation.

.- Short Papers.

.- Analogenesis: A Platform for Analogy Games.
.- A Probabilistic Extension of the Logic of Evidence and Truth LETK+.
.- Approximate Unification in Possibilistic Logic.
.- Probabilistic Relational Argumentation for Dynamic Belief Revision under Uncertainty.
.- Incomplete Data and Datalog± Knowledge Bases: X-Raying the Chase.
.- Symmetric sums in numerical proportional analogies.



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.