{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:06Z","timestamp":1725663666060},"publisher-location":"Berlin, Heidelberg","reference-count":80,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565963"},{"type":"electronic","value":"9783540475958"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56596-5_35","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:17:47Z","timestamp":1330237067000},"page":"204-235","source":"Crossref","is-referenced-by-count":0,"title":["New semantic tools for logic programming"],"prefix":"10.1007","author":[{"given":"Maurizio","family":"Gabbrielli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Levi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Martelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"10_CR1","volume-title":"Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics","author":"K. R. Apt","year":"1990","unstructured":"K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics. Elsevier. Amsterdam and The MIT Press, Cambridge, 1990."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K. R. Apt","year":"1988","unstructured":"K. R. Apt, H. Blair, and A. Walker. Towards a Theory of Declarative Knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89\u2013148. Morgan Kaufmann, Los Altos, Ca., 1988."},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/978-3-642-76274-1_9","volume-title":"Computational Logic","author":"K. R. Apt","year":"1990","unstructured":"K. R. Apt and D. Pedreschi. Studies in Pure Prolog: Termination. In J. W. Lloyd, editor, Computational Logic, pages 150\u2013176. Springer-Verlag, Berlin, 1990."},{"key":"10_CR4","first-page":"265","volume-title":"Volume 526 of Lecture Notes in Computer Science","author":"K. R. Apt","year":"1991","unstructured":"K. R. Apt and D. Pedreschi. Proving Termination of General Prolog Programs. In T. Ito and A.R. Meyer, editors, Proc. of Int. Conf. on Theoretical Aspects of Computer Software, Volume 526 of Lecture Notes in Computer Science, pages 265\u2013289. Springer-Verlag, Berlin, 1991."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"R. Barbuti, M. Codish, R. Giacobazzi, and G. Levi. Modelling Prolog Control. In Proc. Nineteenth Annual ACM Symp. on Principles of Programming Languages, pages 95\u2013104. ACM Press, 1992.","DOI":"10.1145\/143165.143186"},{"key":"10_CR6","unstructured":"R. Barbuti and R. Giacobazzi. A Bottom-up Polymorphic Type Inference in Logic Programming. Technical Report TR 27\/89, Dipartimento di Informatica, Universit\u00e0 di Pisa, 1989. To appear in Science of Computer Programming."},{"key":"10_CR7","unstructured":"R. Barbuti, R. Giacobazzi, and G. Levi. A Declarative Abstract Semantics for Logic Programs. In A. Bertoni, C. B\u00f6hm, and P. Miglioli. editors, Proc. of the Third Italian Conference on Theoretical Computer Science, pages 84\u201396. World Scientific. 1989."},{"key":"10_CR8","unstructured":"R. Barbuti, R. Giacobazzi, and G. Levi. A Declarative Approach to Abstract Interpretation of Logic Programs. Technical Report TR 20\/89. Dipartimento di Informatica. Universit\u00e0 di Pisa. 1989."},{"key":"10_CR9","unstructured":"R. Barbuti, R. Giacobazzi, and G. Levi. A General Framework for Semantics-based Bottom-up Abstract Interpretation of Logic Programs. Technical Report TR 12\/91, Dipartimento di Informatica, Universit\u00e0 di Pisa. 1991. To appear in ACM Transactions on Programming Languages and Systems."},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0743-1066(90)90023-X","volume":"8","author":"R. Barbuti","year":"1990","unstructured":"R. Barbuti, P. Mancarella, D. Pedreschi, and F. Turini. A transformational approach to negation in logic programming. Journal of Logic Programming. 8:201\u2013228, 1990.","journal-title":"Journal of Logic Programming"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"A. Bossi, M. Bugliesi, M. Gabbrielli, G. Levi, and M. C. Meo. Differential logic programming. In Proc. Twentieth Annual ACM Symp. on Principles of Programming Languages. ACM Press, 1993.","DOI":"10.1145\/158511.158689"},{"key":"10_CR12","unstructured":"A. Bossi and N. Cocco. Basic transformation operations for logic programs which preserve computed answer substitutions. Journal of Logic Programming. 1991. To appear."},{"key":"10_CR13","unstructured":"A. Bossi, M. Gabbrielli, G. Levi. and M. C. Meo. Contributions to the Semantics of Open Logic Programs. Technical Report TR 17\/91. Dipartimento di Informatica. Universit\u00e0 di Pisa, 1991."},{"key":"10_CR14","unstructured":"A. Bossi, M. Gabbrielli, G. Levi, and M. C. Meo. Contributions to the Semantics of Open Logic Programs. In Proceedings of the International Conference on Fifth Generation Computer Systems 1992, pages 570\u2013580, 1992."},{"key":"10_CR15","unstructured":"A. Bossi and M. Menegus. Una Semantica Composizionale per Programmi Logici Aperti. In P. Asirelli, editor, Proc. Sixth Italian Conference on Logic Programming, pages 95\u2013109, 1991."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"F. Bry. Logic Programming as Constructivism: A Formalization and its Application to Databases. In Proc. Eighth ACM Symp. on Principles of Database Systems, 1989.","DOI":"10.1145\/73721.73725"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"F. Bry. Negation in Logic Programming: A Formalization in Constructive Logic. In Proc. First Workshop on Information Systems and Artificial Intelligence, Ulm, West Germany, 1990.","DOI":"10.1007\/3-540-53557-8_20"},{"key":"10_CR18","unstructured":"M. Bugliesi. A Declarative View of Inheritance in Logic Programming. In Proc. 3rd Workshop on Extensions of Logic Programming, pages 141\u2013143, 1992."},{"key":"10_CR19","first-page":"111","volume-title":"Proc. Fifth Int'l Conf. on Logic Programming","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":"10_CR20","volume-title":"Report DOC 79\/59","author":"K. L. Clark","year":"1979","unstructured":"K. L. Clark. Predicate logic as a computational formalism. Res. Report DOC 79\/59, Imperial College, Dept. of Computing. London. 1979."},{"key":"10_CR21","volume-title":"Technical report, Dept. of Computer Science","author":"M. Codish","year":"1990","unstructured":"M. Codish, D. Dams, and E. Yardeni. Bottom-up Abstract Interpretation of Logic Programs. Technical report, Dept. of Computer Science. The Weizmann Institute. Rehovot, 1990. To appear in Theoretical Computer Science."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"M. Codish, S. K. Debray, and R. Giacobazzi. Compositional Analysis of Modular Logic Programs. In Proc. Twentieth Annual ACM Symp. on Principles of Programming Languages. ACM Press, 1993.","DOI":"10.1145\/158511.158703"},{"key":"10_CR23","first-page":"99","volume-title":"Proc. North American Conf. on Logic Programming'90","author":"F. S. Boer de","year":"1990","unstructured":"F. S. de Boer and C. Palamidessi. Concurrent logic languages: Asynchronism and language comparison. In S. Debray and M. Hermenegildo, editors, Proc. North American Conf. on Logic Programming'90, pages 99\u2013114. The MIT Press. Cambridge. Mass., 1990."},{"key":"10_CR24","first-page":"175","volume-title":"Volume 458 of Lecture Notes in Computer Science","author":"F. S. Boer de","year":"1990","unstructured":"F. S. de Boer and C. Palamidessi. On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences. In J.C.M. Baeten and J.W. Klop, editors, Proc. of Concur 90. Volume 458 of Lecture Notes in Computer Science, pages 175\u2013194. Springer-Verlag, Berlin, 1990."},{"key":"10_CR25","unstructured":"G. Delzanno and M. Martelli. S-semantica per modellare insiemi di soluzioni. In S. Costantini, editor, Proc. Seventh Italian Conference on Logic Programming, 1992."},{"key":"10_CR26","first-page":"511","volume-title":"STACS 91. volume 480 of Lecture Notes in Computer Science","author":"F. Denis","year":"1991","unstructured":"F. Denis and J.-P. Delahaye. Unfolding. Procedural and Fixpoint Semantics of Logic Programs. In C. Choffrut and M. Jantzen, editors. STACS 91. volume 480 of Lecture Notes in Computer Science, pages 511\u2013522, Springer-Verlag, Berlin, 1991."},{"key":"10_CR27","unstructured":"P. Deransart and G. Ferrand. Programmation en logique avec negation: presentation formelle. Technical Report No. 87\/3. Lab. d'Informatique. D\u00e9partement de Math\u00e9matiques et d'Informatique, Universit\u00e9 d'Orl\u00e9ans. 1987."},{"key":"10_CR28","unstructured":"A. Dovier, E. G. Omodeo, E. Pontelli, and G. Rossi. A Logic Programming Language with Finite Sets. In GULP '91: Atti del Sesto Convegno sulla Programmazione Logica. pages 241\u2013255, 1991."},{"key":"10_CR29","first-page":"604","volume-title":"Proc. North American Conf. on Logic Progmmming'89","author":"P. M. Dung","year":"1989","unstructured":"Phan Minh Dung and K. Kanchanasut. A Fixpoint Approach to Declarative Semantics of Logic Programs. In E. Lusk and R. Overbeek. editors. Proc. North American Conf. on Logic Progmmming'89, pages 604\u2013625. The MIT Press. Cambridge. Mass., 1989."},{"key":"10_CR30","first-page":"234","volume-title":"Abduction compared with Negation by Failure","author":"K. Eshghi","year":"1989","unstructured":"K. Eshghi and R. A. Kowalski. Abduction compared with Negation by Failure. In G. Levi and M. Martelli. editors. Proc. Sixth Int'l Conf. on Logic Programming. pages 234\u2013254. The MIT Press, Cambridge. Mass., 1989."},{"key":"10_CR31","first-page":"364","volume-title":"Finite failures and partial computations in concurrent logic languages","author":"M. Falaschi","year":"1988","unstructured":"M. Falaschi and G. Levi. Finite failures and partial computations in concurrent logic languages. In R. A. Kowalski and K. A. Bowen, editors, Proc. Int'l Conf. on Fifth Generation Computer Systems, pages 364\u2013373. Institute for New Generation Computer Technology, Tokyo, 1988. versione estesa in [32]."},{"key":"10_CR32","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(90)90061-L","volume":"75","author":"M. Falaschi","year":"1990","unstructured":"M. Falaschi and G. Levi. Finite failures and partial computations in concurrent logic languages. Theoretical Computer Science, 75:45\u201366, 1990.","journal-title":"Theoretical Computer Science"},{"key":"10_CR33","first-page":"993","volume-title":"Proc. Fifth Int'l Conf. on Logic Programming","author":"M. Falaschi","year":"1988","unstructured":"M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. A new Declarative Semantics for Logic Languages. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth Int'l Conf. on Logic Programming, pages 993\u20131005. The MIT Press, Cambridge, Mass., 1988."},{"issue":"3","key":"10_CR34","doi-asserted-by":"crossref","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":"10_CR35","unstructured":"M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs. Technical Report TR 32\/89, Dipartimento di Informatica, Universit\u00e0 di Pisa, 1989. To appear in Information and Computation."},{"issue":"1","key":"10_CR36","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/S0019-9958(84)80021-2","volume":"60","author":"M. Falaschi","year":"1984","unstructured":"M. Falaschi, G. Levi, and C. Palamidessi. A Synchronization Logic: Axiomatics and Formal Semantics of Generalized Horn Clauses. Information and Control, 60(1):36\u201369, 1984.","journal-title":"Information and Control"},{"key":"10_CR37","unstructured":"G. Ferrand. A reconstruction of Logic Programming with Negation. Technical Report No. 86\/5, Lab. d'Informatique, D\u00e9partement de Math\u00e9matiques et d'Informatique, Universit\u00e9 d'Orl\u00e9ans, 1986."},{"key":"10_CR38","first-page":"204","volume-title":"volume 463 of Lecture Notes in Computer Science","author":"M. Gabbrielli","year":"1990","unstructured":"M. Gabbrielli and G. Levi. Unfolding and Fixpoint Semantics of Concurrent Constraint Programs. In H. Kirchner and W. Wechler. editors. Proc. Second Int'l Conf. on Algebraic and Logic Programming, volume 463 of Lecture Notes in Computer Science, pages 204\u2013216. Springer-Verlag, Berlin, 1990."},{"key":"10_CR39","first-page":"238","volume-title":"Proc. Eighth Int'l Conf. on Logic Programming","author":"M. Gabbrielli","year":"1991","unstructured":"M. Gabbrielli and G. Levi. Modeling Answer Constraints in Constraint Logic Programs. In K. Furukawa, editor, Proc. Eighth Int'l Conf. on Logic Programming, pages 238\u2013252. The MIT Press, Cambridge, Mass., 1991."},{"key":"10_CR40","first-page":"1","volume-title":"volume 510 of Lecture Notes in Computer Science","author":"M. Gabbrielli","year":"1991","unstructured":"M. Gabbrielli and G. Levi. On the Semantics of Logic Programs. In J. Leach Albert, B. Monien, and M. Rodriguez-Artalejo, editors, Automata, Languages and Programming, 18th International Colloquium, volume 510 of Lecture Notes in Computer Science, pages 1\u201319. Springer-Verlag, Berlin, 1991."},{"key":"10_CR41","unstructured":"M. Gabbrielli and G. Levi. Unfolding and Fixpoint Semantics of Concurrent Constraint Programs. Technical Report TR 2\/91. Dipartimento di Informatica. Universit\u00e0 di Pisa. 1991. To appear in Theoretical Computer Science."},{"key":"10_CR42","first-page":"297","volume-title":"volume 624 of Lecture Notes in Artificial Intelligence","author":"M. Gabbrielli","year":"1992","unstructured":"M. Gabbrielli, G. Levi, and D. Turi. A Two Steps Semantics for Logic Programs with Negation. In A. Voronkov, editor, Proceedings of the Int'l Conf. on Logic Programming and Automated Reasoning, volume 624 of Lecture Notes in Artificial Intelligence, pages 297\u2013308. Springer-Verlag, Berlin, 1992."},{"key":"10_CR43","first-page":"84","volume-title":"Volume 632 of Lecture Notes in Computer Science","author":"M. Gabbrielli","year":"1992","unstructured":"M. Gabbrielli and M. C. Meo. Fixpoint Semantics for Partial Computed Answer Substitutions and Call Patterns. In H. Kirchner and G. Levi. editors. Algebraic and Logic Programming, Proceedings of the Third International Conference. Volume 632 of Lecture Notes in Computer Science, pages 84\u201399. Springer-Verlag. Berlin. 1992."},{"key":"10_CR44","first-page":"553","volume-title":"Proc. North American Conf. on Logic Programming'89","author":"H. Gaifman","year":"1989","unstructured":"H. Gaifman, M. J. Maher, and E. Y. Shapiro. Reactive Behavior Semantics for Concurrent Constraint Logic Programs. In E. Lusk and R. Overbeek, editors. Proc. North American Conf. on Logic Programming'89. pages 553\u2013572. The MIT Press. Cambridge. Mass., 1989."},{"key":"10_CR45","doi-asserted-by":"crossref","unstructured":"H. Gaifman and E. Shapiro. Fully abstract compositional semantics for logic programs. In Proc. Sixteenth Annual ACM Symp. on Principles of Programming Languages. pages 134\u2013142. ACM, 1989.","DOI":"10.1145\/75277.75289"},{"key":"10_CR46","doi-asserted-by":"crossref","unstructured":"H. Gaifman and E. Shapiro. Proof theory and semantics of logic programs. In Proc. Fourth IEEE Symp. on Logic In Computer Science. pages 50\u201362. IEEE Computer Society Press. 1989.","DOI":"10.1109\/LICS.1989.39158"},{"key":"10_CR47","unstructured":"R. Giacobazzi, S. Debray, and G. Levi. A Generalized Semantics for Constraint Logic Programs. In Proceedings of the International Conference on Fifth Generation Computer Systems 1992, pages 581\u2013591, 1992."},{"key":"10_CR48","first-page":"291","volume-title":"Proc. Seventh Int'l Conf. on Logic Programming","author":"R. Giacobazzi","year":"1990","unstructured":"R. Giacobazzi and L. Ricci. Pipeline Optimizations in AND-Parallelism by Abstract Interpretation. In D. H. D. Warren and P. Szeredi, editors, Proc. Seventh Int'l Conf. on Logic Programming, pages 291\u2013305. The MIT Press. Cambridge, Mass., 1990."},{"key":"10_CR49","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. Fourteenth Annual ACM Symp. on Principles of Programming Languages, pages 111\u2013119. ACM, 1987.","DOI":"10.1145\/41625.41635"},{"key":"10_CR50","unstructured":"J. Jaffar and J.-L. Lassez. Constraint Logic Programming. Technical report, Department of Computer Science, Monash University, June 1986."},{"key":"10_CR51","unstructured":"J. Jaffar, J.-L. Lassez, and M. J. Maher. PROLOG-II an n instance of the logic programming language scheme. In M. Wirsing, editor, Formal Descriptions of Programming Concepts. North-Holland, 1986."},{"key":"10_CR52","first-page":"1051","volume-title":"Proc. North American Conf. on Logic Programming '89","author":"B. Jayaraman","year":"1989","unstructured":"B. Jayaraman and D. A. Plaisted. Programming with Equations, Subsets and Relations. In E. Lusk and R. Overbeek, editors, Proc. North American Conf. on Logic Programming '89, pages 1051\u20131068. The MIT Press, Cambridge. Mass., 1989."},{"key":"10_CR53","first-page":"217","volume-title":"Volume 463 of Lecture Notes in Computer Science","author":"K. Kanchanasut","year":"1990","unstructured":"K. Kanchanasut and P. Stuckey. Eliminating Negation from Normal Logic Programs. In H. Kirchner and W. Wechler, editors, Proc. Second Int'l Conf. on Algebraic and Logic Programming, Volume 463 of Lecture Notes in Computer Science, pages 217\u2013231. Springer-Verlag, Berlin, 1990."},{"key":"10_CR54","first-page":"413","volume-title":"Proc. Int'l Conf. on Fifth Generation Computer Systems","author":"T. Kawamura","year":"1988","unstructured":"T. Kawamura and T. Kanamori. Preservation of Stronger Equivalence in Unfold\/Fold Logic Programming Transformation. In Proc. Int'l Conf. on Fifth Generation Computer Systems, pages 413\u2013422. Institute for New Generation Computer Technology, Tokyo, 1988."},{"key":"10_CR55","first-page":"506","volume-title":"Proc. North American Conf. on Logic Programming'90","author":"R. Kemp","year":"1990","unstructured":"R. Kemp and G. Ringwood. An Algebraic Framework for the Abstract Interpretation of Logic Programs. In S. Debray and M. Hermenegildo, editors, Proc. North American Conf. on Logic Programming'90, pages 506\u2013520. The MIT Press. Cambridge, Mass., 1990."},{"key":"10_CR56","volume-title":"Elements of Mathematical Logic (Model Theory)","author":"G. Kreisel","year":"1967","unstructured":"G. Kreisel and J. L. Krivine. Elements of Mathematical Logic (Model Theory). North-Holland, Amsterdam, 1967."},{"key":"10_CR57","doi-asserted-by":"crossref","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":"10_CR58","first-page":"16","volume-title":"Proc. Fifth Int'l Conf. on Logic Programming","author":"G. Levi","year":"1988","unstructured":"G. Levi. Models, Unfolding Rules and Fixpoint Semantics. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth Int'l Conf. on Logic Programming. pages 16\u201319. The MIT Press, Cambridge, Mass., 1988."},{"key":"10_CR59","unstructured":"G. Levi and P. Mancarella. The Unfolding Semantics of Logic Programs. Technical Report TR-13\/88, Dipartimento di Informatics. Universit\u00e0 di Pisa. 1988."},{"key":"10_CR60","first-page":"3","volume-title":"Proc. North American Conf. on Logic Programming'90","author":"G. Levi","year":"1990","unstructured":"G. Levi, M. Martelli, and C. Palamidessi. Failure and success made symmetric. In S. Debray and M. Hermenegildo. editors. Proc. North American Conf. on Logic Programming'90, pages 3\u201322. The MIT Press, Cambridge. Mass., 1990."},{"key":"10_CR61","first-page":"877","volume-title":"Proc. Fourth Int'l Conf. on Logic Programming","author":"G. Levi","year":"1987","unstructured":"G. Levi and C. Palamidessi. An approach to the declarative semantics of synchronization in logic languages. In J.-L. Lassez. editor. Proc. Fourth Int'l Conf. on Logic Programming, pages 877\u2013893. The MIT Press. Cambridge. Mass., 1987."},{"key":"10_CR62","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. Second edition."},{"key":"10_CR63","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J. W. Lloyd","year":"1991","unstructured":"J. W. Lloyd and J. C. Shepherdson. Partial Evaluation in Logic Programming. Journal of Logic Programming, 11:217\u2013242, 1991.","journal-title":"Journal of Logic Programming"},{"key":"10_CR64","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1016\/B978-0-934613-40-8.50020-8","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"M. J. Maher","year":"1988","unstructured":"M. J. Maher. Equivalences of Logic Programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming. pages 627\u2013658. Morgan Kaufmann, Los Altos, Ca., 1988."},{"key":"10_CR65","first-page":"1006","volume-title":"Proc. Fifth Int'l Conf. on Logic Programming","author":"P. Mancarella","year":"1988","unstructured":"P. Mancarella and D. Pedreschi. An Algebra of Logic Programs. In R. A. Kowalski and K. A. Bowen, editors, Proc. Fifth Int'l Conf. on Logic Programming, pages 1006\u20131023. The MIT Press, Cambridge, Mass., 1988."},{"key":"10_CR66","first-page":"733","volume-title":"Proc. Fifth Int'l Conf. on Logic Programming","author":"K. Marriott","year":"1988","unstructured":"K. Marriott and H. S\u00f8ndergaard. Bottom-up Abstract Interpretation of Logic Programs. In R. A. Kowalski and K. A. Bowen. editors. Proc. Fifth Int'l Conf. on Logic Programming, pages 733\u2013748. The MIT Press, Cambridge, Mass., 1988."},{"key":"10_CR67","unstructured":"K. Marriott and H. S\u00f8ndergaard. Semantics-based Dataflow Analysis of Logic Programs. In G. Ritter, editor, Information Processing 89. North-Holland, 1989."},{"key":"10_CR68","unstructured":"M. Martelli and C. Tricomi. An Effective Operational Semantics for General Logic Program. In S. Costantini, editor, Proc. Seventh Italian Conference on Logic Programming, pages 171\u2013185, 1992."},{"key":"10_CR69","unstructured":"A. Messora and M. Martelli. Semantica Dichiarativa di Predicati Meta-Logici in Programmazione Logica. In S. Costantini, editor, Proc. Seventh Italian Conference on Logic Programming, pages 155\u2013170, 1992."},{"key":"10_CR70","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0743-1066(90)90033-2","volume":"9","author":"J. Minker","year":"1990","unstructured":"J. Minker and A. Rajasekar. A Fixpoint Semantics for Disjunctive Logic Programs. Journal of Logic Programming, 9:45\u201374, 1990.","journal-title":"Journal of Logic Programming"},{"key":"10_CR71","unstructured":"R. A. O'Keefe. Towards an Algebra for Constructing Logic Programs. In Proc. IEEE Symp. on Logic Programming, pages 152\u2013160, 1985."},{"key":"10_CR72","volume-title":"Proc. Eighth Int'l Conf. on Logic Programming","author":"A. Pierro Di","year":"1991","unstructured":"A. Di Pierro, M. Martelli, and C. Palamidessi. Negation as Instantiation: a new rule for the treatment of negation in Logic Programming. In K. Furukawa, editor. Proc. Eighth Int'l Conf. on Logic Programming. The MIT Press. Cambridge, Mass., 1991."},{"key":"10_CR73","volume-title":"The Mathematics of Metamathematics","author":"H. Rasiowa","year":"1963","unstructured":"H. Rasiowa and R. Sikorski. The Mathematics of Metamathematics. North-Holland, Amsterdam, 1963."},{"key":"10_CR74","doi-asserted-by":"crossref","unstructured":"V. A. Saraswat, M. Rinard. and P. Panangaden. Semantic foundation of concurrent constraint programming. In Proc. Eighteenth Annual ACM Symp. on Principles of Programming Languages. ACM, 1991.","DOI":"10.1145\/99583.99627"},{"key":"10_CR75","first-page":"232","volume-title":"Proc. of the Seventeenth ACM Symposium on Principles of Programming Languages","author":"V.A. Saraswat","year":"1990","unstructured":"V.A. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. of the Seventeenth ACM Symposium on Principles of Programming Languages, pages 232\u2013245. ACM. New York, 1990."},{"key":"10_CR76","unstructured":"H. Tamaki and T. Sato. Unfold\/Fold Transformations of Logic Programs. In Sten-\u00c5ke T\u00e4rnlund, editor, Proc. Second Int'l Conf. on Logic Programming, pages 127\u2013139, 1984."},{"key":"10_CR77","first-page":"397","volume-title":"Proc. Eighth Int'l Conf. on Logic Programming","author":"D. Turi","year":"1991","unstructured":"D. Turi. Extending S-Models to Logic Programs with Negation. In K. Furukawa, editor, Proc. Eighth Int'l Conf. on Logic Programming, pages 397\u2013411. The MIT Press. Cambridge, Mass., 1991."},{"issue":"4","key":"10_CR78","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M. H. Emden van","year":"1976","unstructured":"M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM. 23(4):733\u2013742, 1976.","journal-title":"Journal of the ACM"},{"key":"10_CR79","first-page":"1090=1114","volume-title":"Proc. North American Conf. on Logic Programming'89","author":"D. Warren","year":"1989","unstructured":"D. Warren and M. Kifer. Hilog: A Foundation for Higher-Order Logic Programming. In E. Lusk and R. Overbeek, editors, Proc. North American Conf. on Logic Programming'89, page 1090=1114. The MIT Press, Cambridge, Mass., 1989."},{"key":"10_CR80","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0304-3975(87)90039-9","volume":"51","author":"S. Yamasaki","year":"1987","unstructured":"S. Yamasaki, M. Yoshida, and S. Doshita. A fixpoint semantics of Horn Sentences based on Substitution Sets. Theoretical Computer Science, 51:309\u2013324, 1987.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Semantics: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56596-5_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:04:37Z","timestamp":1605629077000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56596-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565963","9783540475958"],"references-count":80,"URL":"https:\/\/doi.org\/10.1007\/3-540-56596-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}