7 citations
3 papers
cs.DM2008★ 2 cited
On Fan Raspaud Conjecture
Jean-Luc Fouquet, Jean-Marie Vanherpe
A conjecture of Fan and Raspaud [3] asserts that every bridgeless cubic graph con-tains three perfect matchings with empty intersection. Kaiser and Raspaud [6] sug-gested a possibl…
cs.SE2003★ 7 cited
Towards declarative diagnosis of constraint programs over finite domains
Gerard Ferrand, Willy Lesaint, Alexandre Tessier
The paper proposes a theoretical approach of the debugging of constraint programs based on a notion of explanation tree. The proposed approach is an attempt to adapt algorithmic de…
cs.SE2002★ 2 cited
Value withdrawal explanations: a theoretical tool for programming environments
Willy Lesaint
Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been efficientl…