Public Member Functions | Public Attributes
Clasp::SolverParams Struct Reference

Parameter-Object for configuring a solver. More...

#include <solver_strategies.h>

Inheritance diagram for Clasp::SolverParams:
Inheritance graph
[legend]

List of all members.

Public Member Functions

uint32 prepare ()
 SolverParams ()

Public Attributes

uint32 berkHuang: 1
uint32 berkOnce: 1
uint32 ccMinRec: 1
uint32 domMod: 3
uint32 domPref: 6
uint32 dropLearnt: 2
uint32 heuId: 3
uint32 heuMoms: 1
uint32 heuOther: 2
uint32 heuParam: 16
uint32 heuReinit: 1
uint32 lookOps: 16
uint32 lookType: 2
uint32 loopRep: 2
uint32 optStrat: 3
uint32 reserved: 3
uint32 seed
uint32 unitNant: 1

Detailed Description

Parameter-Object for configuring a solver.

Definition at line 166 of file solver_strategies.h.


Constructor & Destructor Documentation

Definition at line 50 of file solver_strategies.cpp.


Member Function Documentation

Reimplemented from Clasp::SolverStrategies.

Definition at line 58 of file solver_strategies.cpp.


Member Data Documentation

Only for Berkmin.

Definition at line 179 of file solver_strategies.h.

Only for Berkmin.

Definition at line 180 of file solver_strategies.h.

If 1, use more expensive recursive nogood minimization.

Definition at line 184 of file solver_strategies.h.

Only for domain heuristic.

Definition at line 187 of file solver_strategies.h.

Only for domain heuristic.

Definition at line 186 of file solver_strategies.h.

Forget learnt 1=nogood scores 2=ngoods on problem update.

Definition at line 185 of file solver_strategies.h.

Type of decision heuristic.

Definition at line 175 of file solver_strategies.h.

Use MOMS-score as top-level heuristic.

Definition at line 178 of file solver_strategies.h.

Consider other learnt nogoods in heuristic (0=no, 1=loops, 2=all, 3=let heuristic decide).

Definition at line 176 of file solver_strategies.h.

Extra parameter for heuristic with meaning depending on type

Definition at line 171 of file solver_strategies.h.

Force reinitialization of heuristic in incremental setting.

Definition at line 177 of file solver_strategies.h.

Max. number of lookahead operations (0: no limit).

Definition at line 172 of file solver_strategies.h.

Type of lookahead operations.

Definition at line 182 of file solver_strategies.h.

How to represent loops?

Definition at line 183 of file solver_strategies.h.

Optimization strategy.

Definition at line 174 of file solver_strategies.h.

Definition at line 188 of file solver_strategies.h.

Seed for the random number generator.

Definition at line 169 of file solver_strategies.h.

Only for unit.

Definition at line 181 of file solver_strategies.h.


The documentation for this struct was generated from the following files:


clasp
Author(s): Benjamin Kaufmann
autogenerated on Thu Aug 27 2015 12:41:41