<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=logic+programming">
  <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=logic+programming]]></link>
  <description><![CDATA[UMBC ebiquity RSS Tag Search for logic programming]]></description>
  <items>
    <rdf:Seq>
      <rdf:li resource="http://ebiquity.umbc.edu/event/html/id/278/Reverse-engineering-RBAC-policies-using-ILP"/>
      <rdf:li resource="http://ebiquity.umbc.edu/project/html/id/21/Semantic-Service-Discovery-in-Bluetooth"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/274/Rule-based-and-Ontology-based-Policies-Toward-a-Hybrid-Approach-to-Control-Agents-in-Pervasive-Environments"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/250/Extending-the-Non-monotonic-Reasoning-Infrastructure-for-the-Semantic-Web-via-Well-founded-Negation-and-incremental-Support-for-Courteous-Logic-Programs-"/>
      <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/682/Adding-forward-chaining-and-truth-maintenance-to-Prolog"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/899/A-Hierarchical-Database-Model-for-a-Logic-Programming-Language"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/1072/A-Hierarchical-Database-Model-for-a-Logic-Programming-Language"/>
      <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/event/html/id/278/Reverse-engineering-RBAC-policies-using-ILP">
  <title><![CDATA[Reverse engineering RBAC policies using ILP]]></title>
  <link>http://ebiquity.umbc.edu/event/html/id/278/Reverse-engineering-RBAC-policies-using-ILP</link>
  <description><![CDATA[RBAC (Role Based Access Control [1]) is a predominant model used for
advanced access control. A variety of IT vendors have provided RBAC
implementations in their systems. RBAC provides great flexibility and
breadth of application. System administrators can control access at
a level of abstraction that is natural to the way that enterprises
typically conduct business. These features of RBAC make it suitable
for deployment over a variety of web applications like social
networks, academic...]]></description>
  <dc:date>2008-12-02</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/project/html/id/21/Semantic-Service-Discovery-in-Bluetooth">
  <title><![CDATA[Semantic Service Discovery in Bluetooth]]></title>
  <link>http://ebiquity.umbc.edu/project/html/id/21/Semantic-Service-Discovery-in-Bluetooth</link>
  <description><![CDATA[Bluetooth Service Discovery Protocol (SDP) enables a client application on
a device to discover information about services on other Bluetooth
devices. Every service is represented by a profile that is identified by a
128-bit Universally Unique Identifier (UUID). Attributes associated with a
particular service are also identified by UUIDs. Service discovery
requests, sent by the client, must contain one or more UUIDs. A match
occurs on a peer device if and only if at least one UU...]]></description>
  <dc:date>2000-12-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/274/Rule-based-and-Ontology-based-Policies-Toward-a-Hybrid-Approach-to-Control-Agents-in-Pervasive-Environments">
  <title><![CDATA[Rule-based and Ontology-based Policies: Toward a Hybrid Approach to Control Agents in Pervasive Environments]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/274/Rule-based-and-Ontology-based-Policies-Toward-a-Hybrid-Approach-to-Control-Agents-in-Pervasive-Environments</link>
  <description><![CDATA[Policies are being increasingly used for controlling the behavior of
complex multi-agent systems. The use of policies allows administrators to regulate
agent behavior without changing source code or requiring the consent or
cooperation of the agents being governed. However, policy-based control can
sometimes encounter difficulties when applied to agents that act in pervasive
environments characterized by frequent and unpredictable changes. In such cases,
we cannot always specify policie...]]></description>
  <dc:date>2005-11-07</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/250/Extending-the-Non-monotonic-Reasoning-Infrastructure-for-the-Semantic-Web-via-Well-founded-Negation-and-incremental-Support-for-Courteous-Logic-Programs-">
  <title><![CDATA[Extending the Non-monotonic Reasoning Infrastructure for the Semantic Web via Well-founded Negation and incremental Support for Courteous Logic Programs,]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/250/Extending-the-Non-monotonic-Reasoning-Infrastructure-for-the-Semantic-Web-via-Well-founded-Negation-and-incremental-Support-for-Courteous-Logic-Programs-</link>
  <description><![CDATA[Production Rules, Description Logic (DL) and Logic Programs(LP) are the key paradigms of knowledge representation. Production rules systems (particularly the JESS rule engine) are based on the Rete network and primarily support forward inferencing. However, they do not have proper semantics for negation.

The Web Ontology Language (OWL) is based on description logic and cannot express rules. Several extensions to OWL including the OWL Rules Language(ORL), Semantic Web Rule Language(SWRL)hav...]]></description>
  <dc:date>2005-08-01</dc:date>
 </item>
 <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 one global knowledge base, as is the case with Prolog, we allow segmentation into units that are 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. Retractin...]]></description>
  <dc:date>1991-03-28</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/682/Adding-forward-chaining-and-truth-maintenance-to-Prolog">
  <title><![CDATA[Adding forward chaining and truth maintenance to Prolog]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/682/Adding-forward-chaining-and-truth-maintenance-to-Prolog</link>
  <description><![CDATA[This paper describes Pfc, a simple package that supplies a forward chaining facility in Prolog. Pfc is intended to be used in conjunction with ordinary Prolog programs, allowing the programmer to decide whether to encode a rule as a forward-chaining Pfc rule or a backward-chaining Prolog one. Like other logic programming languages, Pfc programs have a declarative interpretation as well as a clear and predictable procedural one. A truth maintenance system is built into the Pfc system, which ma...]]></description>
  <dc:date>1989-03-06</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/899/A-Hierarchical-Database-Model-for-a-Logic-Programming-Language">
  <title><![CDATA[A Hierarchical Database Model for a Logic Programming Language]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/899/A-Hierarchical-Database-Model-for-a-Logic-Programming-Language</link>
  <description><![CDATA[This paper presents an extended Clausal Database Model for a logic programming language. Instead of being restricted to one global database, as is the case with Prolog, we allow segmentation of the database into database units which are linked together into a semi-lattice. Each database unit defines a database view which includes clauses which have been asserted into that unit as well as clauses inherited from its ancestors higher in the lattice structure. This model supports arbitrary retrac...]]></description>
  <dc:date>1988-03-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/1072/A-Hierarchical-Database-Model-for-a-Logic-Programming-Language">
  <title><![CDATA[A Hierarchical Database Model for a Logic Programming Language]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/1072/A-Hierarchical-Database-Model-for-a-Logic-Programming-Language</link>
  <description><![CDATA[This paper presents an extended Clausal Database Model for a logic programming language. Instead of being restricted to one global database, as is the case with Prolog, we allow segmentation of the database into database units that are linked together into a semi-lattice. Each database unit defines a database view which includes 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 retracti...]]></description>
  <dc:date>1988-03-01</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>
