Markov logic in infinite domains

Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, UAI 2007

Volumn , Issue , 2007, Pages 368-375

  Singla, Parag ^a   Domingos, Pedro ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE DOMAINS; FINITE NUMBER; FIRST ORDER LOGIC; FIRST-ORDER FORMULAS; GIBBS MEASURE; INFINITE DOMAINS; MARKOV LOGIC; MARKOV LOGIC NETWORKS; MARKOV NETWORKS; RICHARDSON; SATISFIABILITY;

ARTIFICIAL INTELLIGENCE; MARKOV PROCESSES;

PROBABILISTIC LOGICS;

EID: 80053205730     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. Bacchus, F. (1990). Representing and reasoning with probabilistic knowledge. MIT Press.
2. Bacchus, F., Grove, A. J., Halpern, J. Y., & Koller, D. (1996). From statistical knowledge bases to degrees of belief. Artif. Intel, 87, 75-143. (Pubitemid 126371217)
3. Billingsley, P. (1995). Probability and measure (3rd Ed.). Wiley.
4. Booth, T., & Thompson, R. (1973). Applying probability measures to abstract languages. IEEE Transactions on Computers, C-22, 442-450.
5. Chi, Z. (1999). Statistical properties of probabilistic context-free grammars. Computational Linguistics, 25, 131-160.
6. Domingos, P., Kok, S., Poon, H., Richardson, M., & Singla, P. (2006). Unifying logical and statistical AI. Proc. AAAI-06 (pp. 2-7). (Pubitemid 44705255)
7. Friedman, N., Getoor, L., Koller, D., & Pfeffer, A. (1999). Learning probabilistic relational models. Proc. IJCAI-99 (pp. 1300-1307).
8. Genesereth, M. R., & Nilsson, N. J. (1987). Logical foundations of artificial intelligence. Morgan Kaufmann.
9. Georgii, H. (1988). Gibbs measures and phase transitions. De Gruyter.
10. Getoor, L., & Taskar, B. (Eds.). (2007). Introduction to Statistical Relational Learning. MIT Press.
11. Halpern, J. (1990). An analysis of first-order logics of probability. Artif Intel, 46, 311-350.
12. Jaeger, M. (1998). Reasoning about infinite random structures with relational Bayesian networks. Proc. KR-98.
13. Kersting, K., & De Raedt, L. (2001). Towards combining inductive logic programming with Bayesian networks. Proc. ILP-01 (pp. 118-131). (Pubitemid 33332602)
14. Kok, S., Sumner, M., Richardson, M., Singla, P., Poon, H., & Domingos, P. (2006). The Alchemy system for statistical relational AI(Tech. Rept). Dept. Comp. Sci. & Eng., Univ. Washington. http://alchemy.cs. washington.edu.
15. Laskey, K., & Costa, P. (2005). Of starships and Klingons: Bayesian logic for 23rd century. Proc. UAI-05 (pp. 346-353).
16. Lowd, D., & Domingos, P. (2007). Recursive random fields. Proc. IJCAI-07 (pp. 950-955).
17. Milch, B., Marthi, B., Sontag, D., Russell, S., & Ong, D. L. (2005). Approximate inference for infinite contingent Bayesian networks. Proc. AISTATS-05.
18. Muggleton, S. (1996). Stochastic logic programs. In L. De Raedt (Ed.), Advances in inductive logic programming, 254-264. IOS Press.
19. Nilsson, N. (1986). Probabilistic logic. Artif. Intel, 28, 71-87.
20. Pfeffer, A., & Koller, D. (2000). Semantics and inference for recursive probability models. Proc. AAAI-00 (pp. 538-544).
21. Poole, D. (1997). The independent choice logic for modelling multiple agents under uncertainty. Artif. Intel, 94, 7-56. (Pubitemid 127371445)
22. Richardson, M., & Domingos, P. (2006). Markov logic networks. Mach. Learn., 62, 107-136. (Pubitemid 43202307)
23. Sato, T., & Kameya, Y. (1997). PRISM: A symbolic-statistical modeling language. Proc. AAAI-97 (pp. 1330-1335).
24. Singla, P., & Domingos, P. (2007). Markov logic in infinite domains (Tech. Rept.). Dept. Comp. Sci. & Eng., Univ. Washington. http://alchemy.cs.washington.edu/papers/singla07/tr.pdf.
25. Taskar, B., Abbeel, P., & Koller, D. (2002). Discriminative probabilistic models for relational data. Proc. UAI-02 (pp. 485-492).
26. Wellman, M., Breese, J. S., & Goldman, R. P. (1992). From knowledge bases to decision models. Knowl Eng. Rev, 7.