Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Principles and Practice of Semantic Web Reasoning

PPSWR 2006: Principles and Practice of Semantic Web Reasoning pp 1–17Cite as

The RuleML Family of Web Rule Languages

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4187))

Abstract

The RuleML family of Web rule languages contains derivation (deduction) rule languages, which themselves have a webized Datalog language as their inner core. Datalog RuleML’s atomic formulas can be (un)keyed and (un)ordered. Inheriting the Datalog features, Hornlog RuleML adds functional expressions as terms. In Hornlog with equality, such uninterpreted (constructor-like) functions are complemented by interpreted (equation-defined) functions. These are described by further orthogonal dimensions “single- vs. set-valued” and “first- vs. higher-order”. Combined modal logics apply special relations as operators to atoms with an uninterpreted relation, complementing the usual interpreted ones.

Thanks to David Hirtle for creating the family’s XML Schemas, and the RuleML Steering Committee for guidance. This research was partially supported by NSERC.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barendregt, H.: The Impact of the Lambda Calculus in Logic and Computer Science. The Bulletin of Symbolic Logic 3(2), 181–215 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ball, M., Boley, H., Hirtle, D., Mei, J., Spencer, B.: The OO jDREW Reference Implementation of RuleML. In: Adi, A., Stoutenburg, S., Tabet, S. (eds.) RuleML 2005. LNCS, vol. 3791, pp. 218–223. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Bailes, P.A., Kemp, C.J.M., Peake, I., Seefried, S.: Why Functional Programming Really Matters. In: Applied Informatics, pp. 919–926 (2003)

    Google Scholar 

  4. Boley, H.: Functional-Logic Integration via Minimal Reciprocal Extensions. Theoretical Computer Science 212, 77–99 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Boley, H.: Markup Languages for Functional-Logic Programming. In: 9th International Workshop on Functional and Logic Programming, Benicassim, Spain, September 2000, pp. 391–403. UPV University Press, Valencia (2000) (publication 2000/2039)

    Google Scholar 

  6. Boley, H.: Relationships Between Logic Programming and RDF. In: Kowalczyk, R., Loke, S.W., Reed, N.E., Graham, G. (eds.) PRICAI-WS 2000. LNCS, vol. 2112, p. 201. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Boley, H.: Object-Oriented RuleML: User-Level Roles, URI-Grounded Clauses, and Order-Sorted Terms. In: Schröder, M., Wagner, G. (eds.) RuleML 2003. LNCS, vol. 2876, pp. 1–16. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Dantsin, E., Voronkov, A.: A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 180–196. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Fokoue, A., Rose, K., Siméon, J., Villard, L.: Compiling XSLT 2.0 into XQuery 1.0. In: Proceedings of the Fourteenth International World Wide Web Conference, Chiba, Japan, May 2005, pp. 682–691. ACM Press, New York (2005)

    Chapter  Google Scholar 

  10. Gabbay, D.M., Kurucz, Á., Wolter, F., Zakharyaschev, M.: Many-Dimensional Modal Logics: Theory and Applications. Elsevier, Amsterdam (2003)

    MATH  Google Scholar 

  11. Hendricks, V.F.: Mainstream and Formal Epistemology. Cambridge University Press, New York (2006)

    Google Scholar 

  12. O’Donnell, M.J.: Equational Logic as a Programming Language. MIT Press, Cambridge (1985)

    MATH  Google Scholar 

  13. Padawitz, P.: Computing in Horn Clause Theories. EATCS Monographs on Theoretical Computer Science, vol. 16. Springer, Heidelberg (1988)

    MATH  Google Scholar 

  14. Schaffert, S., Bry, F.: Querying the Web Reconsidered: A Practical Introduction to Xcerpt. In: Proceedings of Extreme Markup Languages 2004, Montreal, Quebec, Canada, August 2nd–6th (2004)

    Google Scholar 

  15. Somogy, Z., Henderson, F., Conway, T.: The Execution Algorithm of Mercury, An Efficient Purely Declarative Logic Programming Language. Journal of Logic Programming 29(1-3), 17–64 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Information Technology – e-Business, National Research Council of Canada, Fredericton, NB, E3B 9W4, Canada

    Harold Boley

Authors
  1. Harold Boley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CENTRIA, Universidade Nova de Lisboa, Portugal

    Jóse Júlio Alferes

  2. NICTA Victoria Laboratory, The University of Melbourne, Australia

    James Bailey

  3. Institut für Informatik, Universität Göttingen,  

    Wolfgang May

  4. Institut für Informatik, Universität München, Oettingenstr. 67, 80538, München, Germany

    Uta Schwertel

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boley, H. (2006). The RuleML Family of Web Rule Languages. In: Alferes, J.J., Bailey, J., May, W., Schwertel, U. (eds) Principles and Practice of Semantic Web Reasoning. PPSWR 2006. Lecture Notes in Computer Science, vol 4187. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11853107_1

Download citation

  • DOI: https://doi.org/10.1007/11853107_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-39586-7

  • Online ISBN: 978-3-540-39587-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation