P. Barth. A complete symbolic 0-1 constraint solver. In 3rd Workshop on Constraint Logic Programming, WCLP'93, Marseille, March 1993. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Cutting Planes in Constraint Logic Programming - Bockmayr (1994) (2 citations) Self-citation (Barth) (Correct)
....but some coefficients of the left hand side are different from 0 and 1. The second description consists of seven extended clauses, that is inequalities of the form L 1 Delta Delta Delta Lm k, which express that at least k out of m literals L 1 ; Lm have to be true [Hoo92] In [Bar93a, Bar93b] a constraint solver for 0 1 constraints is presented that computes for a given linear 0 1 inequality an equivalent set of prime extended clauses. Given a set of prime extended clauses (S) for a 0 1 set S, testing solvability and entailment becomes very easy. The set (S) however, may be ....
P. Barth. A complete symbolic 0-1 constraint solver. In 3rd Workshop on Constraint Logic Programming, WCLP'93, Marseille, March 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC