Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

PAC-reasoning in relational domains

Kuzelka, Ondrej, Wang, Yuyi, Davis, Jesse and Schockaert, Steven ORCID: 2018. PAC-reasoning in relational domains. Presented at: UAI2018: 34th Conference on Uncertainty in Artificial Intelligence, Monterey, CA, USA, 6-10 August 2018.

[thumbnail of UAI_2018.pdf]
PDF - Accepted Post-Print Version
Download (331kB) | Preview


We consider the problem of predicting plausible missing facts in relational data, given a set of imperfect logical rules. In particular, our aim is to provide bounds on the (expected) number of incorrect inferences that are made in this way. Since for classical inference it is in general impossible to bound this number in a non-trivial way, we consider two inference relations that weaken, but remain close in spirit to classical inference.

Item Type: Conference or Workshop Item (Paper)
Date Type: Completion
Status: In Press
Schools: Computer Science & Informatics
Related URLs:
Date of First Compliant Deposit: 23 July 2018
Last Modified: 23 Oct 2022 14:16

Citation Data

Cited 4 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item


Downloads per month over past year

View more statistics