Online event. November 3-12, 2021.

Edited by

ISSN: 2334-1033

ISBN: 978-1-956792-99-7

Sponsored by

Published by

Copyright © 2021 International Joint Conferences on Artificial Intelligence Organization

- Probabilistic reasoning and learning
- Reasoning and learning over knowledge graphs
- Statistical relational learning

We consider the problem of weighted first-order model counting (WFOMC): given a first-order sentence ϕ and domain size n ∈ ℕ, determine the weighted sum of models of ϕ over the domain {1, ..., n}. Past work has shown that any sentence using at most two logical variables admits an algorithm for WFOMC that runs in time polynomial in the given domain size (Van den Broeck 2011; Van den Broeck, Meert, and Darwiche 2014). In this paper, we extend this result to any two-variable sentence ϕ with the addition of a tree axiom, stating that some distinguished binary relation in ϕ forms a tree in the graph-theoretic sense.