2 citations · 4 across the 3 of their papers we have counts for
6 papers
Reasoning on Feature Models: Compilation-Based vs. Direct Approaches
Pierre Bourhis, Laurence Duchien, Jérémie Dusart +3
Analyzing a Feature Model (FM) and reasoning on the corresponding configuration space is a central task in Software Product Line (SPL) engineering. Problems such as deciding the sa…
Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits
Pierre Bourhis, Laurence Duchien, Jérémie Dusart +3
We are interested in computing most preferred models of a given d-DNNF circuit , where the preference relation is based on an algebraic structure called a monotone, totally…
Semi Automatic Construction of ShEx and SHACL Schemas
Iovka Boneva, Jérémie Dusart, Daniel Fernández Álvarez +1
We present a method for the construction of SHACL or ShEx constraints for an existing RDF dataset. It has two components that are used conjointly: an algorithm for automatic schema…
Submodular Goal Value of Boolean Functions
Eric Bach, Jeremie Dusart, Lisa Hellerstein +1
Recently, Deshpande et al. introduced a new measure of the complexity of a Boolean function. We call this measure the "goal value" of the function. The goal value of is defined…
Maximal cliques structure for cocomparability graphs and applications
Jérémie Dusart, Michel Habib, Derek G. Corneil
A cocomparability graph is a graph whose complement admits a transitive orientation. An interval graph is the intersection graph of a family of intervals on the real line. In this…
A tie-break model for graph search
Derek G. Corneil, Jeremie Dusart, Michel Habib +1
In this paper, we consider the problem of the recognition of various kinds of orderings produced by graph searches. To this aim, we introduce a new framework, the Tie-Breaking Labe…