Table of Contents

• Information Fusion and Revision in Qualitative and Quantitative Settings - Steps Towards a Unified FrameworkDidier Dubois. 1-18 [doi]
• Introducing Equational Semantics for Argumentation NetworksDov M. Gabbay. 19-35 [doi]
• Strong Equivalence for Argumentation Semantics Based on Conflict-Free SetsSarah Alice Gaggl, Stefan Woltran. 38-49 [doi]
• Backing and Undercutting in Defeasible Logic ProgrammingAndrea Cohen, Alejandro Javier García, Guillermo Ricardo Simari. 50-61 [doi]
• Arguing with Valued Preference RelationsSouhila Kaci, Christophe Labreuche. 62-73 [doi]
• Arguing about the Trustworthiness of the Information SourcesSerena Villata, Guido Boella, Dov M. Gabbay, Leendert van der Torre. 74-85 [doi]
• Two Roles of Preferences in Argumentation FrameworksLeila Amgoud, Srdjan Vesic. 86-97 [doi]
• A Re-definition of Mixtures of Polynomials for Inference in Hybrid Bayesian NetworksPrakash P. Shenoy. 98-109 [doi]
• Using Four Cost Measures to Determine Arc Reversal OrderingsCory J. Butz, Anders L. Madsen, Kevin Williams. 110-121 [doi]
• Using the Noisy-OR Model Can Be Harmful ... But It Often Is NotSteven P. D. Woudenberg, Linda C. van der Gaag. 122-133 [doi]
• Attaining Monotonicity for Bayesian NetworksMerel T. Rietbergen, Linda C. van der Gaag. 134-145 [doi]
• Importance Sampling on Bayesian Networks with Deterministic CausalitiesHaohai Yu, Robert van Engelen. 146-157 [doi]
• Bayesian Networks and the Imprecise Dirichlet Model Applied to Recognition ProblemsCassio Polpo de Campos, Qiang Ji. 158-169 [doi]
• On Stopping Evidence Gathering for Diagnostic Bayesian NetworksLinda C. van der Gaag, Hans L. Bodlaender. 170-181 [doi]
• SemCaDo: A Serendipitous Strategy for Learning Causal Bayesian Networks Using OntologiesMontassar Ben Messaoud, Philippe Leray, Nahla Ben Amor. 182-193 [doi]
• Scaling Up the Greedy Equivalence Search Algorithm by Constraining the Search Space of Equivalence ClassesJuan Ignacio Alonso-Barba, Luis de la Ossa, José A. Gámez, Jose Miguel Puerta. 194-205 [doi]
• Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence ConstraintsVáclav Lín. 206-216 [doi]
• Locally Averaged Bayesian Dirichlet MetricsAndrés Cano, Manuel Gómez-Olmedo, Andrés R. Masegosa, Serafín Moral. 217-228 [doi]
• Mixture of Markov Trees for Bayesian Network Structure Learning with Small Datasets in High Dimensional SpaceSourour Ammar, Philippe Leray. 229-238 [doi]
• Finding P-Maps and I-Maps to Represent Conditional IndependenciesMarco Baioletti, Giuseppe Busanello, Barbara Vantaggi. 239-250 [doi]
• Marginalization without Summation Exploiting Determinism in Factor AlgebraSander Evers, Peter J. F. Lucas. 251-262 [doi]
• Independence and 2-Monotonicity: Nice to Have, Hard to KeepSébastien Destercke. 263-274 [doi]
• Constructing Dynamic Frames of Discernment in Cases of Large Number of ClassesYousri Kessentini, Thomas Burger, Thierry Paquet. 275-286 [doi]
• On Consistent Approximations of Belief Functions in the Mass SpaceFabio Cuzzolin. 287-298 [doi]
• Generalized Information Theory Based on the Theory of HintsMarc Pouly. 299-313 [doi]
• Towards an Alarm for Opposition Conflict in a Conjunctive Combination of Belief FunctionsEric Lefevre, Zied Elouedi, David Mercier. 314-325 [doi]
• E2GK: Evidential Evolving Gustafsson-Kessel Algorithm for Data Streams Partitioning Using Belief FunctionsLisa Serir, Emmanuel Ramasso, Noureddine Zerhouni. 326-337 [doi]
• Evidential Markov Decision ProcessesHélène Soubaras, Christophe Labreuche, Pierre Savéant. 338-349 [doi]
• Continuous Belief Functions to Qualify Sensors PerformancesPierre-Emmanuel Doré, Christophe Osswald, Arnaud Martin, Anne-Laure Jousselme, Patrick Maupin. 350-361 [doi]
• Measuring Consistency Gain and Information Loss in Stepwise Inconsistency ResolutionJohn Grant, Anthony Hunter. 362-373 [doi]
• Relating Truth, Knowledge and Belief in Epistemic StatesCostas D. Koutras, Yorgos Zikos. 374-385 [doi]
• How Strong Can an Agent Believe Reported Information ?Laurence Cholvy. 386-397 [doi]
• Logic-Based Fusion of Complex Epistemic StatesAmílcar Mata Díaz, Ramón Pino Pérez. 398-409 [doi]
• Latent Tree ClassifierYi Wang, Nevin Lianwen Zhang, Tao Chen, Leonard K. M. Poon. 410-421 [doi]
• When Learning Naive Bayesian Classifiers Preserves MonotonicityBarbara F. I. Pieters, Linda C. van der Gaag, Ad Feelders. 422-433 [doi]
• Possibilistic Classifiers for Uncertain Numerical DataMyriam Bounhas, Henri Prade, Mathieu Serrurier, Khaled Mellouli. 434-446 [doi]
• Relational Probabilistic Conditional Reasoning at Maximum EntropyMatthias Thimm, Gabriele Kern-Isberner, Jens Fisseler. 447-458 [doi]
• Probabilistic Approach to Nonmonotonic Consequence RelationsDragan Doder, Aleksandar Perovic, Zoran Ognjanovic. 459-471 [doi]
• Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy FrameworkEmad Saad. 472-484 [doi]
• Answer Set Programming for Computing Decisions Under UncertaintyRoberto Confalonieri, Henri Prade. 485-496 [doi]
• Quasi Conjunction and Inclusion Relation in Probabilistic Default ReasoningAngelo Gilio, Giuseppe Sanfilippo. 497-508 [doi]
• Handling Exceptions in Logic Programming without Negation as FailureRoberto Confalonieri, Henri Prade, Juan Carlos Nieves. 509-520 [doi]
• Probabilistic Stit LogicJan Broersen. 521-531 [doi]
• Overriding Subsuming RulesPhilippe Besnard, Éric Grégoire, Sébastien Ramon. 532-544 [doi]
• Pseudo-polynomial Functions over Finite Distributive LatticesMiguel Couceiro, Tamás Waldhauser. 545-556 [doi]
• A Bridge between Probability and Possibility in a Comparative FrameworkGiulianella Coletti, Romano Scozzafava, Barbara Vantaggi. 557-568 [doi]
• Leximax Relations in Decision Making through the Dominance Plausible RuleFranklin Camacho, Ramón Pino Pérez. 569-581 [doi]
• Parameterized Uncertain Reasoning Approach Based on a Lattice-Valued LogicShuwei Chen, Jun Liu, Hui Wang 0001, Juan Carlos Augusto. 582-593 [doi]
• From Preference Relations to Fuzzy Choice FunctionsDavide Martinetti, Ignacio Montes, Susana Díaz. 594-605 [doi]
• Fuzzy Relational Inequations and Equations in the Framework of Control ProblemsJorge Jiménez, Susana Montes, Branimir Seselja, Andreja Tepavcevic. 606-615 [doi]
• Fuzzy Autoepistemic Logic: Reflecting about Knowledge of Truth DegreesMarjon Blondeel, Steven Schockaert, Martine De Cock, Dirk Vermeir. 616-627 [doi]
• Belief Functions on MV-Algebras of Fuzzy Events Based on Fuzzy EvidenceTommaso Flaminio, Lluis Godo, Enrico Marchioni. 628-639 [doi]
• Order Compatible Fuzzy Relations and Their Elicitation from General Fuzzy PartitionsSandra Sandri, Flávia Toledo Martins-Bedé. 640-650 [doi]
• Web Services and ::::Incerta Spiriti::::: A Game Theoretic Approach to UncertaintyJoaquim Gabarró, Maria J. Serna, Alan Stewart. 651-662 [doi]
• Underwater Archaeological 3D Surveys Validation within the Removed Sets FrameworkJulien Hué, Mariette Sérayet, Pierre Drap, Odile Papini, Eric Würbel. 663-674 [doi]
• Adaptive Dialogue Strategy Selection through Imprecise Probabilistic Query AnsweringIan O Neill, Anbu Yue, Weiru Liu, Phil Hanna. 675-687 [doi]
• Statistical Estimations of Lattice-Valued Possibilistic DistributionsIvan Kramosil, Milan Daniel. 688-699 [doi]
• Compiling Min-based Possibilistic Causal Networks: A Mutilated-Based ApproachRaouia Ayachi, Nahla Ben Amor, Salem Benferhat. 700-712 [doi]
• Possibilistic EvidenceHenri Prade, Agnès Rico. 713-724 [doi]
• A Preference Query Model Based on a Fusion of Local OrdersPatrick Bosc, Olivier Pivert, Grégory Smits. 725-736 [doi]
• Approximate Achievability in Event DatabasesAustin Parker, Gerardo I. Simari, Amy Sliva, V. S. Subrahmanian. 737-748 [doi]
• A Probabilistic Interpretation for a Geometric Similarity MeasureSebastian Lehrack, Ingo Schmitt. 749-760 [doi]