WFOMC with one linear order and its successor relations is polynomial-time in the domain size, while a second full linear order makes the problem #P1-hard.
Probabilistic (logic) programming concepts
1 Pith paper cite this work, alongside 193 external citations. Polarity classification is still indexing.
1
Pith paper citing it
193
external citations · OpenAlex
fields
cs.LO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Weighted First-Order Model Counting over Ordered Domains
WFOMC with one linear order and its successor relations is polynomial-time in the domain size, while a second full linear order makes the problem #P1-hard.