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.


Logic Program Modal Logic Logic Programming Business Rule Conditional Equation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bar97]
    Barendregt, H.: The Impact of the Lambda Calculus in Logic and Computer Science. The Bulletin of Symbolic Logic 3(2), 181–215 (1997)MATHCrossRefMathSciNetGoogle Scholar
  2. [BBH+05]
    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)CrossRefGoogle Scholar
  3. [BKPS03]
    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. [Bol99]
    Boley, H.: Functional-Logic Integration via Minimal Reciprocal Extensions. Theoretical Computer Science 212, 77–99 (1999)MATHCrossRefMathSciNetGoogle Scholar
  5. [Bol00a]
    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. [Bol00b]
    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)CrossRefGoogle Scholar
  7. [Bol03]
    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)CrossRefGoogle Scholar
  8. [DV99]
    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)CrossRefGoogle Scholar
  9. [FRSV05]
    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)CrossRefGoogle Scholar
  10. [GKWZ03]
    Gabbay, D.M., Kurucz, Á., Wolter, F., Zakharyaschev, M.: Many-Dimensional Modal Logics: Theory and Applications. Elsevier, Amsterdam (2003)MATHGoogle Scholar
  11. [Hen06]
    Hendricks, V.F.: Mainstream and Formal Epistemology. Cambridge University Press, New York (2006)Google Scholar
  12. [O’D85]
    O’Donnell, M.J.: Equational Logic as a Programming Language. MIT Press, Cambridge (1985)MATHGoogle Scholar
  13. [Pad88]
    Padawitz, P.: Computing in Horn Clause Theories. EATCS Monographs on Theoretical Computer Science, vol. 16. Springer, Heidelberg (1988)MATHGoogle Scholar
  14. [SB04]
    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. [SHC96]
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Harold Boley
    • 1
  1. 1.Institute for Information Technology – e-BusinessNational Research Council of CanadaFrederictonCanada

Personalised recommendations