{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:02Z","timestamp":1725493442828},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664925"},{"type":"electronic","value":"9783540482420"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48242-3_15","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:28:09Z","timestamp":1184588889000},"page":"238-257","source":"Crossref","is-referenced-by-count":2,"title":["A Fixpoint Semantics for Reasoning about Finite Failure"],"prefix":"10.1007","author":[{"given":"Roberta","family":"Gori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_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"},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K. R. Apt","year":"1982","unstructured":"K. R. Apt and M. H. van Emden. Contributions to the theory of logic programming. Journal of the ACM, 29(3):841\u2013862, 1982.","journal-title":"Journal of the ACM"},{"key":"15_CR3","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"},{"issue":"1\u20132","key":"15_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(97)00174-6","volume":"211","author":"M. Comini","year":"1999","unstructured":"M. Comini and M. C. Meo. Compositionality properties of SLD-derivations. Theoretical Computer Science, 211(1\u20132):275\u2013309, 1999.","journal-title":"Theoretical Computer Science"},{"key":"15_CR5","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":"15_CR6","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":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages. Theoretical Computer Science, 69(3):289\u2013318, 1989.","journal-title":"Theoretical Computer Science"},{"key":"15_CR8","unstructured":"R. Gori. Which semantics for finite failure. http:\/\/www.di.unipi.it\/~sgori\/Papers\/ , 1999."},{"issue":"6","key":"15_CR9","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1093\/logcom\/7.6.753","volume":"7","author":"R. Gori","year":"1997","unstructured":"R. Gori and G. Levi. Finite failure is and-compositional. Journal of Logic and Computation, 7(6):753\u2013776, 1997.","journal-title":"Journal of Logic and Computation"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"R. Gori and G. Levi. On verification of finite failure. In Gopalan Nadathur, editor, Proc. Principles and Practice of Declarative Programming 1999, 1999.","DOI":"10.1007\/10704567_19"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","volume":"29","author":"J.-L. Lassez","year":"1984","unstructured":"J.-L. Lassez and M. J. Maher. Closures and Fairness in the Semantics of Programming Logic. Theoretical Computer Science, 29:167\u2013184, 1984.","journal-title":"Theoretical Computer Science"},{"key":"15_CR12","unstructured":"G. Levi, M. Martelli, and C. Palamidessi. Failure and success made symmetric. In S. K. Debray and M. Hermenegildo, editors, Proc. North American Conf. on Logic Programming\u201990, pages 3\u201322. The MIT Press, 1990."},{"key":"15_CR13","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"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming and Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48242-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:38:39Z","timestamp":1556667519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48242-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664925","9783540482420"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48242-3_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}