default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th ECSQARU 2019: Belgrade, Serbia
- Gabriele Kern-Isberner, Zoran Ognjanovic:
Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 15th European Conference, ECSQARU 2019, Belgrade, Serbia, September 18-20, 2019, Proceedings. Lecture Notes in Computer Science 11726, Springer 2019, ISBN 978-3-030-29764-0
Argumentation
- Leila Amgoud
, Victor David, Dragan Doder:
Similarity Measures Between Arguments Revisited. 3-13 - Rihab Bouslama, Raouia Ayachi, Nahla Ben Amor:
A New Generic Framework for Mediated Multilateral Argumentation-Based Negotiation Using Case-Based Reasoning. 14-26 - Jérôme Delobelle, Serena Villata:
Interpretability of Gradual Semantics in Abstract Argumentation. 27-38 - Mariela Morveli Espinoza, Juan Carlos Nieves, Cesar Augusto Tacla:
An Imprecise Probability Approach for Abstract Argumentation Based on Credal Sets. 39-49 - Anthony Hunter, Sylwia Polberg:
A Model-Based Theorem Prover for Epistemic Graphs for Argumentation. 50-61 - Atefeh Keshavarzi Zafarghandi, Rineke Verbrugge, Bart Verheij:
Discussion Games for Preferred Semantics of Abstract Dialectical Frameworks. 62-73 - Nico Potyka, Sylwia Polberg, Anthony Hunter:
Polynomial-Time Updates of Epistemic States in a Fragment of Probabilistic Epistemic Argumentation. 74-86 - Chiaki Sakama, Katsumi Inoue:
Ordering Argumentation Frameworks. 87-98 - Remi Wieten, Floris Bex, Henry Prakken, Silja Renooij:
Constructing Bayesian Network Graphs from Labeled Arguments. 99-110
Belief Functions
- Safa Ben Ayed, Zied Elouedi, Eric Lefevre:
Toward the Evaluation of Case Base Maintenance Policies Under the Belief Function Theory. 113-124 - Milan Daniel, Václav Kratochvíl:
Belief Functions and Degrees of Non-conflictness. 125-136 - Radim Jirousek, Václav Kratochvíl:
On Expected Utility Under Ambiguity. 137-147 - Joaquín Abellán, Serafín Moral-García, María D. Benítez:
Combination in Dempster-Shafer Theory Based on a Disagreement Factor Between Evidences. 148-159
Conditional, Default and Analogical Reasoning
- Nelly Barbot, Laurent Miclet, Henri Prade, Gilles Richard:
A New Perspective on Analogical Proportions. 163-174 - Christoph Beierle, Steven Kutsch:
On the Antecedent Normal Form of Conditional Knowledge Bases. 175-186 - Nahla Ben Amor, Didier Dubois, Henri Prade, Syrine Saidi:
Revisiting Conditional Preferences: From Defaults to Graphical Representations. 187-198 - Angelo Gilio, Giuseppe Sanfilippo:
Conjunction of Conditional Events and t-Norms. 199-211 - Laura Giordano, Valentina Gliozzi:
Reasoning About Exceptions in Ontologies: An Approximation of the Multipreference Semantics. 212-225 - Steven Kutsch, Christoph Beierle:
Computation of Closures of Nonmonotonic Inference Relations Induced by Conditional Knowledge Bases. 226-237 - Suryani Lim, Henri Prade, Gilles Richard:
Solving Word Analogies: A Machine Learning Perspective. 238-250 - Kai Sauerwald, Christoph Beierle:
Decrement Operators in Belief Change. 251-262
Learning and Decision Making
- Peixian Chen, Zhourong Chen, Nevin L. Zhang:
A Novel Document Generation Process for Topic Detection Based on Hierarchical Latent Tree Models. 265-276 - Zhourong Chen, Xiaopeng Li, Zhiliang Tian, Nevin L. Zhang:
Fast Structure Learning for Deep Feedforward Networks via Tree Skeleton Expansion. 277-289 - Ipek Kivanç, Demet Özgür-Ünlüakin:
An Effective Maintenance Policy for a Multi-component Dynamic System Using Factored POMDPs. 290-300 - Jonathan Lawry, Michael Crosscombe, David Harvey:
Epistemic Sets Applied to Best-of-n Problems. 301-312 - Mathilde Monvoisin, Philippe Leray:
Multi-task Transfer Learning for Timescale Graphical Event Models. 313-323 - Andrey Ruschel, Arthur Colombini Gusmão, Gustavo Padilha Polleti, Fábio Gagliardi Cozman:
Explaining Completions Produced by Embeddings of Knowledge Graphs. 324-335 - Thijs van Ommen, Wouter M. Koolen, Peter D. Grünwald:
Efficient Algorithms for Minimax Decisions Under Tree-Structured Incompleteness. 336-347
Precise and Imprecise Probabilities
- Juan Carlos Alfaro Jiménez, Enrique González Rodrigo, Juan A. Aledo, José Antonio Gámez:
A Probabilistic Graphical Model-Based Approach for the Label Ranking Problem. 351-362 - Stefano Bonzio, Tommaso Flaminio, Paolo Galeazzi:
Sure-Wins Under Coherence: A Geometrical Perspective. 363-373 - Andrey G. Bronevich, Igor N. Rozenberg:
Conditioning of Imprecise Probabilities Based on Generalized Credal Sets. 374-384 - Sejla Dautovic, Dragan Doder:
Probabilistic Logic for Reasoning About Actions in Time. 385-396 - Tommaso Flaminio:
Towards a Standard Completeness for a Probabilistic Logic on Infinite-Valued Events. 397-407 - Hamzeh Mohammadi, Thomas Studer:
Bayesian Confirmation and Justifications. 408-418 - Niki Pfeifer, Giuseppe Sanfilippo:
Probability Propagation in Selected Aristotelian Syllogisms. 419-431 - José Miguel Puerta, Juan A. Aledo, José Antonio Gámez, Jorge D. Laborda:
Structural Fusion/Aggregation of Bayesian Networks via Greedy Equivalence Search Learning Algorithm. 432-443 - Milan Studený, Václav Kratochvíl, Jirí Vomlel:
On Irreducible Min-Balanced Set Systems. 444-454 - Natan T'Joens, Thomas E. Krak, Jasper De Bock, Gert de Cooman:
A Recursive Algorithm for Computing Inferences in Imprecise Markov Chains. 455-465
Uncertain Reasoning for Applications
- Bojan Marinkovic, Paola Glavan, Zoran Ognjanovic, Dragan Doder, Thomas Studer:
Probabilistic Consensus of the Blockchain Protocol. 469-480 - Jorge Castro, Joaquim Gabarró, Maria J. Serna:
Measuring Investment Opportunities Under Uncertainty. 481-491 - Federico Toffano, Nic Wilson:
Balancing Schedules Using Maximum Leximin. 492-503
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
