146 citations · 154 across the 9 of their papers we have counts for
9 papers
Constraint Reductions
Olivier Bailleux, Yacine Boufkhad
This is a commentary on the CP 2003 paper "Efficient cnf encoding of boolean cardinality constraints". After recalling its context, we outline a classification of Constraints with…
Efficient Loop Detection in Forwarding Networks and Representing Atoms in a Field of Sets
Laurent Viennot, Yacine Boufkhad, Leonardo Linguaglossa +2
The problem of detecting loops in a forwarding network is known to be NP-complete when general rules such as wildcard expressions are used. Yet, network analyzer tools such as Netp…
Forwarding Tables Verification through Representative Header Sets
Yacine Boufkhad, Ricardo De La Paz, Leonardo Linguaglossa +3
Forwarding table verification consists in checking the distributed data-structure resulting from the forwarding tables of a network. A classical concern is the detection of loops.…
Second moment method for a family of boolean CSP
Yacine Boufkhad, Olivier Dubois
The estimation of phase transitions in random boolean Constraint Satisfaction Problems (CSP) is based on two fundamental tools: the first and second moment methods. While the first…
Second Moment Method on k-SAT: a General Framework
Thomas Hugel, Yacine Boufkhad
We give a general framework implementing the Second Moment Method on k-SAT and discuss the conditions making the Second Moment Method work in this framework. As applications, we ma…
Estimating Satisfiability
Yacine Boufkhad, Thomas Hugel
The problem of estimating the proportion of satisfiable instances of a given CSP (constraint satisfaction problem) can be tackled through weighting. It consists in putting onto eac…