Search Results for author:
Found 4 papers, 0 papers with code
Markov Logic Networks for Natural Language Question Answering
In the first, we simply use the extracted science rules directly as MLN clauses.
Symmetric Weighted First-Order Model Counting
For the combined complexity, we prove that, for every fragment FO$^{k}$, $k\geq 2$, the combined complexity of FOMC (or WFOMC) is #P-complete.
Understanding the Complexity of Lifted Inference and Asymmetric Weighted Model Counting
In this paper we study lifted inference for the Weighted First-Order Model Counting problem (WFOMC), which counts the assignments that satisfy a given sentence in first-order logic (FOL); it has applications in Statistical Relational Learning (SRL) and Probabilistic Databases (PDB).
Cannot find the paper you are looking for? You can
Submit a new open access paper.
