Symbolic and Quantitative Approaches to Reasoning and Uncertainty

For all typical.- A posteriori knowledge: from ambiguous knowledge and undefined information to knowledge.- Modeling uncertain relational knowledge: the AV-quantified production rules approach.- Multiple database logic.- A local approach to reasoning under inconsistency in stratified knowledge bases.- Quasi-classical logic: Non-trivializable classical reasoning from inconsistent information.- A cost bounded possibilistic ATMS.- A substructural connective for possibilistic logic.- Chain graphs: Semantics and expressiveness.- Axiomatic treatment of possibilistic independence.- Parametric structure of probabilities in Bayesian networks.- From non-monotonic syntax-based entailment to preference-based argumentation.- Non-monotonic syntax-based entailment: A classification of consequence relations.- Local Möbius transforms of monotone capacities.- Automated reasoning with merged contradictory information whose reliability depends on topics.- Linking transition-based update and base revision.- Prioritized transitions for updates.- Probabilistic satisfiability and decomposition.- Update postulates without inertia.- Similarity-based consequence relations.- Epistemic approach to actions with typical effects.- Nonmonotonic belief state frames and reasoning frames.- A Bayesian network based learning system: — Architecture and performance comparison with other methods.- Specificity by default.- Constructing flexible dynamic belief networks from first-order probabilistic knowledge bases.- On the formalism of stochastic logic.- Using default logic in information retrieval.- Sensitivity analysis in Bayesian networks.- Bayesian approximation and invariance of Bayesian belief functions.- Model-based diagnostics using hints.- An axiomatic approach to extensional probability measures.- The dynamics of default reasoning.- Lemma handling in default logic theorem provers.- Uncertain reasoning in concept lattices.- A theorem prover for default logic based on prioritized conflict resolution and an extended resolution principle.- A theorem prover for lukaszewicz open default theory.- Two different types of discontinuity of bayesian learning in causal probabilistic networks.- Revision in extended propositional calculus.- Using qualitative uncertainty in protein topology prediction.- Circumscribing features and fluents: Reasoning about action with default effects.- Using Maximum Entropy to compute marginal probabilities in a causal binary tree need not take exponential time.- Yet some more considerations on cumulativity in default logics.- A two-stage approach to first order default reasoning.- A reduction of the theory of confirmation to the notions of distance and measure.- Cluster-based specification techniques in Dempster-Shafer theory.- And/or trees for knowledge representation.- Why defeasible deontic logic needs a multi preference semantics.- Numeric defaults.