{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:31:47Z","timestamp":1725471107769},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540395867"},{"type":"electronic","value":"9783540395874"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11853107_1","type":"book-chapter","created":{"date-parts":[[2006,9,29]],"date-time":"2006-09-29T07:49:56Z","timestamp":1159516196000},"page":"1-17","source":"Crossref","is-referenced-by-count":26,"title":["The RuleML Family of Web Rule Languages"],"prefix":"10.1007","author":[{"given":"Harold","family":"Boley","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.2307\/421013","volume":"3","author":"H. Barendregt","year":"1997","unstructured":"Barendregt, H.: The Impact of the Lambda Calculus in Logic and Computer Science. The Bulletin of Symbolic Logic\u00a03(2), 181\u2013215 (1997)","journal-title":"The Bulletin of Symbolic Logic"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11580072_20","volume-title":"Rules and Rule Markup Languages for the Semantic Web","author":"M. Ball","year":"2005","unstructured":"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.\u00a03791, pp. 218\u2013223. Springer, Heidelberg (2005)"},{"key":"1_CR3","unstructured":"Bailes, P.A., Kemp, C.J.M., Peake, I., Seefried, S.: Why Functional Programming Really Matters. In: Applied Informatics, pp. 919\u2013926 (2003)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0304-3975(98)00136-4","volume":"212","author":"H. Boley","year":"1999","unstructured":"Boley, H.: Functional-Logic Integration via Minimal Reciprocal Extensions. Theoretical Computer Science\u00a0212, 77\u201399 (1999)","journal-title":"Theoretical Computer Science"},{"key":"1_CR5","unstructured":"Boley, H.: Markup Languages for Functional-Logic Programming. In: 9th International Workshop on Functional and Logic Programming, Benicassim, Spain, September 2000, pp. 391\u2013403. UPV University Press, Valencia (2000) (publication 2000\/2039)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-45408-X_21","volume-title":"Advances in Artificial Intelligence. PRICAI 2000 Workshop Reader","author":"H. Boley","year":"2001","unstructured":"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.\u00a02112, p. 201. Springer, Heidelberg (2001)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-39715-1_1","volume-title":"Rules and Rule Markup Languages for the Semantic Web","author":"H. Boley","year":"2003","unstructured":"Boley, H.: Object-Oriented RuleML: User-Level Roles, URI-Grounded Clauses, and Order-Sorted Terms. In: Schr\u00f6der, M., Wagner, G. (eds.) RuleML 2003. LNCS, vol.\u00a02876, pp. 1\u201316. Springer, Heidelberg (2003)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-49019-1_13","volume-title":"Foundations of Software Science and Computation Structures","author":"E. Dantsin","year":"1999","unstructured":"Dantsin, E., Voronkov, A.: A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol.\u00a01578, pp. 180\u2013196. Springer, Heidelberg (1999)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1145\/1060745.1060844","volume-title":"Proceedings of the Fourteenth International World Wide Web Conference","author":"A. Fokoue","year":"2005","unstructured":"Fokoue, A., Rose, K., Sim\u00e9on, 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\u2013691. ACM Press, New York (2005)"},{"key":"1_CR10","volume-title":"Many-Dimensional Modal Logics: Theory and Applications","author":"D.M. Gabbay","year":"2003","unstructured":"Gabbay, D.M., Kurucz, \u00c1., Wolter, F., Zakharyaschev, M.: Many-Dimensional Modal Logics: Theory and Applications. Elsevier, Amsterdam (2003)"},{"key":"1_CR11","volume-title":"Mainstream and Formal Epistemology","author":"V.F. Hendricks","year":"2006","unstructured":"Hendricks, V.F.: Mainstream and Formal Epistemology. Cambridge University Press, New York (2006)"},{"key":"1_CR12","volume-title":"Equational Logic as a Programming Language","author":"M.J. O\u2019Donnell","year":"1985","unstructured":"O\u2019Donnell, M.J.: Equational Logic as a Programming Language. MIT Press, Cambridge (1985)"},{"key":"1_CR13","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-73824-1","volume-title":"Computing in Horn Clause Theories","author":"P. Padawitz","year":"1988","unstructured":"Padawitz, P.: Computing in Horn Clause Theories. EATCS Monographs on Theoretical Computer Science, vol.\u00a016. Springer, Heidelberg (1988)"},{"key":"1_CR14","unstructured":"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\u20136th (2004)"},{"issue":"1-3","key":"1_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z. Somogy","year":"1996","unstructured":"Somogy, Z., Henderson, F., Conway, T.: The Execution Algorithm of Mercury, An Efficient Purely Declarative Logic Programming Language. Journal of Logic Programming\u00a029(1-3), 17\u201364 (1996)","journal-title":"Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Semantic Web Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11853107_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:55:00Z","timestamp":1558284900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11853107_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540395867","9783540395874"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11853107_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}