{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:05:47Z","timestamp":1725663947103},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540554370"},{"type":"electronic","value":"9783540470731"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55437-8_88","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:04:37Z","timestamp":1330250677000},"page":"289-315","source":"Crossref","is-referenced-by-count":0,"title":["Negation in conclog"],"prefix":"10.1007","author":[{"given":"J. -M.","family":"Jacquet","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"22_CR1","unstructured":"APT K.P., Introduction to Logic Programming, in: J. van Leuwen (editor), Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, Elsevier and The MIT Press, 1990, pp. 493\u2013574."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"BARBUTI R., MANCARELLA P., PEDRESCHI D., TURINI F., Intensional Negation in Logic Programs: Examples and Implementation Techniques, Proc. TAPSOFT '87, LNCS 250, 1987, pp. 96\u2013110.","DOI":"10.1007\/BFb0014975"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0743-1066(90)90023-X","volume":"8","author":"R. Barbuti","year":"1990","unstructured":"BARBUTI R., MANCARELLA P., PEDRESCHI D., TURINI F., A Transformational Approach to Negation in Logic Programming, Journal of Logic Programming 8, 1990, pp. 201\u2013228.","journal-title":"Journal of Logic Programming"},{"key":"22_CR4","unstructured":"CHAN D., Constructive Negation Based on the Completed Database, Proc. 5th Conf. on Logic Programming, 1988, pp. 111\u2013125."},{"key":"22_CR5","unstructured":"CHAN D., An Extension of Constructive Negation and its Application in Coroutining, Proc. of the North American Conference on Logic Programming, 1989, pp. 477\u2013496."},{"key":"22_CR6","unstructured":"CLOCKSIN W.F., MELLISH C.S., Programming in Prolog, Springer Verlag, 1981."},{"key":"22_CR7","unstructured":"CONERY J.S., The And\/Or Process Model for Parallel Interpretation of Logic Programs, Ph.D. thesis, University of California, 1983."},{"key":"22_CR8","unstructured":"DEVILLE Y., Logic Programming: Systematic Program Development, Addison-Wesley, 1990."},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0747-7171(85)80027-4","volume":"1","author":"E. Eder","year":"1985","unstructured":"EDER E., Properties of Substitutions and Unifications, Journal of Symbolic Computation, 1, 1985, pp. 31\u201346.","journal-title":"Journal of Symbolic Computation"},{"key":"22_CR10","unstructured":"GIANNESINI F., KANOUI H., PASSERO R., VAN CANEGHEM M., Prolog, Intereditions, 1986."},{"key":"22_CR11","volume-title":"Ph.D. thesis","author":"J.-M. Jacquet","year":"1989","unstructured":"JACQUET J.-M., Conclog: a Methodological Approach to Concurrent Logic Programming, Ph.D. thesis, University of Namur, Belgium, November 1989, to appear as Lecture Notes in Computer Science, Springer-Verlag."},{"key":"22_CR12","unstructured":"KALE L.V., Parallel Execution of Logic Programs: the REDUCE-OR Process Model, Proc. 4th Int. Conf. on Logic Programming, May 1987, pp. 616\u2013632."},{"key":"22_CR13","unstructured":"KHABAZA T., Negation as Failure and Parallelism, Proc. Int. Conf. on Logic Programming, 1984, pp. 70\u201375."},{"key":"22_CR14","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/B978-0-934613-40-8.50019-1","volume-title":"Foundations of deductive databses and logic programming","author":"J.L. Lassez","year":"1988","unstructured":"LASSEZ J.L., MAHER M.J., MARRIOT K., Unification revisited, In Minker J. (editor), Foundations of deductive databses and logic programming, Morgan Kaufmann, Los Altos, 1988, pp. 587\u2013626."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"LI P.P., MARTIN A.J., The Sync Model: A Parallel Execution Method for Logic Programming, Proc. Symp. on Logic Programming, 1986, pp 223\u2013235.","DOI":"10.21236\/ADA442971"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"LLOYD J.W., Foundation of Logic Programming, Springer Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"22_CR17","unstructured":"LUGIEZ D., A Deduction Procedure for First Order Programs, Proc. 6th Int. Conf. on Logic Programming, 1989, pp. 585\u2013599."},{"key":"22_CR18","unstructured":"MALUSZINSKI J., NASLUND T., Fail Substitutions for Negation as Failure, Proc. of the North American Conference on Logic Programming, 1989, pp. 461\u2013476."},{"issue":"No.2","key":"22_CR19","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"MARTELLI A., MONTANARI U., An Efficient Unification Algorithm, TOPLAS, vol. 4, No. 2, April 1982, pp. 258\u2013282.","journal-title":"TOPLAS"},{"key":"22_CR20","volume-title":"Ph.D. Thesis","author":"L. Naish","year":"1985","unstructured":"NAISH L., Negation and Control in Prolog, Ph.D. Thesis, University of Melbourne, Australia, 1985."},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"PALAMIDESSI C., Algebraic Properties of Idempotent Substitutions, Proc. of the 17th ICALP, 1990, pp. 386\u2013399.","DOI":"10.1007\/BFb0032046"},{"key":"22_CR22","volume-title":"Ph. D. thesis","author":"G.H. Pollard","year":"1981","unstructured":"POLLARD G.H., Parallel Execution of Horn Clause Programs, Ph. D. thesis, Dept. of Computing, Imperial College, London, 1981."},{"key":"22_CR23","unstructured":"PRZYMUSINSKI T., On Constructive Negation in Logic Programming, Proc. of the North American Conference on Logic Programming, 1989."},{"key":"22_CR24","unstructured":"SATO T., TAMAKI H., Transformational Logic Program Synthesis, Proc. of FGCS, 1984, pp. 195\u2013201."},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"TARNLUND S.A., Horn clause computability, BIT 17, pp. 215\u2013226, 1977.","DOI":"10.1007\/BF01932293"},{"key":"22_CR26","unstructured":"TURI D., Extending S-Models to Logic Programs with Negation, to appear in Proc. 8th Int. Conf. on Logic Programming, 1991."},{"key":"22_CR27","unstructured":"WALLACE M., Negation By Constraints: a Sound and Efficient Implementation of Negation in Deductive Databases, Proc. Int. Symp. on Logic Programming, 1987, pp. 253\u2013263."}],"container-title":["Lecture Notes in Computer Science","Parallel Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55437-8_88.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:54Z","timestamp":1605646734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55437-8_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540554370","9783540470731"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-55437-8_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}