{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:07Z","timestamp":1725455647598},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540571841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022561","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:14:45Z","timestamp":1131862485000},"page":"132-143","source":"Crossref","is-referenced-by-count":0,"title":["The inverse of fitting's functional"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Bottoni","sequence":"first","affiliation":[]},{"given":"Giorgio","family":"Levi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"A. Bottoni. La riscrittura completa \u00e8 l'inverso del funzionale di Fitting. Master's thesis, Dipartimento di Informatica, Universit\u00e0 di Pisa, 1992. In italian."},{"key":"15_CR2","unstructured":"A. Bottoni. CET Standard Forms. Technical report, Dipartimento di Informatica, Universit\u00e0 di Pisa, 1993."},{"key":"15_CR3","unstructured":"A. Bottoni. Complete Constraints Extraction for First Order CLP. Technical report, Dipartimento di Matematica Pura ed Applicata, Universit\u00e0 di Padova, 1993."},{"key":"15_CR4","unstructured":"P. Bruscoli, F. Levi, G. Levi, and M. C. Meo. Compilative constructive negation in CLP. Technical report, Dipartimento di Informatica, Universit\u00e0 di Pisa, 1992."},{"key":"15_CR5","first-page":"111","volume-title":"Constructive Negation Based on the Completed Database","author":"D. Chan","year":"1988","unstructured":"D. Chan. Constructive Negation Based on the Completed Database. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth Int'l Conf. on Logic Programming, pages 111\u2013125. The MIT Press, Cambridge, Mass., 1988."},{"key":"15_CR6","first-page":"477","volume-title":"An Extension of Constructive Negation and its Application in Coroutining","author":"D. Chan","year":"1989","unstructured":"D. Chan. An Extension of Constructive Negation and its Application in Coroutining. In E. Lusk and R. Overbeek, editors, Proc. North American Conf. on Logic Programming'89, pages 477\u2013493. The MIT Press, Cambridge, Mass., 1989."},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K. L. Clark","year":"1978","unstructured":"K. L. Clark. Negation as Failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293\u2013322. Plenum Press, New York, 1978."},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"2","author":"M. Fitting","year":"1985","unstructured":"M. Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2:295\u2013312, 1985.","journal-title":"Journal of Logic Programming"},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"K. Kunen. Negation in logic programming. Journal of Logic Programming, 4:289\u2013308, 1987.","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"15_CR10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","volume":"7","author":"K. Kunen","year":"1989","unstructured":"K. Kunen. Signed Data Dependencies in Logic Programs. Journal of Logic Programming, 7(3):231\u2013245, 1989.","journal-title":"Journal of Logic Programming"},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/B978-0-934613-40-8.50019-1","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"J.-L. Lassez","year":"1988","unstructured":"J.-L. Lassez, M. J. Maher, and K. Marriott. Unification Revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587\u2013625. Morgan Kaufmann, Los Altos, Ca., 1988."},{"key":"15_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1987","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987."},{"issue":"3","key":"15_CR13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","volume":"1","author":"J. W. Lloyd","year":"1984","unstructured":"J. W. Lloyd and R. W. Topor. Making PROLOG More Expressive. Journal of Logic Programming, 1(3):225\u2013240, 1984.","journal-title":"Journal of Logic Programming"},{"key":"15_CR14","first-page":"585","volume-title":"A deduction procedure for first order programs","author":"D. Lugiez","year":"1989","unstructured":"D. Lugiez. A deduction procedure for first order programs. In G. Levi and M. Martelli, editors, Proc. Sixth Int'l Conf. on Logic Programming, pages 585\u2013600. The MIT Press, Cambridge, Mass., 1989."},{"key":"15_CR15","unstructured":"J. A. Robinson. Beyond LOGLISP: combining functional and relational programming in a reduction setting. In D. Michie and Hayes-Michie, editors, Machine Intelligence 11. Oxford University Press, 1985."},{"key":"15_CR16","first-page":"35","volume-title":"A Complete Top-down Interpreter for First Order Programs","author":"T. Sato","year":"1991","unstructured":"T. Sato, F. Motoyoshi. A Complete Top-down Interpreter for First Order Programs. In V. Saraswat and K. Ueda, editors, Proc. International Symposium on Logic Programming'91, pages 35\u201353. The MIT Press, Cambridge, Mass., 1991."},{"issue":"6","key":"15_CR17","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1093\/logcom\/1.6.811","volume":"1","author":"R. F. St\u00e4rk","year":"1991","unstructured":"R. F. St\u00e4rk. A Complete Axiomatization of the Three valued Completion of Logic Programs. Journal of Logic and Computation, 1(6):811\u2013834, 1991.","journal-title":"Journal of Logic and Computation"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"P. J. Stuckey. Constructive Negation for Constraint Logic Programming. In Proc. Sixth IEEE Symp. on Logic In Computer Science. IEEE Comp. Soc. Press, 1991.","DOI":"10.1109\/LICS.1991.151657"}],"container-title":["Lecture Notes in Computer Science","Computational Logic and Proof Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022561.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:49:01Z","timestamp":1607550541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022561"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540571841"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0022561","relation":{},"subject":[]}}