Because many artificial intelligence applications require the ability to reason with uncertain knowledge, it is important to seek appropriate generalizations of logic for that case. We present here a semantical generalization of logic in which the truth values of sentences are probabili~ values (bet
β¦ LIBER β¦
Probabilistic logic revisited
β Scribed by Nils J. Nilsson
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 212 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Probabilistic logic
β
Nils J. Nilsson
π
Article
π
1986
π
Elsevier Science
π
English
β 821 KB
Autoepistemic logic revisited
β
Robert C. Moore
π
Article
π
1993
π
Elsevier Science
π
English
β 214 KB
Quantum logic revisited
β
L. RomΓ‘n; B. Rumbos
π
Article
π
1991
π
Springer US
π
English
β 434 KB
Probabilistic recurrence relations revis
β
Shiva Chaudhuri; Devdatt Dubhashi
π
Article
π
1997
π
Elsevier Science
π
English
β 669 KB
The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form where a is a function and H(x) is a random variable. For instance, T(x) may describe the running time of such an algorithm on a problem of size X. Then T(x) is a random variabl
Probabilistic logic via capacities
β
Thomas KΓ€mpke
π
Article
π
1995
π
John Wiley and Sons
π
English
β 512 KB
A relation between probabilistic logic and capacities (belief functions) is formally established. The use of lower probabilities is demonstrated to enrich expressiveness for frameworks based on polytopes of probability laws.
Weak nonmonotonic probabilistic logics
β
Thomas Lukasiewicz
π
Article
π
2005
π
Elsevier Science
π
English
β 321 KB