FOL RuleML: The First-Order Logic Web Langague

AuthorSearch for: ; Search for: ; Search for: ; Search for: ; Search for: ; Search for:
TypeBook Chapter
AbstractThis paper describes First-Order Logic RuleML (FOL RuleML), which is planned to be the FOL sublanguage of RuleML 0.9, the rule component of SWRL FOL, and an FOL content language for SWSI. FOL RuleML is based on a modular combination of two syntactically characterized sublanguages: (1) Quantifier RuleML extends RuleML 0.87 by explicit quantifiers. (2) Disjunctive RuleML extends RuleML 0.87 by head disjunctions. Connectives for equivalence and negation are then modularly added for defining FOL RuleML. Its DTD is available for validation tests. Classical FOL model theory provides the semantics of FOL RuleML. FOL RuleML formulas can be used as the declarative content of KQML-like performatives 'Assert' and 'Query', which are augmented by a neutral 'Consider' performative.
Publication date
LanguageEnglish
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number48061
NPARC number5764685
Export citationExport as RIS
Report a correctionReport a correction
Record identifierad6b57cc-c891-4598-a9ff-75a24d4a5c3a
Record created2009-03-29
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)