<?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:54:12Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/4044" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/4044</identifier><datestamp>2017-03-21T16:32:18Z</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="9dbfdb68-122c-4e97-977c-716f062273b8" confidence="600">Unel, Gulay</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-09-25T18:34:03Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-09-25T18:34:03Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2008-09-25T18:34:03Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2008</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/4044</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We outline a novel technique that maps the satisfiability problems of&#xd;
second-order logics, in particular WSnS (weak monadic second-order&#xd;
logic with n successors), S1S (monadic second-order logic with one&#xd;
successor), and of μ-calculus, to the problem of query evaluation&#xd;
of Complex-value Datalog queries. In this dissertation, we propose&#xd;
techniques that use database evaluation and optimization techniques&#xd;
for automata-based decision procedures for the above logics. We show&#xd;
how the use of advanced implementation techniques for Deductive&#xd;
databases and for Logic Programs, in particular the use of tabling,&#xd;
yields a considerable improvement in performance over more traditional&#xd;
approaches. We also explore various optimizations of the proposed&#xd;
technique, in particular we consider variants of tabling and goal&#xd;
reordering.  We then show that the decision problem for S1S can be&#xd;
mapped to the problem of query evaluation of&#xd;
Complex-value Datalog queries.  &#xd;
We explore optimizations that&#xd;
can be applied to various types of formulas. Last, we propose&#xd;
analogous techniques that allow us to approach μ-calculus&#xd;
satisfiability problem in an incremental fashion and without the need&#xd;
for re-computation. In addition, we outline a top-down evaluation&#xd;
technique to drive our incremental procedure and propose heuristics&#xd;
that guide the problem partitioning to reduce the size of the problems&#xd;
that need to be solved.</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">Automata</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Logics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Database</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Query Evaluation</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Deciding Second-order Logics using Database Evaluation Techniques</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral 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">Doctor of Philosophy</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>