# PAC-Reasoning in Relational Domains

arXiv: https://arxiv.org/abs/1803.05768 · HTML: https://mlsanity.com/paper/1803.05768/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Mar 2018.

## Built on by (most cited first, 1 of 1)

- [On the Aggregation of Rules for Knowledge Graph Completion](https://mlsanity.com/paper/2309.00306/) (2023)

## Abstract (arXiv)

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.