Semantic Web Rule Language: Difference between revisions

Content deleted Content added
m Reverted edits by 194.44.7.162 (talk) to last revision by Qwertyus (HG)
No edit summary
Line 3:
The '''Semantic Web Rule Language''' ('''SWRL''') is a proposed language for the [[Semantic Web]] that can be used to express rules as well as logic, combining [[Web Ontology Language|OWL DL]] or OWL Lite with a subset of the [[RuleML|Rule Markup Language]] (itself a subset of [[Datalog]]).
 
The specification was submitted in May 2004 to the [[W3C]] by the [[National Research Council of Canada]], Network Inference (since acquired by [[webMethods]]), and [[Stanford University]] in association with the Joint US/EU ad hoc Agent Markup Language Committee. The specification was based on an earlier proposal for an OWL rules language.<ref name="Horrocks2004">{{Cite conference
| author = Ian Horrocks
| coauthors = Peter F. Patel-Schneider
| title = A Proposal for an OWL Rules Language
| booktitle = Proc. of the Thirteenth International World Wide Web Conference (WWW 2004)
| pages = 723-731
| publisher = ACM
| year = 2004
| url = http://www.cs.ox.ac.uk/people/ian.horrocks/Publications/download/2004/HoPa04a.pdf
| format = PDF
| accessdate = 2014-05-22 }}</ref>
<ref name="Horrocks2005">{{Cite journal
| author = Ian Horrocks
| coauthors = Peter F. Patel-Schneider; Sean Bechhofer; Dmitry Tsarkov
| title = OWL Rules: A Proposal and Prototype Implementation
| journal = Journal of Web Semantics
| volume = 3
| issue = 1
| pages = 23-40
| publisher = Elsevier
| year = 2005
| url = http://www.cs.ox.ac.uk/people/ian.horrocks/Publications/download/2005/HPBT05.pdf
| format = PDF
| accessdate = 2014-05-22 }}</ref>
 
SWRL has the full power of OWL DL, but at the price of decidability and practical implementations.<ref name="Parsia2005">{{Cite journal
Line 13 ⟶ 36:
| format = PDF
| accessdate = 2006-07-29 }}</ref>
However, decidability can be regained by restricting the form of admissible rules, typically by imposing a suitable safety condition.
<ref name="Motik2005">{{Cite journal
| author = Boris Motik
| coauthors = Ulrike Sattler; Rudi Studer
| title = Query Answering for OWL-DL with Rules
| journal = Journal of Web Semantics
| volume = 3
| issue = 1
| pages = 41-60
| publisher = Elsevier
| year = 2005
| url = http://www.cs.ox.ac.uk/boris.motik/pubs/mss05query-journal.pdf
| format = PDF
| accessdate = 2014-05-22 }}</ref>
 
Rules are of the form of an implication between an antecedent (body) and consequent (head). The intended meaning can be read as: whenever the conditions specified in the antecedent hold, then the conditions specified in the consequent must also hold.
Line 134 ⟶ 171:
 
==Comparison with Description Logic Programs==
[[Description Logic Programs]] (DLPs) are another proposal for integrating rules and OWL.<ref name="Grosof2003">[http://www2003.org/cdrom/papers/refereed/p117/p117-grosof.html Description Logic Programs: Combining Logic Programs with Description Logic], WWW{{Cite 2003.conference
| author = Benjamin N. Grosof
</ref> Compared with Description Logic Programs, SWRL takes a diametrically opposed integration approach. DLP is the intersection of [[Horn logic]] and OWL, whereas SWRL is (roughly) the union of them.<ref name="Parsia2005"/> In DLP, the resultant language is a very peculiar looking description logic and rather inexpressive language overall.<ref name="Parsia2005"/>
| coauthors = Ian Horrocks; Raphael Volz; Stefan Decker
| title = Description Logic Programs: Combining Logic Programs with Description Logic
| booktitle = Proc. of the Twelfth International World Wide Web Conference (WWW 2003)
| pages = 48-57
| publisher = ACM
| year = 2003
| url = http://www.cs.ox.ac.uk/people/ian.horrocks/Publications/download/2003/p117-grosof.pdf
| format = PDF
| accessdate = 2014-05-22 }}</ref>
</ref> Compared with Description Logic Programs, SWRL takes a diametrically opposed integration approach. DLP is the intersection of [[Horn logic]] and OWL, whereas SWRL is (roughly) the union of them.<ref name="Parsia2005"/> In DLP, the resultant language is a very peculiar looking description logic and rather inexpressive language overall.<ref name="Parsia2005"/>
 
== See also ==