- From: Boley, Harold <Harold.Boley@nrc-cnrc.gc.ca>
- Date: Sun, 14 Nov 2004 18:27:48 -0500
- To: "'ruleml-all@ruleml.org'" <ruleml-all@ruleml.org>, joint-committee@daml.org, swsl-committee@daml.org, daml-all@daml.org, www-rdf-rules@w3.org, www-rdf-logic@w3.org, seweb-list@www1-c703.uibk.ac.at
The FOL RuleML <http://www.ruleml.org/fol> language has been released as a result of the collaboration between the RuleML Steering Committee <http://www.ruleml.org/#Structure> and the Joint Committee <http://www.daml.org/committee>, with input from SCL <http://philebus.tamu.edu/mailman/listinfo/scl>: http://www.ruleml.org/#FOL FOL RuleML shares/reuses much of the earlier RuleML LP syntax, incorporating First-Order-Logic quantifiers and disjunctions as well as equivalence and negation. The language adheres to a strict separation of declarative content from procedural (Assert, Query) performatives, as pioneered by KQML. This and further changes to RuleML 0.87 <http://www.ruleml.org/0.87> will also benefit other sublanguages towards RuleML 0.9, in particular the Horn logic subset. FOL RuleML is providing the rule component for the parallel SWRL FOL release <http://www.daml.org/2004/11/fol> and is a proposed FOL content language for SWSI <http://www.swsi.org>. It can be regarded as a generalization of SWRL FOL in that it provides markup for full FOL, with n-ary relations (predicate symbols) and n-ary constructors (logical function symbols). Please direct comments to www-rdf-rules@w3.org. -- Harold
Received on Sunday, 14 November 2004 23:28:21 UTC