Symbolic and Quantitative Approaches to Reasoning and Uncertainty - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540601128, 9783540494386

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A reduction of the theory of confirmation to the notions of distance and measure

Symbolic and Quantitative Approaches to Reasoning and Uncertainty - Lecture Notes in Computer Science ◽

10.1007/3-540-60112-0_44 ◽

1995 ◽

pp. 387-394

Author(s):

Karl Schlechta

Download Full-text

Using Maximum Entropy to compute marginal probabilities in a causal binary tree need not take exponential time

Symbolic and Quantitative Approaches to Reasoning and Uncertainty - Lecture Notes in Computer Science ◽

10.1007/3-540-60112-0_41 ◽

1995 ◽

pp. 352-363

Author(s):

Paul C. Rhodes ◽

Gerald R. Garside

Keyword(s):

Maximum Entropy ◽

Binary Tree ◽

Exponential Time

Download Full-text

Two different types of discontinuity of bayesian learning in causal probabilistic networks

Symbolic and Quantitative Approaches to Reasoning and Uncertainty - Lecture Notes in Computer Science ◽

10.1007/3-540-60112-0_37 ◽

1995 ◽

pp. 320-327

Author(s):

Ulrich G. Oppel

Keyword(s):

Bayesian Learning ◽

Probabilistic Networks ◽

Different Types

Download Full-text

Using default logic in information retrieval

Symbolic and Quantitative Approaches to Reasoning and Uncertainty - Lecture Notes in Computer Science ◽

10.1007/3-540-60112-0_27 ◽

1995 ◽

pp. 235-242 ◽

Cited By ~ 9

Author(s):

Anthony Hunter

Keyword(s):

Information Retrieval ◽

Default Logic

Download Full-text

Update postulates without inertia

Symbolic and Quantitative Approaches to Reasoning and Uncertainty - Lecture Notes in Computer Science ◽

10.1007/3-540-60112-0_19 ◽

1995 ◽

pp. 162-170 ◽

Cited By ~ 3

Author(s):

D. Dubois ◽

F. Dupin de Saint-Cyr ◽

H. Prade

Download Full-text

Constructing flexible dynamic belief networks from first-order probabilistic knowledge bases

Symbolic and Quantitative Approaches to Reasoning and Uncertainty - Lecture Notes in Computer Science ◽

10.1007/3-540-60112-0_25 ◽

1995 ◽

pp. 217-226 ◽

Cited By ~ 18

Author(s):

Sabine Glesner ◽

Daphne Koller

Keyword(s):

Knowledge Bases ◽

Belief Networks ◽

First Order ◽

Probabilistic Knowledge

Download Full-text

Yet some more considerations on cumulativity in default logics

Symbolic and Quantitative Approaches to Reasoning and Uncertainty - Lecture Notes in Computer Science ◽

10.1007/3-540-60112-0_42 ◽

1995 ◽

pp. 364-378

Author(s):

Vincent Risch

Keyword(s):

Default Logics

Download Full-text

Using qualitative uncertainty in protein topology prediction

Symbolic and Quantitative Approaches to Reasoning and Uncertainty - Lecture Notes in Computer Science ◽

10.1007/3-540-60112-0_39 ◽

1995 ◽

pp. 336-343

Author(s):

Simon Parsons

Keyword(s):

Protein Topology ◽

Qualitative Uncertainty ◽

Topology Prediction

Download Full-text

A theorem prover for default logic based on prioritized conflict resolution and an extended resolution principle

Symbolic and Quantitative Approaches to Reasoning and Uncertainty - Lecture Notes in Computer Science ◽

10.1007/3-540-60112-0_35 ◽

1995 ◽

pp. 301-310 ◽

Cited By ~ 2

Author(s):

Jérôme Mengin

Keyword(s):

Conflict Resolution ◽

Default Logic ◽

Theorem Prover ◽

Resolution Principle

Download Full-text

Specificity by default

Symbolic and Quantitative Approaches to Reasoning and Uncertainty - Lecture Notes in Computer Science ◽

10.1007/3-540-60112-0_24 ◽

1995 ◽

pp. 207-216 ◽

Cited By ~ 1

Author(s):

P. Geerts ◽

D. Vermeir

Download Full-text

Symbolic and Quantitative Approaches to Reasoning and Uncertainty - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A reduction of the theory of confirmation to the notions of distance and measure

Using Maximum Entropy to compute marginal probabilities in a causal binary tree need not take exponential time

Two different types of discontinuity of bayesian learning in causal probabilistic networks

Using default logic in information retrieval

Update postulates without inertia

Constructing flexible dynamic belief networks from first-order probabilistic knowledge bases

Yet some more considerations on cumulativity in default logics

Using qualitative uncertainty in protein topology prediction

A theorem prover for default logic based on prioritized conflict resolution and an extended resolution principle

Specificity by default

Symbolic and Quantitative Approaches to Reasoning and Uncertainty - Lecture Notes in Computer Science
Latest Publications