1 citations · 1 across the 8 of their papers we have counts for
8 papers · 1 filter
Walk-In Multi-Stage Patient Flow Scheduling: An ASP Model with DES-Based Evaluation
Ngoc-Mai Pham, Trang-Linh Nguyen, Thi-Hai-Yen Vuong +2
An effective examination and test schedule for patients plays a crucial role in hospital resource management. In this work, we formulate a new reactive patient-flow scheduling prob…
BAss: Symbolic Reasoning in Abstract Dialectical Frameworks
Samuel Pastva, Van-Giang Trinh
We present BAss (BDD-based ADF symbolic solver), a novel analysis tool for Abstract Dialectical Frameworks (ADFs) based on Binary Decision Diagrams (BDDs). It supports the fully sy…
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…
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…
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…
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…
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…