{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:37Z","timestamp":1761597037761},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429357"},{"type":"electronic","value":"9783540456353"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45635-x_25","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T21:27:34Z","timestamp":1181165254000},"page":"255-268","source":"Crossref","is-referenced-by-count":3,"title":["Semantics of Normal Logic Programs with Embedded Implications"],"prefix":"10.1007","author":[{"given":"Fernando","family":"Orejas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edelmira","family":"Pasarella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elvira","family":"Pino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,13]]},"reference":[{"key":"25_CR1","unstructured":"A. J. Bonner and L. T. McCarty. Adding negation-as-failure to intuitionistic logic programming. In Proc. of the North American Conf. on Logic Programming, 681\u2013703, 1990."},{"issue":"20","key":"25_CR2","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0743-1066(94)90032-9","volume":"19","author":"M. Bugliesi","year":"1994","unstructured":"M. Bugliesi, E. Lamma, and Mello Paola. Modularity in logic programming. Journal of Logic Programming, 19,20:443\u2013502, 1994.","journal-title":"Journal of Logic Programming"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01185404","volume":"32","author":"W. Drabent","year":"1995","unstructured":"W. Drabent. What is a failure? An approach to constructive negation. Acta Inform\u00e1tica, 32:27\u201359, 1995.","journal-title":"Acta Inform\u00e1tica"},{"key":"25_CR4","unstructured":"S. Etalle and F. Teusink. A compositional semantics for normal open programs. In Proc. Int. Conf. and Symp. on Logic Programming\u201996. The MIT Press, 1996."},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0743-1066(96)00092-1","volume":"32","author":"F. Fages","year":"1997","unstructured":"F. Fages. Constructive negation by pruning. J. of Logic Programming, 32:85\u2013118, 1997.","journal-title":"J. of Logic Programming"},{"key":"25_CR6","unstructured":"G. Ferrand and A. Lallouet. A compositional proof method of partial correctness for normal logic programs. In Int. Logic Programming Symp., pages 209\u2013223. J. Lloyd, ed., 1995."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"L. Giordano and N. Olivi. Combining negation as failure and embedded implication in logic programs. Journal of Logic Programming, (36):91\u2013147, 1998.","DOI":"10.1016\/S0743-1066(97)10014-0"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0743-1066(98)10039-0","volume":"40","author":"P. Lucio","year":"1999","unstructured":"P. Lucio, F. Orejas, and E. Pino. An algebraic framework for the definition of compositional semantics of normal logic programs. Journal of Logic Programming, 40:89\u2013123, 1999.","journal-title":"Journal of Logic Programming"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0743-1066(89)90031-9","volume":"6","author":"D. Miller","year":"1989","unstructured":"D. Miller. A logical analysis of modules in logic programming. Journal of Logic Programming, 6:79\u2013108, 1989.","journal-title":"Journal of Logic Programming"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/S0304-3975(96)00164-8","volume":"173","author":"F. Orejas","year":"1997","unstructured":"F. Orejas, E. Pino, and H. Ehrig. Institutions for logic programming. Theoretical Computer Science, 173:485\u2013511, 1997.","journal-title":"Theoretical Computer Science"},{"key":"25_CR11","unstructured":"E. Pasarella, E. Pino, and F. Orejas. Constructive negation without subsidiary trees. In Alpuente M., editor, Proceedings of the 9th International Workshop on Functional and Logic Programming, WFLP\u20192000., pages 195\u2013209, 2000."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"J.C. Shepherson. Negation in logic programming. In J. Minker, editor, Foundations on Deductive Databases and Logic Programs, pages 19\u201388. Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/inco.1995.1048","volume":"118","author":"P. J. Stuckey","year":"1995","unstructured":"P. J. Stuckey. Negation and constraint logic programmming. Information and Computation, 118:12\u201323, 1995.","journal-title":"Information and Computation"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"D. van Dalen. Intuitionistic logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic-Vol III, 1986.","DOI":"10.1007\/978-94-009-5203-4_4"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45635-X_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T00:55:08Z","timestamp":1550364908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45635-X_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429357","9783540456353"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45635-x_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}