{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:33:31Z","timestamp":1725485611036},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650140"},{"type":"electronic","value":"9783540497271"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49727-7_5","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T23:02:49Z","timestamp":1181170969000},"page":"82-98","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of Normal Logic Programs"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Fages","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberta","family":"Gori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,24]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 495\u2013574. Elsevier and The MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0743-1066(94)90026-4","volume":"19\u201320","author":"A. Bossi","year":"1994","unstructured":"A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: Theory and applications. Journal of Logic Programming, 19\u201320:149\u2013197, 1994.","journal-title":"Journal of Logic Programming"},{"key":"5_CR3","unstructured":"D. Chan. Constructive Negation Based on the Completed Database. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth Int\u2019l Conf. on Logic Programming, pages 111\u2013125. The MIT Press, 1988."},{"key":"5_CR4","unstructured":"A. Colmerauer. Equations and inequations on finite and infinite trees. In Proceedings of the International Conference on Fifth Generation Computer System, pages 85\u201399, 1984."},{"key":"5_CR5","unstructured":"M. Comini. Abstract Interpretation framework for Semantics and Diagnosis of Logic Programs. PhD thesis, Dipartimento di Informatica, Universit\u00e0 di Pisa, 1998."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. Fourth ACM Symp. Principles of Programming Languages, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Proc. Sixth ACM Symp. Principles of Programming Languages, pages 269\u2013282, 1979.","DOI":"10.1145\/567752.567778"},{"issue":"2 & 3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract Interpretation and Applications to Logic Programs. Journal of Logic Programming, 13(2 & 3):103\u2013179, 1992.","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"5_CR9","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. Journal of Logic Programming, 32(2):85\u2013118, 1997.","journal-title":"Journal of Logic Programming"},{"key":"5_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-61735-3_5","volume-title":"Proc. Fifth Int\u2019l Conf. on Algebraic and Logic Programming","author":"F. Fages","year":"1996","unstructured":"F. Fages and R. Gori. A hierarchy of semantics for normal constraint logic programs. In M. Hanus M. Rodriguez-Artalejo, editor, Proc. Fifth Int\u2019l Conf. on Algebraic and Logic Programming, volume 1139 of Lecture Notes in Computer Science, pages 77\u201391. Springer-Verlag, 1996."},{"key":"5_CR11","doi-asserted-by":"publisher","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":"5_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/3-540-60922-9_41","volume-title":"Proc. 13th International Symposium on Theoretical Aspects of Computer Science (STACS\u201996)","author":"R. Giacobazzi","year":"1996","unstructured":"R. Giacobazzi. \u201cOptimal\u201d collecting semantics for analysis in a hierarchy of logic program semantics. In C. Puech and R. Reischuk, editors, Proc. 13th International Symposium on Theoretical Aspects of Computer Science (STACS\u201996), volume 1046 of Lecture Notes in Computer Science, pages 503\u2013514. Springer-Verlag, 1996."},{"key":"5_CR13","unstructured":"S. Koppelberg. Handbook of Boolean Algebras (Vol.I). Elsevier Science Publisher B.V.(North Holland), 1989."},{"key":"5_CR14","doi-asserted-by":"publisher","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":"5_CR15","doi-asserted-by":"publisher","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":"5_CR16","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":"5_CR17","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987. Second edition.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"M.J. Maher. Complete axiomatizations of the algebra of finite, rational and infinite trees. In Third Symp. on Logic in Computer Science, pages 348\u2013357, 1988.","DOI":"10.1109\/LICS.1988.5132"},{"issue":"2 & 3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0743-1066(92)90031-W","volume":"13","author":"K. Marriott","year":"1992","unstructured":"K. Marriott and H. Sondergaard. Bottom-up Dataflow Analysis of Normal Logic Programs. Journal of Logic Programming, 13(2 & 3):181\u2013204, 1992.","journal-title":"Journal of Logic Programming"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0304-3975(84)90119-1","volume":"34","author":"T. Sato","year":"1984","unstructured":"T. Sato and H. Tamaki. Enumeration of Success Patterns in Logic Programs. Theoretical Computer Science, 34:227\u2013240, 1984.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/inco.1995.1048","volume":"118","author":"P. Stuckey","year":"1995","unstructured":"P. Stuckey. Negation and constraint logic programming. Information and Computation, 118(1):12\u201333, 1995.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49727-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:46:08Z","timestamp":1556466368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49727-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650140","9783540497271"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-49727-7_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}