<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=lisp">
  <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=lisp]]></link>
  <description><![CDATA[UMBC ebiquity RSS Tag Search for lisp]]></description>
  <items>
    <rdf:Seq>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/231/History-State-of-the-Art-and-Challenges-for-Agent-Communication-Languages"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/570/Using-Automatic-Memoization-as-a-Software-Engineering-Tool-in-Real-World-AI-Systems"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/1085/Understanding-Frame-Languages"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/834/Using-Spreading-Activation-to-Identify-Relevant-Help"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/738/Translating-KL-One-from-interlisp-to-Franzlisp"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/754/Augmenting-ATNs"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/1008/An-Interpreter-and-Compiler-for-Augmented-Transition-Networks"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/1025/Different-Fringe-for-Different-Folk"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/1159/Tracking-Wires-on-Printed-Circuit-Boards"/>
    </rdf:Seq>
  </items>
 </channel>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/231/History-State-of-the-Art-and-Challenges-for-Agent-Communication-Languages">
  <title><![CDATA[History, State of the Art and Challenges for Agent Communication Languages]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/231/History-State-of-the-Art-and-Challenges-for-Agent-Communication-Languages</link>
  <description><![CDATA[Knowledge Query and Manipulation Language (KQML) is a language of typed messages, usually understood as speech-acts, encoded as ASCII strings (in a LISP-like syntax), that are transported over TCP/IP connections, and aimed at knowledge and information exchange between software systems that are viewed as Virtual Knowledge Bases. KQML, which first appeared almost 10 years ago, has come to define the concept of an ACL and in the process the ACL has become the centerpiece of a large category of a...]]></description>
  <dc:date>2000-01-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/570/Using-Automatic-Memoization-as-a-Software-Engineering-Tool-in-Real-World-AI-Systems">
  <title><![CDATA[Using Automatic Memoization as a Software Engineering Tool in Real-World AI Systems]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/570/Using-Automatic-Memoization-as-a-Software-Engineering-Tool-in-Real-World-AI-Systems</link>
  <description><![CDATA[Memo functions and memoization are well-known concepts in AI programming. They have been discussed since the sixties and are often used as examples in introductory programming texts. However, the automation of memoization as a practical software engineering tool for AI systems has not received a detailed treatment. This paper describes how automatic memoization can be made viable on a large scale. It points out advantages and uses of automatic memoization not previously described, identifies ...]]></description>
  <dc:date>1995-02-20</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/1085/Understanding-Frame-Languages">
  <title><![CDATA[Understanding Frame Languages]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/1085/Understanding-Frame-Languages</link>
  <description><![CDATA[Knowledge representation is fundamental to AI. Over the past 25 years, many special-purpose languages have been developed to represent knowledge in AI systems. Frame-based representation languages (FBRLs) form a widely popular class. In part one of this article, we discuss the concepts underlying frame-based representation languages and introduce a particular language, PFL (Pedagogical Frame Language). In part two, we give a functional description of PFL, discuss implementation issues, and ex...]]></description>
  <dc:date>1986-10-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/834/Using-Spreading-Activation-to-Identify-Relevant-Help">
  <title><![CDATA[Using Spreading Activation to Identify Relevant Help]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/834/Using-Spreading-Activation-to-Identify-Relevant-Help</link>
  <description><![CDATA[Online assistance programs should have the ability to fulfill complex requests for information.  We have built an assistance program for the Franz Lisp programming language in which users can enter multiple keyword queries in an unstructured form. The keywords are mapped into the semantic network database, and spreading activation is used to determine the object to be retrieved. A many-to-many mapping between keywords and topics permits familiar words to refer to potentially unfamiliar and di...]]></description>
  <dc:date>1984-05-15</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/738/Translating-KL-One-from-interlisp-to-Franzlisp">
  <title><![CDATA[Translating KL-One from interlisp to Franzlisp]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/738/Translating-KL-One-from-interlisp-to-Franzlisp</link>
  <description><![CDATA[We describe an effort to translate the Interlisp KL-ONE system into Franzlisp to enable it to be run on a VAX . This effort has involved Tim Finin, Richard Duncan and Hassan Ait-Kaci from the University of Pennsylvania, Judy Weiner from Temple University, Jane Barnett from Computer Corporation of America and Jim Schmolze from Bolt Beranek and Newman. The primary motivation for this project was to make a version of KL-ONE available on a PDP 1 1/780 VAX . A VAX Interlisp is not yet available, a...]]></description>
  <dc:date>1982-06-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/754/Augmenting-ATNs">
  <title><![CDATA[Augmenting ATNs]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/754/Augmenting-ATNs</link>
  <description><![CDATA[Augmented Transition Networks have become a popular and effective tool for constructing natural language understanding systems. Our own system, PLANES, is based on a large “semantic grammar” which is implemented as an ATN network. In developing our system, we were frustrated by numerous problems and shortcomings in the basic ATN formalism. Consequently, we have augmented and extended the model to overcome some of these problems. We have also developed an optimizing compiler for ATN networ...]]></description>
  <dc:date>1977-08-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/1008/An-Interpreter-and-Compiler-for-Augmented-Transition-Networks">
  <title><![CDATA[An Interpreter and Compiler for Augmented Transition Networks]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/1008/An-Interpreter-and-Compiler-for-Augmented-Transition-Networks</link>
  <description><![CDATA[This thesis is intended to both document the implementation of the ATN Augmented Transition Networks interpreter and compiler and to serve as a manual for anyone interested in using it. Chapter II gives a brief description of ATNs and discusses some of the high-level design considerations. Chapter III describes the interpreter and the auxiliary functions available to the user in some detail. Chapter IV presents the compiler which can translate ATN networks into LISP code or machine language i...]]></description>
  <dc:date>1977-07-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/1025/Different-Fringe-for-Different-Folk">
  <title><![CDATA[Different Fringe for Different Folk]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/1025/Different-Fringe-for-Different-Folk</link>
  <description><![CDATA[As Greussay has pointed out, the SAMEFRINGE problem has been notoriously overused as a justification for coroutines. However, the "ordinary LISP" solution he offers is unnecessarily inefficient in both time and space.]]></description>
  <dc:date>1976-11-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/1159/Tracking-Wires-on-Printed-Circuit-Boards">
  <title><![CDATA[Tracking Wires on Printed Circuit Boards]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/1159/Tracking-Wires-on-Printed-Circuit-Boards</link>
  <description><![CDATA[This working paper describes a collection of LISP programs written to examine the backs of printed circuit boards. These programs find and trace the conductive wires plated on the insulating material. The "pads", or solder connections between these plated wires and leads from components on the front of the board, are also recognized and located by these programs.]]></description>
  <dc:date>1973-10-01</dc:date>
 </item>
</rdf:RDF>
