{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T22:02:21Z","timestamp":1750456941046,"version":"3.41.0"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2009,2,1]],"date-time":"2009-02-01T00:00:00Z","timestamp":1233446400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2009,2]]},"abstract":"<jats:p>Constraint Handling Rules (CHR) is a high-level rule-based programming language which is increasingly used for general-purpose programming. We introduce the CHR machine, a model of computation based on the operational semantics of CHR. Its computational power and time complexity properties are compared to those of the well-understood Turing machine and Random Access Memory machine. This allows us to prove the interesting result that every algorithm can be implemented in CHR with the best known time and space complexity. We also investigate the practical relevance of this result and the constant factors involved. Finally we expand the scope of the discussion to other (declarative) programming languages.<\/jats:p>","DOI":"10.1145\/1462166.1462169","type":"journal-article","created":{"date-parts":[[2009,2,25]],"date-time":"2009-02-25T14:44:30Z","timestamp":1235573070000},"page":"1-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["The computational power and complexity of constraint handling rules"],"prefix":"10.1145","volume":"31","author":[{"given":"Jon","family":"Sneyers","sequence":"first","affiliation":[{"name":"K.U.Leuven, Heverlee, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Schrijvers","sequence":"additional","affiliation":[{"name":"K.U.Leuven, Heverlee, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Demoen","sequence":"additional","affiliation":[{"name":"K.U.Leuven, Heverlee, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,2,20]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"263","article-title":"An algorithm for the organization of information","volume":"146","author":"Adelson-Velsky G. M.","year":"1962","unstructured":"Adelson-Velsky , G. M. and Landis , E. M. 1962 . An algorithm for the organization of information . Doklady Akademii Nauk SSSR 146 , 263 -- 266 . Adelson-Velsky, G. M. and Landis, E. M. 1962. An algorithm for the organization of information. Doklady Akademii Nauk SSSR 146, 263--266.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"e_1_2_1_2_1","unstructured":"Aho A. V. Hopcroft J. E. and Ullman J. D. 1975. The Design and Analysis of Computer Algorithms. Addison-Wesley Longman Boston.   Aho A. V. Hopcroft J. E. and Ullman J. D. 1975. The Design and Analysis of Computer Algorithms. Addison-Wesley Longman Boston."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592101"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00359-0"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Clocksin W. F. and Mellish C. S. 1984. Programming in Prolog. Springer.   Clocksin W. F. and Mellish C. S. 1984. Programming in Prolog. Springer.","DOI":"10.1007\/978-3-642-96873-0"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 23rd International Conference on Logic Programming (ICLP'07)","volume":"4670","author":"De Koninck L.","unstructured":"De Koninck , L. , Schrijvers , T. , and Demoen , B . 2007. The correspondence between the Logical Algorithms language and CHR . In Proceedings of the 23rd International Conference on Logic Programming (ICLP'07) , V. Dahl and I. Niemel\u00e4, Eds. Lecture Notes in Computer Science , vol. 4670 . Springer, 209--223. De Koninck, L., Schrijvers, T., and Demoen, B. 2007. The correspondence between the Logical Algorithms language and CHR. In Proceedings of the 23rd International Conference on Logic Programming (ICLP'07), V. Dahl and I. Niemel\u00e4, Eds. Lecture Notes in Computer Science, vol. 4670. Springer, 209--223."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"volume-title":"Proceedings of the 2nd Workshop on Constraint Handling Rules (CHR'05)","author":"Duck G. J.","key":"e_1_2_1_9_1","unstructured":"Duck , G. J. and Schrijvers , T . 2005. Accurate functional dependency analysis for Constraint Handling Rules . In Proceedings of the 2nd Workshop on Constraint Handling Rules (CHR'05) , T. Schrijvers and T. Fr\u00fchwirth, Eds., 109--124. Duck, G. J. and Schrijvers, T. 2005. Accurate functional dependency analysis for Constraint Handling Rules. In Proceedings of the 2nd Workshop on Constraint Handling Rules (CHR'05), T. Schrijvers and T. Fr\u00fchwirth, Eds., 109--124."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 20th International Conference on Logic Programming (ICLP'04)","volume":"3132","author":"Duck G. J.","unstructured":"Duck , G. J. , Stuckey , P. J. , Garc\u00eda de la Banda, M., and Holzbaur, C. 2004. The refined operational semantics of Constraint Handling Rules . In Proceedings of the 20th International Conference on Logic Programming (ICLP'04) , B. Demoen and V. Lifschitz, Eds. Lecture Notes in Computer Science , vol. 3132 , 90--104. Duck, G. J., Stuckey, P. J., Garc\u00eda de la Banda, M., and Holzbaur, C. 2004. The refined operational semantics of Constraint Handling Rules. In Proceedings of the 20th International Conference on Logic Programming (ICLP'04), B. Demoen and V. Lifschitz, Eds. Lecture Notes in Computer Science, vol. 3132, 90--104."},{"volume-title":"Proceedings of the 3rd Workshop on Constraint Handling Rules (CHR'06)","author":"Duck G. J.","key":"e_1_2_1_11_1","unstructured":"Duck , G. J. , Stuckey , P. J. , and Sulzmann , M . 2006. Observable confluence for Constraint Handling Rules . In Proceedings of the 3rd Workshop on Constraint Handling Rules (CHR'06) , T. Schrijvers and T. Fr\u00fchwirth, Eds., 61--76. Duck, G. J., Stuckey, P. J., and Sulzmann, M. 2006. Observable confluence for Constraint Handling Rules. In Proceedings of the 3rd Workshop on Constraint Handling Rules (CHR'06), T. Schrijvers and T. Fr\u00fchwirth, Eds., 61--76."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44881-0_3"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(82)90020-0"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"volume-title":"Jess in Action: Java Rule-Based Systems","author":"Friedman-Hill E.","key":"e_1_2_1_15_1","unstructured":"Friedman-Hill , E. 2003. Jess in Action: Java Rule-Based Systems . Manning Publications . Friedman-Hill, E. 2003. Jess in Action: Java Rule-Based Systems. Manning Publications."},{"volume-title":"Constraint simplification rules. Tech. rep. ECRC-92-18","author":"Fr\u00fchwirth T.","key":"e_1_2_1_16_1","unstructured":"Fr\u00fchwirth , T. 1992. Constraint simplification rules. Tech. rep. ECRC-92-18 , European Computer-Industry Research Centre , Munich, Germany . July. Fr\u00fchwirth, T. 1992. Constraint simplification rules. Tech. rep. ECRC-92-18, European Computer-Industry Research Centre, Munich, Germany. July."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(98)10005-5"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the Quantitative Aspects of Programming Languages (QAPL'01)","volume":"59","author":"Fr\u00fchwirth T.","year":"2001","unstructured":"Fr\u00fchwirth , T. 2001 . As time goes by II: More automatic complexity analysis of concurrent rule programs . In Proceedings of the Quantitative Aspects of Programming Languages (QAPL'01) , A. D. Pierro and H. Wiklicky, Eds. Electronic Notes in Theoretical Computer Science , vol. 59 , 3. Elsevier, 185--206. Fr\u00fchwirth, T. 2001. As time goes by II: More automatic complexity analysis of concurrent rule programs. In Proceedings of the Quantitative Aspects of Programming Languages (QAPL'01), A. D. Pierro and H. Wiklicky, Eds. Electronic Notes in Theoretical Computer Science, vol. 59, 3. Elsevier, 185--206."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR'02)","author":"Fr\u00fchwirth T.","year":"2002","unstructured":"Fr\u00fchwirth , T. 2002 . As time goes by: Automatic complexity analysis of concurrent rule programs . In Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR'02) , D. Fensel et al., Eds. Morgan Kaufmann, 547--557. Fr\u00fchwirth, T. 2002. As time goes by: Automatic complexity analysis of concurrent rule programs. In Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR'02), D. Fensel et al., Eds. Morgan Kaufmann, 547--557."},{"volume-title":"Constraint Handling Rules","author":"Fr","key":"e_1_2_1_20_1","unstructured":"Fr &uhuml;wirth, T. 2009. Constraint Handling Rules . Cambridge University Press . To appear. Fr&uhuml;wirth, T. 2009. Constraint Handling Rules. Cambridge University Press. To appear."},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth T. and Abdennadher S. 2003. Essentials of Constraint Programming. Cognitive Technologies. Springer.   Fr\u00fchwirth T. and Abdennadher S. 2003. Essentials of Constraint Programming. Cognitive Technologies. Springer.","DOI":"10.1007\/978-3-662-05138-2"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/645522.656315"},{"key":"e_1_2_1_23_1","volume-title":"Expert Systems: Principles and Programming","author":"Giarratano J. C.","year":"1994","unstructured":"Giarratano , J. C. and Riley , G . 1994 . Expert Systems: Principles and Programming . PWS Publishing , Boston, MA . Giarratano, J. C. and Riley, G. 1994. Expert Systems: Principles and Programming. PWS Publishing, Boston, MA."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1965-0170805-7"},{"key":"e_1_2_1_25_1","unstructured":"Holzbaur C. and Fr\u00fchwirth T. 1998. CHR reference manual. Tech. rep. TR-98-01 \u00d6sterreichisches Forschungsinstitut f\u00fcr Artificial Intelligence Vienna Austria.  Holzbaur C. and Fr\u00fchwirth T. 1998. CHR reference manual. Tech. rep. TR-98-01 \u00d6sterreichisches Forschungsinstitut f\u00fcr Artificial Intelligence Vienna Austria."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 1st International Conference on Principles and Practice of Declarative Programming (PPDP'99)","volume":"1702","author":"Holzbaur C.","unstructured":"Holzbaur , C. and Fr\u00fchwirth , T . 1999. Compiling constraint candling rules into prolog with attributed variables . In Proceedings of the 1st International Conference on Principles and Practice of Declarative Programming (PPDP'99) , G. Nadathur, Ed. Lecture Notes in Computer Science , vol. 1702 . Springer, 117--133. Holzbaur, C. and Fr\u00fchwirth, T. 1999. Compiling constraint candling rules into prolog with attributed variables. In Proceedings of the 1st International Conference on Principles and Practice of Declarative Programming (PPDP'99), G. Nadathur, Ed. Lecture Notes in Computer Science, vol. 1702. Springer, 117--133."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068405002413"},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Hopcroft J. E. Motwani R. and Ullman J. D. 2001. Introduction to Automata Theory Languages and Computation. Addison-Wesley Longman Boston MA.   Hopcroft J. E. Motwani R. and Ullman J. D. 2001. Introduction to Automata Theory Languages and Computation. Addison-Wesley Longman Boston MA.","DOI":"10.1145\/568438.568455"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1238844.1238856"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5625.003.0004"},{"volume-title":"Proceedings of the 8th National Conference on Artificial Intelligence (AAAI'90)","author":"Miranker D. P.","key":"e_1_2_1_32_1","unstructured":"Miranker , D. P. , Brant , D. A. , Lofaso , B. , and Gadbois , D . 1990. On the performance of lazy matching in production systems . In Proceedings of the 8th National Conference on Artificial Intelligence (AAAI'90) , T. Dietterich and W. Swartout, Eds. MIT Press, Boston, MA, 685--692. Miranker, D. P., Brant, D. A., Lofaso, B., and Gadbois, D. 1990. On the performance of lazy matching in production systems. In Proceedings of the 8th National Conference on Artificial Intelligence (AAAI'90), T. Dietterich and W. Swartout, Eds. MIT Press, Boston, MA, 685--692."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321481"},{"volume-title":"Proceedings of the Workshop on ML, 77--86","author":"Okasaki C.","key":"e_1_2_1_34_1","unstructured":"Okasaki , C. and Gill , A . 1998. Fast mergeable integer maps . In Proceedings of the Workshop on ML, 77--86 . Okasaki, C. and Gill, A. 1998. Fast mergeable integer maps. In Proceedings of the Workshop on ML, 77--86."},{"volume-title":"Models of Computation","author":"Savage J. E.","key":"e_1_2_1_35_1","unstructured":"Savage , J. E. 1998. Models of Computation . Addison-Wesley Longman, Boston , MA. Savage, J. E. 1998. Models of Computation. Addison-Wesley Longman, Boston, MA."},{"key":"e_1_2_1_36_1","volume-title":"Eds. Mathematical Centre Tracts","volume":"99","author":"Savitch W. J.","year":"1978","unstructured":"Savitch , W. J. 1978 . The influence of the machine model on computational complexity. In Interfaces between Computer Science and Operations Research, J. Lenstra et al ., Eds. Mathematical Centre Tracts , vol. 99 . Centre for Mathematics and Computer Science, Amsterdam, 1--32. Savitch, W. J. 1978. The influence of the machine model on computational complexity. In Interfaces between Computer Science and Operations Research, J. Lenstra et al., Eds. Mathematical Centre Tracts, vol. 99. Centre for Mathematics and Computer Science, Amsterdam, 1--32."},{"volume-title":"Proceedings of the 1st Workshop on Constraint Handling Rules (CHR'04)","author":"Schrijvers T.","key":"e_1_2_1_38_1","unstructured":"Schrijvers , T. and Demoen , B . 2004. The K. U. Leuven CHR system: Implementation and application . In Proceedings of the 1st Workshop on Constraint Handling Rules (CHR'04) , Selected Contributions, T. Fr\u00fchwirth and M. Meister, Eds. Ulm, Germany. Schrijvers, T. and Demoen, B. 2004. The K. U. Leuven CHR system: Implementation and application. In Proceedings of the 1st Workshop on Constraint Handling Rules (CHR'04), Selected Contributions, T. Fr\u00fchwirth and M. Meister, Eds. Ulm, Germany."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068405002541"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89982-2_72"},{"volume-title":"Proceedings of the 5th Workshop on Constraint Handling Rules (CHR'08)","author":"Sneyers J.","key":"e_1_2_1_41_1","unstructured":"Sneyers , J. and Fr\u00fchwirth , T . 2008. Generalized CHR machines . In Proceedings of the 5th Workshop on Constraint Handling Rules (CHR'08) , T. Schrijvers et al., Eds. Sneyers, J. and Fr\u00fchwirth, T. 2008. Generalized CHR machines. In Proceedings of the 5th Workshop on Constraint Handling Rules (CHR'08), T. Schrijvers et al., Eds."},{"volume-title":"Proceedings of the 20th Workshop on Logic Programming (WLP'06)","author":"Sneyers J.","key":"e_1_2_1_42_1","unstructured":"Sneyers , J. , Schrijvers , T. , and Demoen , B . 2006a. Dijkstra's algorithm with Fibonacci heaps: An executable description in CHR . In Proceedings of the 20th Workshop on Logic Programming (WLP'06) . Sneyers, J., Schrijvers, T., and Demoen, B. 2006a. Dijkstra's algorithm with Fibonacci heaps: An executable description in CHR. In Proceedings of the 20th Workshop on Logic Programming (WLP'06)."},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the 22nd International Conference on Logic Programming (ICLP'06)","volume":"4079","author":"Sneyers J.","unstructured":"Sneyers , J. , Schrijvers , T. , and Demoen , B . 2006b. Memory reuse for CHR . In Proceedings of the 22nd International Conference on Logic Programming (ICLP'06) , S. Etalle and M. Truszczynski, Eds. Lecture Notes in Computer Science , vol. 4079 . Springer, 72--86. Sneyers, J., Schrijvers, T., and Demoen, B. 2006b. Memory reuse for CHR. In Proceedings of the 22nd International Conference on Logic Programming (ICLP'06), S. Etalle and M. Truszczynski, Eds. Lecture Notes in Computer Science, vol. 4079. Springer, 72--86."},{"key":"e_1_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Sneyers J. Van Weert P. De Koninck L. and Schrijvers T. 2009. As time goes by: Constraint handling rules\u2014A survey of CHR research between 1998 and 2007. Theory Pract. Logic Program. Submitted.  Sneyers J. Van Weert P. De Koninck L. and Schrijvers T. 2009. As time goes by: Constraint handling rules\u2014A survey of CHR research between 1998 and 2007. Theory Pract. Logic Program. Submitted.","DOI":"10.1017\/S1471068409990123"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(96)00068-4"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/62.2160"},{"key":"e_1_2_1_47_1","first-page":"230","article-title":"On computable numbers, with an application to the Entscheidungsproblem","volume":"2","author":"Turing A. M.","year":"1936","unstructured":"Turing , A. M. 1936 . On computable numbers, with an application to the Entscheidungsproblem . Proc. London Math. Soc. 2 , 42, 230 -- 265 . Turing, A. M. 1936. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. 2, 42, 230--265.","journal-title":"Proc. London Math. Soc."},{"key":"e_1_2_1_48_1","doi-asserted-by":"crossref","unstructured":"van Emde Boas P. 1990. Machine models and simulations. In Handbook of Theoretical Computer Science Volume A: Algorithms and Complexity J. van Leeuwen Ed. Elsevier.   van Emde Boas P. 1990. Machine models and simulations. In Handbook of Theoretical Computer Science Volume A: Algorithms and Complexity J. van Leeuwen Ed. Elsevier.","DOI":"10.1016\/B978-0-444-88071-0.50006-0"},{"volume-title":"Proceedings of the 2nd Workshop on Constraint Handling Rules (CHR'05)","author":"Van Weert P.","key":"e_1_2_1_49_1","unstructured":"Van Weert , P. , Schrijvers , T. , and Demoen , B . 2005. K. U. Leuven JCHR: A user-friendly, flexible and efficient CHR system for Java . In Proceedings of the 2nd Workshop on Constraint Handling Rules (CHR'05) , T. Schrijvers and T. Fr\u00fchwirth, Eds., 47--62. Van Weert, P., Schrijvers, T., and Demoen, B. 2005. K. U. Leuven JCHR: A user-friendly, flexible and efficient CHR system for Java. In Proceedings of the 2nd Workshop on Constraint Handling Rules (CHR'05), T. Schrijvers and T. Fr\u00fchwirth, Eds., 47--62."},{"volume-title":"Proceedings of the 3rd Workshop on Constraint Handling Rules (CHR'06)","author":"Van Weert P.","key":"e_1_2_1_50_1","unstructured":"Van Weert , P. , Sneyers , J. , Schrijvers , T. , and Demoen , B . 2006. Extending CHR with negation as absence . In Proceedings of the 3rd Workshop on Constraint Handling Rules (CHR'06) , T. Schrijvers and T. Fr\u00fchwirth, Eds. K. U. Leuven, Department of Computer Science. Venice, Italy, 125--140. Van Weert, P., Sneyers, J., Schrijvers, T., and Demoen, B. 2006. Extending CHR with negation as absence. In Proceedings of the 3rd Workshop on Constraint Handling Rules (CHR'06), T. Schrijvers and T. Fr\u00fchwirth, Eds. K. U. Leuven, Department of Computer Science. Venice, Italy, 125--140."},{"volume-title":"Proceedings of the 4th Workshop on Constraint Handling Rules (CHR'07)","author":"Wuille P.","key":"e_1_2_1_51_1","unstructured":"Wuille , P. , Schrijvers , T. , and Demoen , B . 2007. CCHR: The fastest CHR implementation, in C . In Proceedings of the 4th Workshop on Constraint Handling Rules (CHR'07) , K. Djelloul et al., Eds., 123--137. Wuille, P., Schrijvers, T., and Demoen, B. 2007. CCHR: The fastest CHR implementation, in C. In Proceedings of the 4th Workshop on Constraint Handling Rules (CHR'07), K. Djelloul et al., Eds., 123--137."}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1462166.1462169","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1462166.1462169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:15Z","timestamp":1750253415000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1462166.1462169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["10.1145\/1462166.1462169"],"URL":"https:\/\/doi.org\/10.1145\/1462166.1462169","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"type":"print","value":"0164-0925"},{"type":"electronic","value":"1558-4593"}],"subject":[],"published":{"date-parts":[[2009,2]]},"assertion":[{"value":"2006-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-02-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}