Recursive random fields

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 950-955

  Lowd, Daniel ^a   Domingos, Pedro ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXISTENTIAL QUANTIFIERS; FIRST ORDER LOGIC; INTEGRITY CONSTRAINTS; LOGICAL CONNECTIVES; MARKOV LOGIC NETWORKS; STRUCTURE-LEARNING; THEORY REVISION; UNIVERSAL QUANTIFIERS;

ARTIFICIAL INTELLIGENCE; FORESTRY; KNOWLEDGE BASED SYSTEMS; MARKOV PROCESSES;

BACKPROPAGATION;

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

References (7)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. P. Andritsos, A. Fuxman, and R. Miller. Clean answers over dirty databases: A probabilistic approach. In Proc. ICDE-06, page 30, 2006
3. J. Besag. Statistical analysis of non-lattice data. The Statistician, 24:179-195, 1975.
4. J. Besag. On the statistical analysis of dirty pictures. J. Royal Stat. Soc. B, 48:259-302, 1986.
5. I. Ilyas, V. Markl, P. Haas, P. Brown, and A. Aboulnaga. Cords: Automatic discovery of correlations and soft functional dependencies. In Proc. SIGMOD-04, pages 647-658, 2004.
6. M. Richardson and P. Domingos. Markov logic networks. Machine Learning, 62:107-136, 2006. (Pubitemid 43202307)
7. G. Towell and J. Shavlik. Knowledge-based artificial neural networks. Artificial Intelligence, 70:119-165, 1994.