<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.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-09-20T06:43:56Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/72095" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/72095</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Frisch, Alan M.</dc:contributor>
          <dc:creator>Page, Charles David, Jr.</dc:creator>
          <dc:date>2014-12-17T20:00:46Z</dc:date>
          <dc:date>2014-12-17T20:00:46Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>1993</dc:date>
          <dc:date>1993</dc:date>
          <dc:description>Unification is central to automated reasoning. Unification comes in a variety of forms, all of which compute (roughly stated) the greatest lower bound, or all maximal lower bounds, of any two or more syntactic objects in a partially-ordered set of such objects. The dual of unification is an operation called generalization, or anti-unification, which computes least or minimal upper bounds. As with unification, anti-unification comes in a variety of forms. The thesis of this dissertation is: anti-unification in its various forms is, like unification, a powerful tool for automated reasoning. In defense of the thesis, several forms of anti-unification in constraint logic, anti-unification relative to background information, are defined, and their semantic and computational properties are studied. It is shown that these forms of anti-unification are applicable to inductive logic programming (inductive learning of logic programs), speed-up learning, and knowledge base vivification (an approach to efficient deduction).</dc:description>
          <dc:description>Made available in DSpace on 2014-12-17T20:00:46Z (GMT). No. of bitstreams: 1
9411741.pdf: 9771858 bytes, checksum: 732c272ca669c64bc33aadaa87f4794d (MD5)
  Previous issue date: 1993</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 72263
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>209 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/72095</dc:identifier>
          <dc:identifier>(UMI)AAI9411741</dc:identifier>
          <dc:subject>Artificial Intelligence</dc:subject>
          <dc:subject>Computer Science</dc:subject>
          <dc:title>Anti-Unification in Constraint Logics: Foundations and Applications to Learnability in First-Order Logic, to Speed-Up Learning, and to Deduction</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
