activity
20192026
most citedAn ASP-based Approach for Attractor Enumeration in Synchronous and Asynchronous Boolean Networks

4 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing cs.LOShow all

5 papers · 1 filter

cs.LO2026

On the Trap Space Semantics of Normal Logic Programs

Van-Giang Trinh, Sylvain Soliman, François Fages +1

The logical semantics of normal logic programs has traditionally been based on the notions of Clark's completion and two-valued or three-valued canonical models, including supporte…

cs.LO2025

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…

cs.LO2025

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…

cs.LO2024

Static Analysis of Logic Programs via Boolean Networks

Van-Giang Trinh, Belaid Benhamou

Answer Set Programming (ASP) is a declarative problem solving paradigm that can be used to encode a combinatorial problem as a logic program whose stable models correspond to the s…

cs.LO2024★ 1 cited

mpbn: a simple tool for efficient edition and analysis of elementary properties of Boolean networks

Van-Giang Trinh, Belaid Benhamou, Loïc Paulevé

The tool mpbn offers a Python programming interface for an easy interactive editing of Boolean networks and the efficient computation of elementary properties of their dynamics, in…