Search Results for author:
Found 1 papers, 0 papers with code
Lifted Inference with Linear Order Axiom
In this paper, we prove that adding a linear order axiom (which forces one of the predicates in $\phi$ to introduce a linear ordering of the domain elements in each model of $\phi$) on top of the counting quantifiers still permits a computation time polynomial in the domain size.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
