org.sat4j.minisat.constraints
Class MixedDataStructureDanielWL
java.lang.Object
   org.sat4j.minisat.constraints.AbstractDataStructureFactory
org.sat4j.minisat.constraints.AbstractDataStructureFactory
       org.sat4j.minisat.constraints.MixedDataStructureDanielWL
org.sat4j.minisat.constraints.MixedDataStructureDanielWL
- All Implemented Interfaces: 
- Serializable, DataStructureFactory
- public class MixedDataStructureDanielWL 
- extends AbstractDataStructureFactory
- Since:
- 2.1
- Author:
- leberre
- See Also:
- Serialized Form
 
 
 
 
 
| Methods inherited from class java.lang.Object | 
| clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait | 
 
MixedDataStructureDanielWL
public MixedDataStructureDanielWL()
createCardinalityConstraint
public Constr createCardinalityConstraint(IVecInt literals,
                                          int degree)
                                   throws ContradictionException
- Description copied from interface: DataStructureFactory
- Create a cardinality constraint of the form sum li >= degree.
 
- 
- Specified by:
- createCardinalityConstraintin interface- DataStructureFactory
- Overrides:
- createCardinalityConstraintin class- AbstractDataStructureFactory
 
- 
- Parameters:
- literals- a set of literals.
- degree- the degree of the cardinality constraint.
- Returns:
- a constraint stating that at least degree literals are satisfied.
- Throws:
- ContradictionException
 
createClause
public Constr createClause(IVecInt literals)
                    throws ContradictionException
- 
- Parameters:
- literals- a set of literals using Dimacs format (signed non null
            integers).
- Returns:
- null if the constraint is a tautology.
- Throws:
- ContradictionException- the constraint is trivially unsatisfiable.
 
createUnregisteredClause
public Constr createUnregisteredClause(IVecInt literals)
- 
 
createLits
protected ILits createLits()
- 
- Specified by:
- createLitsin class- AbstractDataStructureFactory
 
- 
 
Copyright © 2011 Centre de Recherche en Informatique de Lens (CRIL). All Rights Reserved.