<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T09:34:13Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/6941" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/6941</identifier><datestamp>2017-03-21T20:45:53Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="ce3c0658-9c3e-4b83-b6b2-97b7b86c16ac" confidence="600">Pisanov, Vladimir</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2012-08-30T18:55:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2012-08-30T18:55:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2012-08-30T18:55:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2012</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/6941</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Boolean Satisfiability (SAT) is a fundamental NP-complete problem of determining whether there exists an assignment of variables which&#xd;
makes a Boolean formula evaluate to True. SAT is a convenient representation for many naturally occurring optimization and decisions problems &#xd;
such as planning and circuit verification. SAT is most commonly solved by a form of backtracking search which systematically explores the space of possible&#xd;
variable assignments.&#xd;
We show that the order in which variable polarities are assigned&#xd;
can have a significant impact on the performance of backtracking algorithms.&#xd;
	We present several ways of transforming SAT instances into non-linear objective functions and describe three value-ordering methods based on iterative optimization techniques. We implement and test these heuristics in the widely-recognized MiniSAT framework.&#xd;
	The first approach determines polarities by applying Newton&amp;apos;s Method to a sparse system of non-linear objective functions whose roots correspond to the satisfying assignments of the propositional formula.&#xd;
	The second approach determines polarities by minimizing an objective function corresponding to the number of clauses&#xd;
conflicting with each assignment.&#xd;
	The third approach determines preferred polarities by performing stochastic&#xd;
gradient descent on objective functions sampled from a family of continuous potentials.	&#xd;
	The heuristics are evaluated on a set of standard benchmarks including random, crafted and industrial problems. We compare our results to five existing heuristics, and show that MiniSAT equipped with our heuristics often outperforms state-of-the-art SAT solvers.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Boolean satisfiability</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">SAT</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Backtracking search</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Value ordering</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>