{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:41:57Z","timestamp":1747546917162},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1007\/bf01547895","type":"journal-article","created":{"date-parts":[[2005,4,30]],"date-time":"2005-04-30T02:38:13Z","timestamp":1114828693000},"page":"453-473","source":"Crossref","is-referenced-by-count":6,"title":["Parallel path consistency"],"prefix":"10.1007","volume":"20","author":[{"given":"Steven Y.","family":"Susswein","sequence":"first","affiliation":[]},{"given":"Thomas C.","family":"Henderson","sequence":"additional","affiliation":[]},{"given":"Joseph L.","family":"Zachary","sequence":"additional","affiliation":[]},{"given":"Chuck","family":"Hansen","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Hinker","sequence":"additional","affiliation":[]},{"given":"Gary C.","family":"Marsden","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Parallel Path Consistency","author":"Steven Y. Susswein","year":"1991","unstructured":"Steven Y. Susswein, Parallel Path Consistency, Master's Thesis, University of Utah, Salt Lake City, Utah (March 1991)."},{"key":"CR2","series-title":"Technical Report TR-91-010","volume-title":"Parallel Path Consistency","author":"Steven Y. Susswein","year":"1991","unstructured":"Steven Y. Susswein, Thomas C. Henderson, Joe Zachary, Chuck Hansen, Paul Hinker, and Gary C. Marsden, Parallel Path Consistency, Technical Report TR-91-010, University of Utah, University of Utah, Department of Computer Science, Salt Lake City, Utah (August 1991)."},{"key":"CR3","unstructured":"S. Keretho and R. Loganantharaj, On the Parallel Complexity of Constraint Propagation Algorithms for Temporal Reasoning, Technical Report TR-91-2-4, Center for Advanced Computer Studies, University of Southwest Louisiana (1991)."},{"issue":"11","key":"CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0004-3702(90)90009-O","volume":"45","author":"S. Kasif","year":"1990","unstructured":"S. Kasif, On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction networks,Artificial Intelligence,45(11):275\u2013286 (1990).","journal-title":"Artificial Intelligence"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. K. Mackworth","year":"1977","unstructured":"A. K. Mackworth, Consistency in Networks of Relations,Artificial Intelligence,8:99\u2013118, (1977).","journal-title":"Artificial Intelligence"},{"key":"CR6","unstructured":"J. Gaschnig, A. Constraint Satisfaction Method for Inference Making,Proc. 12th Annual Allerton Conf. Circuit and Systems Theory, pp. 866\u2013874 (1974)."},{"key":"CR7","unstructured":"J. Gaschnig, Performance Measurement and Analysis of Certain Search Algorithms, Technical Report CMU-CS-79-124, Carnegie-Mellon University (May 1979)."},{"issue":"3","key":"CR8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TPAMI.1983.4767390","volume":"5","author":"R. A. Hummel","year":"1983","unstructured":"R. A. Hummel and S. W. Zucker, On the Foundations of Relaxation Labeling Processes,IEEE Transactions on Pattern Analysis and Machine Intelligence,5(3):267\u2013286 (May 1983).","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TPAMI.1979.4766903","volume":"1","author":"R. Haralick","year":"1979","unstructured":"R. Haralick and L. Shapiro, The Consistent Labeling Problem,IEEE Transactions on Pattern Analysis and Machine Intelligence,1(2):173\u2013183 (April 1979).","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. M. Haralick","year":"1980","unstructured":"R. M. Haralick and G. Elliot, Increasing Tree Search Efficiency for Constraint Satisfaction Problems,Artificial Intelligence,14:263\u2013313 (1980).","journal-title":"Artificial Intelligence"},{"issue":"11","key":"CR11","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J. F. Allen","year":"1983","unstructured":"J. F. Allen, Maintaining Knowledge about Temporal Intervals,Communications of the ACM,26(11):832\u2013843 (November 1983).","journal-title":"Communications of the ACM"},{"key":"CR12","series-title":"Technical Report TR89-045","volume-title":"Parallel Path Consistency Algorithms for Constraint Satisfaction","author":"Peter B. Ladkin","year":"1989","unstructured":"Peter B. Ladkin and Roger D. Maddux, Parallel Path Consistency Algorithms for Constraint Satisfaction, Technical Report TR89-045, International Computer Science Institute, Berkeley, California (August 1989)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"U. Montanari, Networks of constraints: Fundamental Properties and Application to Picture Processing,Information Sciences,7:95\u2013132 (1974).","journal-title":"Information Sciences"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","volume":"25","author":"A. K. Mackworth","year":"1985","unstructured":"A. K. Mackworth and E. C. Freuder, The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems,Artificial Intelligence,25:65\u201374, (1985).","journal-title":"Artificial Intelligence"},{"issue":"2","key":"CR15","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","volume":"28","author":"Roger Mohr","year":"1986","unstructured":"Roger Mohr and Thomas C. Henderson, Arc and Path Consistency Revisitied,Artificial Intelligence,28(2):225\u2013233 (March 1986).","journal-title":"Artificial Intelligence"},{"key":"CR16","volume-title":"Parallel Split-Level Relaxation","author":"A. K. Samal","year":"1988","unstructured":"A. K. Samal,Parallel Split-Level Relaxation, PhD Thesis, University of Utah, Salt Lake City, Utah (August 1988)."},{"issue":"5","key":"CR17","first-page":"341","volume":"16","author":"Ashok Samal","year":"1988","unstructured":"Ashok Samal and Thomas C. Henderson, Parallel Consistent Labeling Algorithms,IJPP,16(5):341\u2013364 (1988).","journal-title":"IJPP"},{"key":"CR18","volume-title":"Discrete Relaxation Techniques","author":"Thomas C. Henderson","year":"1990","unstructured":"Thomas C. Henderson,Discrete Relaxation Techniques, Oxford University Press, New York (1990)."},{"issue":"1","key":"CR19","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0004-3702(88)90081-1","volume":"36","author":"Ching-Chih Han","year":"1988","unstructured":"Ching-Chih Han and Chia-Hoang Lee, Comments on Mohr and Henderson's Path Consistency Algorithm,Artificial Intelligence,36(1):125\u2013130 (August 1988).","journal-title":"Artificial Intelligence"},{"key":"CR20","unstructured":"Rina Dechter and Itay Meiri, Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems,Proceedings of IJCAI, pp. 271\u2013277 (1989)."},{"issue":"4","key":"CR21","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1111\/j.1467-8640.1989.tb00328.x","volume":"5","author":"B. Nadel","year":"1989","unstructured":"B. Nadel, Constraint Satisfaction Algorithms,Computational Intelligence,5(4):188\u2013224 (November 1989).","journal-title":"Computational Intelligence"},{"issue":"2","key":"CR22","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1364\/AO.30.000185","volume":"30","author":"Gary C. Marsden","year":"1991","unstructured":"Gary C. Marsden, Fouad Kiamilev, Sadik Esener, and Sing H. Lee, Highly Parallel consistent Labeling Algorithm Suitable for Optoelectronic Implementation,Applied Optics,30(2):185\u2013194 (1991).","journal-title":"Applied Optics"},{"key":"CR23","unstructured":"Thinking Machines Corporation,Model CM-2 Technical Summary (April 1987)."},{"key":"CR24","volume-title":"The Connection Machine","author":"D. Hillis","year":"1985","unstructured":"D. Hillis,The Connection Machine, MIT Press, Cambridge, Massachusetts (1985)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01547895.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01547895\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01547895","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T14:08:02Z","timestamp":1556892482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01547895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["BF01547895"],"URL":"https:\/\/doi.org\/10.1007\/bf01547895","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}