Difference between revisions of "ApCoCoA-1:SAT.ConvertToCNF"
From ApCoCoAWiki
m (replaced <quotes> tag by real quotes) |
|||
| (4 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
| + | {{Version|1|[[Package sat/SAT.ConvertToCNF]]}} | ||
<command> | <command> | ||
<title>SAT.ConvertToCNF</title> | <title>SAT.ConvertToCNF</title> | ||
| Line 11: | Line 12: | ||
<item>@param <em>SPE</em>: A List containing the polynomial equations of the system.</item> | <item>@param <em>SPE</em>: A List containing the polynomial equations of the system.</item> | ||
<item>@param <em>CuttingNumber</em>: Maximal support-length of the linear polynomials when their corresponding CNF is written to the file. Could be 3 - 6. </item> | <item>@param <em>CuttingNumber</em>: Maximal support-length of the linear polynomials when their corresponding CNF is written to the file. Could be 3 - 6. </item> | ||
| − | <item>@param <em>QStrategy</em>: Strategy for quadratic substitution. 0 - Standard; 1 - Linear Partner; 2 - Adv. Lin. Partner; | + | <item>@param <em>QStrategy</em>: Strategy for quadratic substitution. 0 - Standard; 1 - Linear Partner; 2 - Adv. Lin. Partner;</item> |
<item>@param <em>CStrategy</em>: Strategy for cubic substitution. 0 - Standard; 1 - Quadratic Partner;</item> | <item>@param <em>CStrategy</em>: Strategy for cubic substitution. 0 - Standard; 1 - Quadratic Partner;</item> | ||
</itemize> | </itemize> | ||
| Line 23: | Line 24: | ||
SPE:=[F1,F2,F3]; | SPE:=[F1,F2,F3]; | ||
SAT.ConvertToCNF(SPE,4,0,0); | SAT.ConvertToCNF(SPE,4,0,0); | ||
| − | SAT.LaunchMiniSat( | + | SAT.LaunchMiniSat("sat.cnf"); |
SAT.GetResult(); | SAT.GetResult(); | ||
--Result: [0,1,0] Test with: Eval(SPE,[0,1,0]); | --Result: [0,1,0] Test with: Eval(SPE,[0,1,0]); | ||
| Line 36: | Line 37: | ||
SPE:=[F1,F2,F3]; | SPE:=[F1,F2,F3]; | ||
SAT.ConvertToCNF(SPE,4,0,0); | SAT.ConvertToCNF(SPE,4,0,0); | ||
| − | SAT.LaunchMiniSat( | + | SAT.LaunchMiniSat("sat.cnf"); |
SAT.GetResult(); | SAT.GetResult(); | ||
--Result: [0,0,1] Test with: Eval(SPE,[0,0,1]); | --Result: [0,0,1] Test with: Eval(SPE,[0,0,1]); | ||
| Line 50: | Line 51: | ||
<key>SAT.ConvertToCNF</key> | <key>SAT.ConvertToCNF</key> | ||
<key>ConvertToCNF</key> | <key>ConvertToCNF</key> | ||
| − | <wiki-category>Package_sat</wiki-category> | + | <wiki-category>ApCoCoA-1:Package_sat</wiki-category> |
</command> | </command> | ||
Latest revision as of 13:49, 29 October 2020
| This article is about a function from ApCoCoA-1. If you are looking for the ApCoCoA-2 version of it, see Package sat/SAT.ConvertToCNF. |
SAT.ConvertToCNF
Converts a given quadratic (cubic) system of polynomial equations (SPE) over GF(2) to CNF. Writes the CNF to the file sat.cnf
Syntax
SAT.ConvertToCNF(SPE:LIST, CuttingNumber:INT, QStrategy:INT, CStrategy:INT)
Description
This function starts the conversion algorithm.
@param SPE: A List containing the polynomial equations of the system.
@param CuttingNumber: Maximal support-length of the linear polynomials when their corresponding CNF is written to the file. Could be 3 - 6.
@param QStrategy: Strategy for quadratic substitution. 0 - Standard; 1 - Linear Partner; 2 - Adv. Lin. Partner;
@param CStrategy: Strategy for cubic substitution. 0 - Standard; 1 - Quadratic Partner;
Example
-- quadratic system:
Use R::=ZZ/(2)[x[1..3]];
F1:= x[1]x[2] + x[1]x[3] + x[2]x[3] + x[3];
F2:= x[2] + 1;
F3:= x[1]x[2] + x[3];
SPE:=[F1,F2,F3];
SAT.ConvertToCNF(SPE,4,0,0);
SAT.LaunchMiniSat("sat.cnf");
SAT.GetResult();
--Result: [0,1,0] Test with: Eval(SPE,[0,1,0]);
Example
-- cubic system:
Use ZZ/(2)[x[1..3]];
F1:=x[1]x[2]x[3] + x[1]x[2] + x[2]x[3] + x[1] + x[3] +1;
F2:=x[1]x[2]x[3] + x[1]x[2] + x[2]x[3] + x[1] + x[2];
F3:=x[1]x[2] + x[2]x[3] + x[2];
SPE:=[F1,F2,F3];
SAT.ConvertToCNF(SPE,4,0,0);
SAT.LaunchMiniSat("sat.cnf");
SAT.GetResult();
--Result: [0,0,1] Test with: Eval(SPE,[0,0,1]);
