IncrementalWFOMC3 computes WFOMC on C² in time linear in counting parameters (tighter than prior quadratic) and proves domain-liftability for the richer C²_mod fragment while delivering large empirical speedups.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
baseline 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
baseline 1polarities
baseline 1representative citing papers
Classifies minimal non-comparability graphs by word-representability and shows the cover number by comparability graphs is Θ(log n) for some word-representable graphs on n vertices.
citing papers explorer
-
A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers
IncrementalWFOMC3 computes WFOMC on C² in time linear in counting parameters (tighter than prior quadratic) and proves domain-liftability for the richer C²_mod fragment while delivering large empirical speedups.
-
Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds
Classifies minimal non-comparability graphs by word-representability and shows the cover number by comparability graphs is Θ(log n) for some word-representable graphs on n vertices.