The RuleML family of web rule languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4187 LNCS, Issue , 2006, Pages 1-17

  Boley, Harold ^a  

^a NATIONAL RESEARCH COUNCIL CANADA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; PROGRAM INTERPRETERS; SOFTWARE ENGINEERING; WEBSITES;

DATALOG LANGUAGES; EQUATION DEFINED FUNCTIONS; RULE LANGUAGES;

OBJECT ORIENTED PROGRAMMING;

EID: 33845186550     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11853107_1     Document Type: Conference Paper

References (15)

1. [Bar97] Henk Barendregt. The Impact of the Lambda Calculus in Logic and Computer Science. The Bulletin of Symbolic Logic, 3(2):181-215, 1997.
2. +05] Marcel Ball, Harold Boley, David Hirtle, Jing Mei, and Bruce Spencer. The OO jDREW Reference Implementation of RuleML. In Proc. Rules and Rule Markup Languages for the Semantic Web (RuleML-2005). LNCS 3791, Springer-Verlag, November 2005.
3. [BKPS03] Paul A. Bailes, Colin J. M. Kemp, Ian Peake, and Sean Seefried. Why Functional Programming Really Matters. In Applied Informatics, pages 919-926, 2003.
4. [Bol99] Harold Boley. Functional-Logic Integration via Minimal Reciprocal Extensions. Theoretical Computer Science, 212:77-99, 1999.
5. [Bol00a] Harold Boley. Markup Languages for Functional-Logic Programming. In 9th International Workshop on Functional and Logic Programming, Benicassim, Spain, pages 391-403. UPV University Press, Valencia, publication 2000/2039, September 2000.
6. [Bol00b] Harold Boley. Relationships Between Logic Programming and RDF. In Proc. 1st Pacific Rim International Workshop on Intelligent Information Agents (PRIIA 2000). University of Melbourne, Australia; LNCS 2112, August 2000.
7. [Bol03] Harold Boley. Object-Oriented RuleML: User-Level Roles, URI-Grounded Clauses, and Order-Sorted Terms. In Proc. Rules and Rule Markup Languages for the Semantic Web (RuleML-2003). LNCS 2876, Springer-Verlag, October 2003.
8. [DV99] E. Dantsin and A. Voronkov. A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees. Lecture Notes in Computer Science, 1578:180-196, 1999.
9. [FRSV05] Achille Fokoue, Kristoffer Rose, Jérôme Siméon, and Lionel Villard. Compiling XSLT 2.0 into XQuery 1.0. In Proceedings of the Fourteenth International World Wide Web Conference, pages 682-691, Chiba, Japan, May 2005. ACM Press.
10. [GKWZ03] Dov M. Gabbay, Ágnes Kurucz, Frank Wolter, and Michael Zakharyaschev. Many-Dimensional Modal Logics: Theory and Applications, Elsevier, Amsterdam, 2003.
11. [Hen06] Vincent F. Hendricks. Mainstream and Formal Epistemology. Cambridge University Press, New York, 2006.
12. [O'D85] M. J. O'Donnell. Equational Logic as a Programming Language. MIT Press, Cambridge, Mass., 1985.
13. [Pad88] P. Padawitz. Computing in Horn Clause Theories. EATCS Monographs on Theoretical Computer Science, Vol. 16. Springer, 1988.
14. [SB04] Sebastian Schaffert and François Bry. Querying the Web Reconsidered: A Practical Introduction to Xcerpt. In Proceedings of Extreme Markup Languages 2004, Montreal, Quebec, Canada (2nd-6th August 2004), 2004.
15. [SHC96] Z. Somogy, F. Henderson, and T. Conway. The Execution Algorithm of Mercury, An Efficient Purely Declarative Logic Programming Language. Journal of Logic Programming, 29(1-3):17-64, 1996.