{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:32:12Z","timestamp":1720625532754},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T00:00:00Z","timestamp":1416441600000},"content-version":"vor","delay-in-days":4920,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s1571-0661(04)00149-5","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T10:34:35Z","timestamp":1075977275000},"page":"45-64","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Correct Answers for First Order Logic"],"prefix":"10.1016","volume":"48","author":[{"given":"Gianluca","family":"Amato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB1","unstructured":"Amato G., \u201cSequent Calculi and Indexed Categories as a Foundation for Logic Programming,\u201d Ph.D. thesis, Dipartimento di Informatica, Universit\u00e0 di Pisa (2000)."},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB2","unstructured":"Amato G. and G. Levi, Properties of the lattice of observables in logic programming, in: M. Falaschi and M. Navarro, editors, Proceedings of the APPIA-GULP-PRODE'97 Joint Conference on Declarative Programming, 1997, pp. 175\u2013187."},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Amato G. and G. Levi, Abstract Interpretation Based Semantics of Sequent Calculi, in: J. Palsberg, editor, Static Analysis Symposium 2000, Lecture Notes in Computer Science 1824 (2000), pp. 38\u201357.","DOI":"10.1007\/978-3-540-45099-3_3"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","article-title":"Logic programming with focusing proofs in linear logic","volume":"2","author":"Andreoli","year":"1992","journal-title":"Journal of Logic and Computation"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB5","unstructured":"Armstrong T., K. Marriott, P. Schachte and H. S\u00f8ndergaard, Boolean functions for dependency analysis: Algebraic properties and efficient representation., in: B. Le Charlier, editor, Proc. Static Analysis Symposium, SAS'94, Lecture Notes in Computer Science 864 (1994), pp. 266\u2013280."},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(94)90200-3","article-title":"A Compositional Semantics for Logic Programs","volume":"122","author":"Bossi","year":"1994","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB7","first-page":"421","article-title":"Programming with full first-order logic","volume":"10","author":"Bowem","year":"1982","journal-title":"Machine Intelligence"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB8","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1145\/183432.183528","article-title":"Modular logic programming","volume":"16","author":"Brogi","year":"1994","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB9","unstructured":"Comini M., \u201cAn Abstract Interpretation Framework for Semantics and Diagnosis of Logic Programs,\u201d Ph.D. thesis, Dipartimento di Informatica, Universit\u00e1 di Pisa (1998)."},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB10","doi-asserted-by":"crossref","unstructured":"Comini M., G. Levi and M. C. Meo, A theory of observables for logic programs, Information and Computation (2001), to appear.","DOI":"10.1006\/inco.2000.3024"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0743-1066(98)10033-X","article-title":"Abstract Diagnosis","volume":"39","author":"Comini","year":"1999","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB12","doi-asserted-by":"crossref","unstructured":"Cousot P. 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, 1977, pp. 238\u2013252.","DOI":"10.1145\/512950.512973"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","article-title":"Abstract Interpretation and Applications to Logic Programs","volume":"13","author":"Cousot","year":"1992","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB14","series-title":"Advances in logic programming theory","first-page":"115","article-title":"Formal bases for dataflow analysis of logic programs","author":"Debray","year":"1994"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB15","doi-asserted-by":"crossref","unstructured":"Feferman S., Lectures on proof theory, in: M. Lob, editor, Proceedings of the Summer School in Logic, Leeds '67, Lecture Notes in Mathematics 70 (1968), pp. 1\u2013107.","DOI":"10.1007\/BFb0079094"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB16","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1093\/logcom\/6.4.491","article-title":"Resultants semantics for PROLOG","volume":"6","author":"Gabbrielli","year":"1996","journal-title":"Journal of Logic and Computation"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB17","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BF01201353","article-title":"Untersuchungen \u00fcber das logische Schliessen","volume":"39","author":"Gentzen","year":"1935","journal-title":"Mathematische Zeitschrift"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB18","series-title":"\u201cCollected Papers of Gerhard Gentzen\u201d","author":"Gentzen","year":"1969"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB19","article-title":"Permutability of inferences in Gentzen's calculi LK and LJ","volume":"10","author":"Kleene","year":"1952","journal-title":"Memoris of the AMS"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB20","series-title":"\u201cFoundations of Logic Programming\u201d","author":"Lloyd","year":"1987"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","article-title":"Uniform proofs as a foundation for Logic Programming","volume":"51","author":"Miller","year":"1991","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB22","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00881902","article-title":"A Proof Procedure for the Logic of Hereditary Harrop Formulas","volume":"11","author":"Nadathur","year":"1993","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB23","unstructured":"Nadathur G. and D. Miller, An Overview of \u03bbProlog, in: K. A. Bowen and R. A. Kowalski, editors, Fifth International Logic Programmiong Conference (1988), pp. 810\u2013827."},{"key":"10.1016\/S1571-0661(04)00149-5_NEWBIB24","unstructured":"Shankar N., Proof search in the intuitionistic sequent calculus, in: M. Stickel, editor, 10th Int. Conf. on Automated Deduction, Lecture Notes in Artifical Intelligence 449 (1990), pp. 522\u2013536."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001495?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001495?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T06:57:25Z","timestamp":1550213845000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104001495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":24,"alternative-id":["S1571066104001495"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00149-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}