Update glossary with SICStus
This commit is contained in:
parent
69819d629f
commit
fb24a5dc25
2
.vscode/ltex.dictionary.en-GB.txt
vendored
2
.vscode/ltex.dictionary.en-GB.txt
vendored
@ -36,5 +36,5 @@ GBAC
|
||||
RCPSP
|
||||
Reifications
|
||||
SCIP
|
||||
Sictus
|
||||
QCP-Max
|
||||
SICStus
|
||||
|
3
.vscode/ltex.hiddenFalsePositives.en-GB.txt
vendored
3
.vscode/ltex.hiddenFalsePositives.en-GB.txt
vendored
@ -326,3 +326,6 @@
|
||||
{"rule":"PUNCTUATION_PARAGRAPH_END","sentence":"^\\QThe source code for this version can be found here: \\E(?:Dummy|Ina|Jimmy-)[0-9]+$"}
|
||||
{"rule":"TOO_LONG_SENTENCE","sentence":"^\\QThis thesis is an original work of my research and contains no material which has been accepted for the award of any other degree or diploma at any university or equivalent institution and that, to the best of my knowledge and belief, this thesis contains no material previously published or written by another person, except where due reference is made in the text of the thesis.\\E$"}
|
||||
{"rule":"PUNCTUATION_PARAGRAPH_END","sentence":"^\\QTitle State\\E$"}
|
||||
{"rule":"UPPERCASE_SENTENCE_START","sentence":"^\\Qsicstus name=SICStus Prolog, description=A well-known implementation of the Prolog \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q language and constraint modelling environment \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.,\\E$"}
|
||||
{"rule":"MORFOLOGIK_RULE_EN_GB","sentence":"^\\Qslv-mod name=solver model, description= A \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q where all Dummies and \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q types are \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for the targeted \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q.\\E$"}
|
||||
{"rule":"EN_A_VS_AN","sentence":"^\\QAn \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q of an \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q model can be rewritten by Savile Row into a \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q for a variety of Dummies, including \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q, and \\E(?:Dummy|Ina|Jimmy-)[0-9]+\\Q Dummies.\\E$"}
|
||||
|
@ -554,7 +554,6 @@
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
\newglossaryentry{propagation}{
|
||||
name={constraint propagation},
|
||||
description={The removal of values from \glspl{domain} of \glspl{variable} that violate a \gls{constraint}. See \cref{subsec:back-cp}.},
|
||||
@ -599,6 +598,11 @@
|
||||
}
|
||||
}
|
||||
|
||||
\newglossaryentry{scip}{
|
||||
name={SCIP},
|
||||
description={A well-known open source \gls{mip} \gls{solver}.},
|
||||
}
|
||||
|
||||
\newglossaryentry{slv-mod}{
|
||||
name={solver model},
|
||||
description={
|
||||
@ -607,11 +611,12 @@
|
||||
}
|
||||
}
|
||||
|
||||
\newglossaryentry{scip}{
|
||||
name={SCIP},
|
||||
description={A well-known open source \gls{mip} \gls{solver}.},
|
||||
\newglossaryentry{sicstus}{
|
||||
name={SICStus Prolog},
|
||||
description={A well-known implementation of the Prolog \gls{clp} language and constraint modelling environment \autocite{carlsson-1997-sicstus}.},
|
||||
}
|
||||
|
||||
|
||||
\newglossaryentry{term}{
|
||||
name={term},
|
||||
description={An expression in a \gls{trs}. A term can have nested sub-expressions.},
|
||||
|
Reference in New Issue
Block a user