{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T11:38:34Z","timestamp":1770896314770,"version":"3.50.1"},"reference-count":75,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4802,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0004-3702(00)00019-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:22:13Z","timestamp":1027599733000},"page":"81-117","source":"Crossref","is-referenced-by-count":64,"title":["Backtracking algorithms for disjunctions of temporal constraints"],"prefix":"10.1016","volume":"120","author":[{"given":"Kostas","family":"Stergiou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manolis","family":"Koubarakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0004-3702(00)00019-9_ID005","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0004-3702(84)90008-0","article-title":"Towards a general model of action and time","volume":"Vol. 23","author":"Allen","year":"1984","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID006","series-title":"Reasoning about Plans","year":"1991"},{"key":"10.1016\/S0004-3702(00)00019-9_ID007","series-title":"Proc. European Conference on Planning (ECP-99)","article-title":"Sat-based procedures for temporal reasoning","author":"Armando","year":"1999"},{"key":"10.1016\/S0004-3702(00)00019-9_ID008","series-title":"Proc. 1st International Conference on Principles and Practice of Constraint Programming (CP-95), Cassis, France","first-page":"258","article-title":"Dynamic variable ordering in CSPs","author":"Bacchus","year":"1995"},{"key":"10.1016\/S0004-3702(00)00019-9_ID009","series-title":"Proc. IJCAI-95, Montreal, Quebec, Vol. 1","first-page":"600","article-title":"A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling","author":"Baptiste","year":"1995"},{"key":"10.1016\/S0004-3702(00)00019-9_ID010","series-title":"Proc. 3rd International Conference on Principles and Practice of Constraint Programming (CP-97), Linz, Austria","first-page":"390","article-title":"Five pitfalls of empirical scheduling research","author":"Beck","year":"1997"},{"key":"10.1016\/S0004-3702(00)00019-9_ID011","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/A:1009777711218","article-title":"Temporal constraint satisfaction techniques in job shop scheduling problem solving","volume":"Vol. 3","author":"Belhadji","year":"1998","journal-title":"CONSTRAINTS"},{"key":"10.1016\/S0004-3702(00)00019-9_ID012","series-title":"Proc. 5th International Conference on Principles and Practice of Constraint Programming (CP-99), Alexandria, VA","first-page":"88","article-title":"On forward checking for non-binary constraint satisfaction","author":"Bessi\u00e8re","year":"1999"},{"issue":"4","key":"10.1016\/S0004-3702(00)00019-9_ID013","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","article-title":"New methods to color the vertices of a graph","volume":"Vol. 22","author":"Brelaz","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(00)00019-9_ID014","series-title":"Proc. IJCAI-91, Sydney, Australia, Vol 1","first-page":"331","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"key":"10.1016\/S0004-3702(00)00019-9_ID015","series-title":"Proc. AAAI-94, Seattle, WA","article-title":"Generating feasible schedules under complex metric constraints","author":"Cheng","year":"1994"},{"key":"10.1016\/S0004-3702(00)00019-9_ID016","series-title":"Proc. CONSTRAINTS-95, Melbourne Beach, FL","first-page":"40","article-title":"Efficient algorithms for networks of quantitative temporal constraints","author":"Chleq","year":"1995"},{"key":"10.1016\/S0004-3702(00)00019-9_ID017","series-title":"Proc. SSD-97","first-page":"142","article-title":"Constraint-based interoperability of spatiotemporal databases","volume":"Vol. 1262","author":"Chomicki","year":"1997"},{"key":"10.1016\/S0004-3702(00)00019-9_ID018","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0004-3702(95)00046-1","article-title":"Experimental results on the crossover point in random 3-SAT","volume":"Vol. 81","author":"Crawford","year":"1996","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0004-3702(00)00019-9_ID019","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(91)90024-E","article-title":"O-plan: The open planning architecture","volume":"Vol. 52","author":"Currie","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID020","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0004-3702(92)90043-W","article-title":"From local to global consistency","volume":"Vol. 55","author":"Dechter","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID021","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0004-3702(94)90068-X","article-title":"Experimental evaluation of preprocessing algorithms for constraint satisfaction problems","volume":"Vol. 68","author":"Dechter","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID022","series-title":"Proc. 1st International Conference on Principles of Knowledge Representation and Reasoning, Toronto, Ontario","first-page":"83","article-title":"Temporal constraint networks","author":"Dechter","year":"1989"},{"issue":"1\u20133","key":"10.1016\/S0004-3702(00)00019-9_ID023","first-page":"61","article-title":"Temporal constraint networks","volume":"Vol. 49","author":"Dechter","year":"1991","journal-title":"Artificial Intelligence (Special Volume on Knowledge Representation)"},{"issue":"1","key":"10.1016\/S0004-3702(00)00019-9_ID024","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","article-title":"Network-based heuristics for constraint satisfaction problems","volume":"Vol. 34","author":"Dechter","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID025","series-title":"Proc. IJCAI-97, Nagoya, Japan, Vol. 2","first-page":"1466","article-title":"Towards a complete classification of tractability in Allen's algebra","author":"Drakengren","year":"1997"},{"key":"10.1016\/S0004-3702(00)00019-9_ID026","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0004-3702(97)00021-0","article-title":"Twenty-one large tractable subclasses of Allen's algebra","volume":"Vol. 93","author":"Drakengren","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID027","series-title":"Proc. 12th European Conference on Artificial Intelligence (ECAI-96), Budapest, Hungary","first-page":"614","article-title":"Temporal and resource reasoning: The parc Plan approach","author":"El-Kholy","year":"1996"},{"key":"10.1016\/S0004-3702(00)00019-9_ID028","series-title":"Theories and Methods of Spatio-Temporal Reasoning in Geographic Space","volume":"Vol. 639","year":"1992"},{"issue":"11","key":"10.1016\/S0004-3702(00)00019-9_ID029","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1145\/359642.359654","article-title":"Synthesizing constraint expressions","volume":"Vol. 21","author":"Freuder","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(00)00019-9_ID030","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","article-title":"A sufficient condition for backtrack-free search","volume":"Vol. 29","author":"Freuder","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(00)00019-9_ID031","series-title":"Proc. AAAI-94, Seattle, WA","first-page":"301","article-title":"In search of the best constraint satisfaction search","author":"Frost","year":"1994"},{"key":"10.1016\/S0004-3702(00)00019-9_ID032","series-title":"Proc. 2nd International Conference on Principles and Practice of Constraint Programming (CP-96), Cambridge, MA","first-page":"179","article-title":"An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem","author":"Gent","year":"1996"},{"key":"10.1016\/S0004-3702(00)00019-9_ID033","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0004-3702(95)00047-X","article-title":"The satisfiability constraint gap","volume":"Vol. 81","author":"Gent","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID034","series-title":"Proc. IJCAI-97, Nagoya, Japan","article-title":"On finding a solution in temporal constraint satisfaction problems","author":"Gerevini","year":"1997"},{"key":"10.1016\/S0004-3702(00)00019-9_ID035","series-title":"Proc. IJCAI-93, Chamb\u00e9ry, France","first-page":"648","article-title":"Efficient temporal reasoning through timegraphs","author":"Gerevini","year":"1993"},{"key":"10.1016\/S0004-3702(00)00019-9_ID036","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0004-3702(94)00016-T","article-title":"Efficient algorithms for qualitative reasoning about time","volume":"Vol. 74","author":"Gerevini","year":"1995","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(00)00019-9_ID037","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/152947.152953","article-title":"Temporal reasoning in timegraph I-II","volume":"Vol. 4","author":"Gerevini","year":"1993","journal-title":"SIGART Bulletin"},{"key":"10.1016\/S0004-3702(00)00019-9_ID038","series-title":"Proc. 2nd International Conference on AI Planning Systems, Chicago, IL","first-page":"61","article-title":"Representation and control in IxTeT, a temporal planner","author":"Ghallab","year":"1994"},{"key":"10.1016\/S0004-3702(00)00019-9_ID039","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","article-title":"Dynamic backtracking","volume":"Vol. 1","author":"Ginsberg","year":"1993","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(00)00019-9_ID040","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1145\/321296.321300","article-title":"Backtrack programming","volume":"Vol. 12","author":"Golomb","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(00)00019-9_ID041","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","article-title":"Increasing tree efficiency for constraint satisfaction problems","volume":"Vol. 14","author":"Haralick","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID042","series-title":"Proc. AAAI-96, Portland, OR","article-title":"A linear programming approach to temporal reasoning","author":"Jonsson","year":"1996"},{"key":"10.1016\/S0004-3702(00)00019-9_ID043","series-title":"Proc. 5th International Conference on the Principles of Knowledge Representation and Reasoning (KR-96), Cambridge, MA","article-title":"On the role of disjunctive representations and constraint propagation in refinement planning","author":"Kambhampati","year":"1996"},{"key":"10.1016\/S0004-3702(00)00019-9_ID044","series-title":"Proc. AAAI-91, Anaheim, CA","first-page":"241","article-title":"Integrating metric and qualitative temporal reasoning","author":"Kautz","year":"1991"},{"key":"10.1016\/S0004-3702(00)00019-9_ID045","series-title":"A theoretical evaluation of selected backtracking algorithms, Technical Report TR94-10","author":"Kondrak","year":"1994"},{"key":"10.1016\/S0004-3702(00)00019-9_ID046","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0004-3702(96)00027-6","article-title":"A theoretical evaluation of selected backtracking algorithms","volume":"Vol. 89","author":"Kondrak","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID047","series-title":"Proc. 4th International Conference on the Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany","first-page":"379","article-title":"Complexity results for first-order theories of temporal constraints","author":"Koubarakis","year":"1994"},{"issue":"2","key":"10.1016\/S0004-3702(00)00019-9_ID048","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0306-4379(94)90008-6","article-title":"Database models for infinite and indefinite temporal information","volume":"Vol. 19","author":"Koubarakis","year":"1994","journal-title":"Information Systems"},{"key":"10.1016\/S0004-3702(00)00019-9_ID049","series-title":"Proc. 2nd International Conference on Principles and Practice of Constraint Programming (CP-96), Cambridge, MA","first-page":"297","article-title":"Tractable disjunctions of linear constraints","author":"Koubarakis","year":"1996"},{"key":"10.1016\/S0004-3702(00)00019-9_ID050","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0304-3975(96)00192-2","article-title":"From local to global consistency in temporal constraint networks","volume":"Vol. 173","author":"Koubarakis","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(00)00019-9_ID051","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0304-3975(96)00124-7","article-title":"The complexity of query evaluation in indefinite temporal constraint databases","volume":"Vol. 171","author":"Koubarakis","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(00)00019-9_ID052","series-title":"Proc. IJCAI-95, Montreal, Quebec","first-page":"1643","article-title":"Planning with sharable resource constraints","author":"Laborie","year":"1995"},{"issue":"3","key":"10.1016\/S0004-3702(00)00019-9_ID053","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/176584.176585","article-title":"On binary constraint problems","volume":"Vol. 41","author":"Ladkin","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(00)00019-9_ID054","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0004-3702(92)90106-8","article-title":"Effective solution of qualitative interval constraint problems","volume":"Vol. 57","author":"Ladkin","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID055","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in networks of relations","volume":"Vol. 8","author":"Mackworth","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID056","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(95)00109-3","article-title":"Combining quantitative and qualitative constraints in temporal reasoning","volume":"Vol. 87","author":"Meiri","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID057","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","article-title":"Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems","volume":"Vol. 58","author":"Minton","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID058","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0004-3702(95)00049-6","article-title":"Some pitfalls for experimenters with random SAT","volume":"Vol. 81","author":"Mitchell","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID059","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraints: Fundamental properties and applications to picture processing","volume":"Vol. 7","author":"Montanari","year":"1974","journal-title":"Information Sciences"},{"issue":"1","key":"10.1016\/S0004-3702(00)00019-9_ID060","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/200836.200848","article-title":"Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra","volume":"Vol. 42","author":"Nebel","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(00)00019-9_ID061","series-title":"Time and resource-constrained scheduling: A constraint satisfaction approach, Ph.D. Thesis","author":"Nuijten","year":"1994"},{"key":"10.1016\/S0004-3702(00)00019-9_ID062","series-title":"Proc. AAAI-94, Seattle, WA","first-page":"1010","article-title":"Temporal planning with continuous change","author":"Penberthy","year":"1994"},{"issue":"3","key":"10.1016\/S0004-3702(00)00019-9_ID063","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","article-title":"Hybrid algorithms for the constraint satisfaction problem","volume":"Vol. 9","author":"Prosser","year":"1993","journal-title":"Comput. Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID064","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(95)00048-8","article-title":"An empirical study of phase transitions in binary constraint satisfaction problems","volume":"Vol. 81","author":"Prosser","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID065","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/0004-3702(95)00078-S","article-title":"Backtracking techniques for the job shop scheduling constraint satisfaction problem","volume":"Vol. 76","author":"Sadeh","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID066","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0004-3702(97)00009-X","article-title":"Processing disjunctions in temporal constraint networks","volume":"Vol. 93","author":"Schwalb","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID067","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0004-3702(95)00045-3","article-title":"Generating hard satisfiability problems","volume":"Vol. 81","author":"Selman","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID068","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(95)00052-6","article-title":"Locating the phase transitions in constraint satisfaction problems","volume":"Vol. 81","author":"Smith","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID069","series-title":"Proc. ECAI-98, Brighton, UK","first-page":"567","article-title":"On non-binary temporal relations","author":"Staab","year":"1998"},{"key":"10.1016\/S0004-3702(00)00019-9_ID070","series-title":"Backtracking algorithms for checking the consistency of disjunctions of temporal constraints, Master's Thesis","author":"Stergiou","year":"1997"},{"key":"10.1016\/S0004-3702(00)00019-9_ID071","series-title":"Foundations of Constraint Satisfaction","author":"Tsang","year":"1993"},{"key":"10.1016\/S0004-3702(00)00019-9_ID072","series-title":"Principles of Data Base and Knowledge Base Systems, Vol. 1","author":"Ullman","year":"1988"},{"key":"10.1016\/S0004-3702(00)00019-9_ID073","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0933-3657(91)90004-U","article-title":"Temporal query processing with indefinite information","volume":"Vol. 3","author":"van Beek","year":"1991","journal-title":"Artificial Intelligence in Medicine"},{"key":"10.1016\/S0004-3702(00)00019-9_ID074","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0004-3702(92)90011-L","article-title":"Reasoning about qualitative temporal information","volume":"Vol. 58","author":"van Beek","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID075","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.232","article-title":"The design and experimental analysis of algorithms for temporal reasoning","volume":"Vol. 4","author":"van Beek","year":"1996","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(00)00019-9_ID076","series-title":"Readings in Qualitative Reasoning about Physical Systems","first-page":"373","article-title":"Constraint propagation algorithms for temporal reasoning: A revised report","author":"Vilain","year":"1989"},{"key":"10.1016\/S0004-3702(00)00019-9_ID077","series-title":"Practical Planning: Extending the Classical AI Planning Paradigm","author":"Wilkins","year":"1988"},{"issue":"4","key":"10.1016\/S0004-3702(00)00019-9_ID078","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1111\/j.1467-8640.1990.tb00297.x","article-title":"Can AI planners solve practical problems","volume":"Vol. 6","author":"Wilkins","year":"1990","journal-title":"Comput. Intelligence"},{"key":"10.1016\/S0004-3702(00)00019-9_ID079","series-title":"A common knowledge representation for plan generation and reactive execution, Technical Report 532R","author":"Wilkins","year":"1994"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000199?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000199?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:21:49Z","timestamp":1578712909000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370200000199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":75,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0004370200000199"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(00)00019-9","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}