Lifted inference with tree axioms

DOI10.1016/j.artint.2023.103997OpenAlexW4386295665MaRDI QIDQ6088316

Timothy van Bremen, Ondřej Kuželka

Publication date: 16 November 2023

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2023.103997

zbMATH Keywords

logicstatistical-relational learningweighted first-order model counting

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites Work

• Unnamed Item
• Elements of finite model theory.
• Matrix tree theorems
• Markov logic networks
• Lifted Variable Elimination: Decoupling the Operators from the Constraint Language
• The Complexity of Enumeration and Reliability Problems
• On the Decision Problem for Two-Variable First-Order Logic
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• On the computational complexity of the Jones and Tutte polynomials
• Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers
• Weighted model counting beyond two-variable logic
• A Practical Approach to Courcelle's Theorem
• Two-Variable Logic with Counting and Trees
• Complexity of Two-Variable Logic on Finite Trees
• The dichotomy of probabilistic inference for unions of conjunctive queries

This page was built for publication: Lifted inference with tree axioms