<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:cc="http://web.resource.org/cc/"
 >
<!--
	This ontology document is licensed under the Creative Commons
	Attribution License. To view a copy of this license, visit
	http://creativecommons.org/licenses/by/2.0/ or send a letter to
	Creative Commons, 559 Nathan Abbott Way, Stanford, California
	94305, USA.
-->
 <channel rdf:about="http://ebiquity.umbc.edu//tags/html/?t=unification">
  <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
  <title><![CDATA[UMBC ebiquity RSS Tag Search]]></title>
  <link><![CDATA[http://ebiquity.umbc.edu//tags/html/?t=unification]]></link>
  <description><![CDATA[UMBC ebiquity RSS Tag Search for unification]]></description>
  <items>
    <rdf:Seq>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/1100/Inheritance-in-Logic-Programming-Knowledge-Bases"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/1140/Parsing-with-Logical-Variables"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/1096/Parsing-with-Logical-Variables"/>
    </rdf:Seq>
  </items>
 </channel>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/1100/Inheritance-in-Logic-Programming-Knowledge-Bases">
  <title><![CDATA[Inheritance in Logic Programming Knowledge Bases]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/1100/Inheritance-in-Logic-Programming-Knowledge-Bases</link>
  <description><![CDATA[This paper presents an extended model for a logic programming language's knowledge base. Instead of being restricted to a single global knowledge base, as in Prolog, we allow segmentation into units linked together into a lattice. Each unit defines a view on the knowledge base, which includes those clauses that have been asserted into that unit as well as clauses inherited from its ancestors higher in the lattice structure. This model supports arbitrary retraction. Retracting a clause in a kn...]]></description>
  <dc:date>1991-03-28</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/1140/Parsing-with-Logical-Variables">
  <title><![CDATA[Parsing with Logical Variables]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/1140/Parsing-with-Logical-Variables</link>
  <description><![CDATA[Logic based programming systems have enjoyed increasing popularity in applied AI work in the last few years. One of the contributions that the logic programming paradigm has made to computational linguistics is the Definite Clause Grammar (DCG). An excellent introduction to this formalism can be found in [9] in which the authors present the formalism and make a detailed comparison to Augmented Transition Networks (ATN) as a means of both specifying a language and parsing sentences in that lan...]]></description>
  <dc:date>1987-01-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/1096/Parsing-with-Logical-Variables">
  <title><![CDATA[Parsing with Logical Variables]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/1096/Parsing-with-Logical-Variables</link>
  <description><![CDATA[Logic-based programming systems have enjoyed increasing popularity in applied AI work in the last few years. One of the contributions to Computational Linguistics made by the Logic Programming Paradigm has been the Definite Clause Grammar. In comparing DCGs with previous parsing mechanisms such as ATNs, certain clear advantages are seen. We feel that the most important of these advantages are due to the use of Logical Variables with Unification as the fundamental operation on them. To illustr...]]></description>
  <dc:date>1983-02-01</dc:date>
 </item>
</rdf:RDF>
