Convergence results for relational Bayesian networks

Proceedings - Symposium on Logic in Computer Science

Volumn 1998-June, Issue , 1998, Pages 44-55

  Jaeger, Manfred ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC; PROBABILITY DISTRIBUTIONS;

CONVERGENCE PROPERTIES; CONVERGENCE RESULTS; FINITE MODEL THEORY; FINITE RELATIONAL STRUCTURES; FIRST ORDER; PROBABILISTIC MODELING; RELATIONAL BAYESIAN NETWORKS;

BAYESIAN NETWORKS;

EID: 79959698513     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.1998.705642     Document Type: Conference Paper

References (19)

1. Bacchus, F. (1990), Representing and Reasoning With Probabilistic Knowledge, MIT Press.
2. Bacchus, F., Grove, A. J., Halpern, J. Y. & Roller, D. (1997), 'From statistical knowledge bases to degrees of belief, Artificial Intelligence 87, 75143.
3. Blass, A., Gurevich, Y. & Rozen, D. (1985), 'A zero- one law for logic with fixed point operator', Information and Control 67, 70-90.
4. Cooper, G. F. (1990), 'The computational complexity of probabilistic inference using bayesian belief networks', Artificial Intelligence 42, 393-405.
5. Ebbinghaus, H.-D. & Flum, J. (1995), Finite Model Theory, Perspectives in Mathematical Logic, Springer Verlag.
6. Fagin, R. (1976), 'Probabilities on finite models', Journal of Symbolic Logic 41(1), 50-58.
7. Glebskii, Y., Rogan, D., Liogonkii, M. & Talanov, V. (1969), 'Range and degree of readability of formulas in the restricted predicate calculus', Kibernetika 2. English translation in Cybernetics 5 (1972).
8. Grove, A., Halpern, J. & Roller, D. (1992), Random worlds and maximum entropy, in 'Proc. 7th IEEE Symp. on Logic in Computer Science'.
9. Hagerup, T. & Rub, C. (1990), 'A guided tour of Chernoff bounds', Information Processing Letters 33, 305-308.
10. Jaeger, M. (1997), Relational bayesian networks, in 'Proceedings of UAI-97'.
11. Jaeger, M. (1998), Reasoning about infinite random structures with relational bayesian networks, in 'Principles of Rnowledge Representation and Reasoning: Proceedings of the Sixth International Converence (RR'98)'. to appear.
12. Rolaitis, P. G. & M.Y.Vardi (1990), '0-1 laws and decision problems for fragments of second-order logic', Information and Computation 87, 302-338.
13. Rolaitis, P. G. & M.Y.Vardi (1992), 'Infinitary logics and 0-1 laws', Information and Computation 98, 258-294.
14. Lynch, J. F. (1997), 'Infinitary logics and very- sparse random graphs', Journal of Symbolic Logic 62(2), 609-623.
15. McColm, G. L. (1996), Zero-one laws for gilbert random graphs, in 'Proceedings Eleventh Annual IEEE Symposium on Logic in Computer Science', pp. 360-369.
16. Oberschelp, W. (1982), Asymptotic 0-1 laws in combinatorics, in D. Jungnickel, ed., 'Combinatorial Theory', Vol. 969 of Lecture Notes in Ma them a tics, Springer Verlag.
17. Pearl, J. (1988), Probabilistic reasoning in intelligent systems : networks of plausible inference, The Morgan Raufmann series in representation and reasoning, rev. 2nd pr. edn, Morgan Raufmann, San Mateo, CA.
18. Shelah, S. & Spencer, J. (1988), 'Zero-one laws for sparse random graphs', Journal of the American Mathematical Society 1(1), 97-115.
19. Wellman, M. P., Breese, J. S. & Goldman, R. P. (1992), 'From knowledge bases to decision models', The Knowledge Engineering Review 7(1), 35-53.