{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:18:41Z","timestamp":1742617121980,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600435"},{"type":"electronic","value":"9783540494102"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60043-4_78","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:34:18Z","timestamp":1330277658000},"page":"561-575","source":"Crossref","is-referenced-by-count":6,"title":["Partial order programming (Revisited)"],"prefix":"10.1007","author":[{"given":"Bharat","family":"Jayaraman","sequence":"first","affiliation":[]},{"given":"Mauricio","family":"Osorio","sequence":"additional","affiliation":[]},{"given":"Kyonghee","family":"Moon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,25]]},"reference":[{"key":"36_CR1","unstructured":"A. Aho and J.D. Ullman, \u201cSymp. on Principles of Compiler Design,\u201d Addison-Wesley, 1977."},{"key":"36_CR2","unstructured":"V. Breazu-Tannen, P. Buneman, and S. Naqvi, \u201cStructural Recursion as a Query Language,\u201d Proc. 3rd Intl. Workshop on Database Programming Languages, 1991."},{"key":"36_CR3","unstructured":"A. Dovier and G. Rossi, \u201cEmbedding Extensional Finite Sets in CLP,\u201d Proc. Intl. Symp. on Logic Programming, pp. 540\u2013556, MIT Press, 1993."},{"key":"36_CR4","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19\/20","author":"M. Hanus","year":"1994","unstructured":"M. Hanus, \u201cThe Integration of Functions into Logic Programming: From Theory to Practice,\u201d J. of Logic Programming, (19\/20):583\u2013628, 1994.","journal-title":"J. of Logic Programming"},{"issue":"4","key":"36_CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0743-1066(92)90005-N","volume":"12","author":"B. Jayaraman","year":"1992","unstructured":"B. Jayaraman, \u201cImplementation of Subset-Equational Programs,\u201d J. of Logic Programming, 12(4):299\u2013324, 1992.","journal-title":"J. of Logic Programming"},{"key":"36_CR6","unstructured":"B. Jayaraman and K. Moon, \u201cImplementation of Subset-Logic Programs,\u201d Submitted for publication."},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Jayaraman, B. and D. A. Plaisted, \u201cFunctional Programming with Sets,\u201d Proc. Third Intl. Conf. on Functional Programming and Computer Architecture, pp. 194\u2013210, Springer-Verlag, 1987.","DOI":"10.1007\/3-540-18317-5_12"},{"key":"36_CR8","unstructured":"Jayaraman, B. and D. A. Plaisted, \u201cProgramming with Equations, Subsets, and Relations,\u201d Proc. N. American Conf. on Logic Programming, pp. 1051\u20131068, MIT Press, 1989."},{"key":"36_CR9","unstructured":"D.B. Kemp and P.J. Stuckey, \u201cSemantics of Logic Programs with Aggregates,\u201d Proc. Intl. Symp. on Logic Programming, pp. 387\u2013401, MIT Press, 1991."},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, \u201cFoundations of Logic Programming,\u201d (2 ed.) Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"36_CR11","volume-title":"Technical Report 93-040","author":"B. Jayaraman","year":"1993","unstructured":"B. Jayaraman, M. Osorio and K. Moon, \u201cPartial Order Logic Programming,\u201d Technical Report 93-040, Department of Computer Science, SUNY-Buffalo, November 1993."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"T. Przymusinski, \u201cOn the Declarative Semantics of Stratified Deductive Databases and Logic Programs,\u201d Proc. Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), pp. 193\u2013216, Morgan-Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"S. Parker, \u201cPartial Order Programming,\u201d Proc. 16th Symp. on Principles of Programming Languages, pp. 260\u2013266, ACM Press, 1989.","DOI":"10.1145\/75277.75300"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"K.A. Ross and Y. Sagiv, \u201cMonotonic Aggregation in Deductive Databases,\u201d Proc. 11th Symp. on Principles of Database Systems, pp. 114\u2013126, ACM Press, 1992.","DOI":"10.1145\/137097.137852"},{"key":"36_CR15","unstructured":"S. Sudarshan, D. Srivastava, R. Ramakrishnan, and C. Beeri, \u201cExtending the Well-Founded and Valid Semantics for Aggregation,\u201d Proc. Intl. Symp. on Logic Programming, pp. 590\u2013608, MIT Press, 1993."},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, \u201cThe Well-Founded Semantics of Aggregation,\u201d Proc. 11th Symp. on Principles of Database Systems, pp. 127\u2013138, ACM Press, 1992.","DOI":"10.1145\/137097.137854"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60043-4_78.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:51:37Z","timestamp":1742597497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60043-4_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600435","9783540494102"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-60043-4_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}