Symbolic and quantitative approaches to reasoning and uncertainty : European Conference, ECSQARU '95, Fribourg, Switzerland, July 3 5, 1995 : proceedings
This volume constitutes the 48 full refereed research papers accepted for presentation at the Third European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, ECSQARU '95, held in Fribourg, Switzerland in July 1995 under the sponsorship of the DRUMS consortium (ES...
保存先:
| 第一著者: | |
|---|---|
| 団体著者: | |
| その他の著者: | |
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| シリーズ: | Lecture notes in computer science. Lecture notes in artificial intelligence
946 |
| 主題: | |
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Symbolic and quantitative approaches to reasoning and uncertainty, European Conference ECSQARU '95, Fribourg, Switzerland, July 3-5, 1995, proceedings, Christine Froidevaux, Jürg Kohlas (eds.), Berlin, Springer, 1995, 1 vol. (X-430 p.), Lecture notes in computer science, 3-540-60112-0 • Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Texte imprimé, 9783662202029 |
目次:
- 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.