A Survey of Directed Entity-Relation-Based First-Order Probabilistic Languages

被引：8

作者：

Howard, Catherine ^{[1
]}

Stumptner, Markus ^{[2
]}

机构：

[1] Def Sci & Technol Org, Cyber & Elect Warfare Div, Edinburgh, SA 5111, Australia

[2] Univ S Australia, Adv Comp Res Ctr, Adelaide, SA 5095, Australia

来源：

ACM COMPUTING SURVEYS | 2014年 / 47卷 / 01期

关键词：

Languages; Algorithms; Directed entity-relation-based first-order probabilistic languages; LOGIC;

D O I：

10.1145/2560546

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Languages that combine aspects of probabilistic representations with aspects of first-order logic are referred to as first-order probabilistic languages (FOPLs). FOPLs can be divided into three categories: rule-based, procedural-based and entity-relation-based languages. This article presents a survey of directed entity-relation- based FOPLs and their associated model construction and inference algorithms.

引用

页数：40

共 127 条

[1] Alghamdi Ghazi, 2005, P 10 INT COMM CONTR
[2] [Anonymous], SEMANTIC WEB
[3] [Anonymous], 2003, P 18 INT JOINT C ART
[4] [Anonymous], 2007, Introduction to statistical relational learning
[5] [Anonymous], P 18 INT COMM CONTR
[6] [Anonymous], 2004, MSRTR200430
[7] [Anonymous], P 23 AAAI C ART INT
[8] Bangso O, 2004, LECT NOTES COMPUT SC, V3040, P457
[9] Bangso O., 2000, FLAIRS-2000. Proceedings of the Thirteenth International Florida Artificial Intelligence Research Society Conference, P282
[10] BANGSO O, 2004, THESIS AALBORG U DEN

← 1 2 3 4 5 6 7 8 9 10 →