<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//tag/html/ruleml/?t=ruleml">
  <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//tag/html/ruleml/?t=ruleml]]></link>
  <description><![CDATA[UMBC ebiquity RSS Tag Search for ruleml]]></description>
  <items>
    <rdf:Seq>
      <rdf:li resource="http://ebiquity.umbc.edu/event/html/id/56/Sashi-Presentation-ebiquity-meeting-08-Sep-2004-"/>
      <rdf:li resource="http://ebiquity.umbc.edu/getnews/html/id/34/SweetRules-v2-1-released"/>
      <rdf:li resource="http://ebiquity.umbc.edu/project/html/id/60/SweetRules"/>
      <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/309/SweetJess-Inferencing-in-Situated-Courteous-RuleML-via-Translation-to-and-from-Jess-Rules"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/103/SweetJess-Translating-DamlRuleML-to-Jess"/>
      <rdf:li resource="http://ebiquity.umbc.edu/resource/html/id/72/Rei-and-RUles"/>
    </rdf:Seq>
  </items>
 </channel>
 <item rdf:about="http://ebiquity.umbc.edu/event/html/id/56/Sashi-Presentation-ebiquity-meeting-08-Sep-2004-">
  <title><![CDATA[Sashi Presentation (ebiquity meeting 08 Sep 2004)]]></title>
  <link>http://ebiquity.umbc.edu/event/html/id/56/Sashi-Presentation-ebiquity-meeting-08-Sep-2004-</link>
  <description><![CDATA[Shashi will talk about
the work he is doing to develop translators and execution
environments for RuleML and SWRL.]]></description>
  <dc:date>2004-09-08</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/getnews/html/id/34/SweetRules-v2-1-released">
  <title><![CDATA[SweetRules v2.1 released]]></title>
  <link>http://ebiquity.umbc.edu/getnews/html/id/34/SweetRules-v2-1-released</link>
  <description><![CDATA[First Platform for Semantic Web Rules Now Includes Web Services 
Support and More:  SweetRules V2.1 Released Open Source
 

Contacts: Chitro Neogy (chitro@mit.edu) and Benjamin Grosof (bgrosof@mit.edu)
 
CAMBRIDGE, MA, USA, April 25:  
 
SweetRules, a uniquely powerful integrated set of tools for semantic
web rules and ontologies, is newly enhanced in V2.1 with several
first-of-a-kind capabilities, including support for rule-triggered
WSDL Web Services, RuleML presentation syntax f...]]></description>
  <dc:date>2005-04-25</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/project/html/id/60/SweetRules">
  <title><![CDATA[SweetRules]]></title>
  <link>http://ebiquity.umbc.edu/project/html/id/60/SweetRules</link>
  <description><![CDATA[SweetRules is a pluggable set of rules tools for RuleML and SWRL featuring: interoperability between Prolog, production rules, OWL, CommonRules, Jena-2, and several other languages; and inferencing with negation, priorities, and procedural attachments.]]></description>
  <dc:date>2003-12-01</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/309/SweetJess-Inferencing-in-Situated-Courteous-RuleML-via-Translation-to-and-from-Jess-Rules">
  <title><![CDATA[SweetJess: Inferencing in Situated Courteous RuleML via Translation to and from Jess Rules]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/309/SweetJess-Inferencing-in-Situated-Courteous-RuleML-via-Translation-to-and-from-Jess-Rules</link>
  <description><![CDATA[We describe the innovative design of our prototyped SweetJess tool for RuleML inferencing. Our first contribution is to give a new, implemented translation from a broad but restricted case of SCLP RuleML into Jess rules, and an inverse translation from a broad but further restricted case of Jess rules into SCLP RuleML. SCLP stands for the Situated Courteous Logic Programs knowledge representation; this is expressively powerful and features prioritized conflict handling and procedural attachme...]]></description>
  <dc:date>2003-05-02</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/103/SweetJess-Translating-DamlRuleML-to-Jess">
  <title><![CDATA[SweetJess: Translating DamlRuleML to Jess]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/103/SweetJess-Translating-DamlRuleML-to-Jess</link>
  <description><![CDATA[We describe the design of SweetJess, our new system for Semantic Web rules in Jess. The SweetJess approach makes four main new contributions. First, we show how to translate from rules in the Situated Courteous Logic Programs (SCLP) knowledge representation, syntactically encoded in RuleML, into Jess rules, and likewise to translate from a broad but restricted case of Jess rules into SCLP RuleML. SCLP is expressively powerful and features prioritized conflict handling and procedural attachmen...]]></description>
  <dc:date>2002-06-24</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/resource/html/id/72/Rei-and-RUles">
  <title><![CDATA[Rei and RUles]]></title>
  <link>http://ebiquity.umbc.edu/resource/html/id/72/Rei-and-RUles</link>
  <description><![CDATA[A short overview of Rei and the opportunities to revise it now that SWRL and RuleML are available.]]></description>
  <dc:date>2004-12-01</dc:date>
 </item>
</rdf:RDF>
