A transfer of Boolean network results to Datalog^neg yields structural conditions for existence, uniqueness, and counting bounds of stable, stable partial, and regular models, plus a characterization of regular models as minimal stable trap spaces.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Boolean Network Theory of Datalog$^\neg$
A transfer of Boolean network results to Datalog^neg yields structural conditions for existence, uniqueness, and counting bounds of stable, stable partial, and regular models, plus a characterization of regular models as minimal stable trap spaces.