1 citations · 1 across the 8 of their papers we have counts for
4 papers · 1 filter
Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks
Mohimenul Kabir, Van-Giang Trinh, Samuel Pastva +1
Boolean Networks (BNs) serve as a fundamental modeling framework for capturing complex dynamical systems across various domains, including systems biology, computational logic, and…
On the Boolean Network Theory of Datalog
Van-Giang Trinh, Belaid Benhamou, Sylvain Soliman +1
Datalog is a central formalism used in a variety of domains ranging from deductive databases and abstract argumentation frameworks to answer set programming. Its model theor…
On the number of asynchronous attractors in AND-NOT Boolean networks
Van-Giang Trinh, Samuel Pastva, Jordan Rozum +2
Boolean Networks (BNs) describe the time evolution of binary states using logic functions on the nodes of a network. They are fundamental models for complex discrete dynamical syst…
Graphical Conditions for the Existence, Unicity and Number of Regular Models
Van-Giang Trinh, Belaid Benhamou, Sylvain Soliman +1
The regular models of a normal logic program are a particular type of partial (i.e. 3-valued) models which correspond to stable partial models with minimal undefinedness. In this p…