{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:30:35Z","timestamp":1725467435128},"publisher-location":"Berlin\/Heidelberg","reference-count":33,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540558446"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-55844-6_151","type":"book-chapter","created":{"date-parts":[[2006,7,13]],"date-time":"2006-07-13T09:22:29Z","timestamp":1152782549000},"page":"415-427","source":"Crossref","is-referenced-by-count":3,"title":["Fully declarative logic programming"],"prefix":"10.1007","author":[{"given":"Jan A.","family":"Plaza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"K.R. Apt, H. A. Blair and A. Walker, Towards a Theory of Declarative Knowledge, in [Minker '88], pp. 89\u2013148.","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"issue":"No.3","key":"28_CR2","doi-asserted-by":"crossref","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 Vol. 29, No. 3, July 1982, pp. 841\u2013862.","journal-title":"Journal of the ACM"},{"key":"28_CR3","first-page":"111","volume":"1","author":"D. Chan","year":"1988","unstructured":"D. Chan, Constructive Negation Based on the Completed Database, in [Kowalski and Bowen '88], vol. 1, pp. 111\u2013125.","journal-title":"Logic Programming, Proceedings of the Fifth International Conference and Symposium"},{"key":"28_CR4","first-page":"193","volume-title":"Logic and Databases","author":"K.L. Clark","year":"1978","unstructured":"K.L. Clark, Negation as Failure, in [Gallaire and Minker 78], pp. 193\u2013322."},{"key":"28_CR5","volume-title":"Research Report DOC 79\/59","author":"K.L. Clark","year":"1979","unstructured":"K.L. Clark, Predicate Logic as a Computational Formalism, Research Report DOC 79\/59, Dept. of Computing, Imperial College, London, 1979."},{"key":"28_CR6","volume-title":"Doctoral Dissertation","author":"H. Comon","year":"1988","unstructured":"H. Comon, Unification et Disunification: Theorie et Applications, Doctoral Dissertation, I.N.P. de Grenoble, France, 1988."},{"key":"28_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0357-2","volume-title":"First-order Logic and Automated Theorem Proving","author":"M. Fitting","year":"1990","unstructured":"M. Fitting, First-order Logic and Automated Theorem Proving, Springer Verlag, New York 1990."},{"volume-title":"Logic and Databases","year":"1978","key":"28_CR8","unstructured":"H. Gallaire and J. Minker (eds.), Logic and Databases, Plenum Press, New York, 1978."},{"key":"28_CR9","unstructured":"J. Jaffar, J.-L. Lassez and J.W. Lloyd, Completeness of the Negation as Failure Rule, IJCAI-83, Karlsruhe, 1983, pp. 500\u2013506."},{"key":"28_CR10","first-page":"569","volume-title":"Information Processing '74","author":"R.A. Kowalski","year":"1974","unstructured":"R.A. Kowalski, Predicate Logic as a Programming Language, Information Processing '74, Stockholm, North Holland, 1974, pp. 569\u2013574."},{"issue":"7","key":"28_CR11","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1145\/359131.359136","volume":"22","author":"R. A. Kowalski","year":"1979","unstructured":"R. A. Kowalski, Algorithm = Logic + Control, Communications of the ACM 22, 7, July 1979, pp. 424\u2013436.","journal-title":"Communications of the ACM"},{"key":"28_CR12","unstructured":"R.A. Kowalski and K.A. Bowen (eds.), Logic Programming, Proceedings of the Fifth International Conference and Symposium, MIT Press, 1988."},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"No. 4","author":"K. Kunen","year":"1987","unstructured":"K. Kunen, Negation in Logic Programming, Journal of Logic Programming 1987, No. 4, pp. 289\u2013308.","journal-title":"Journal of Logic Programming"},{"key":"28_CR14","unstructured":"G. Levi and M. Martelli (eds.), Logic Programming, Proceedings of the Sixth International Conference, MIT Press, 1989."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"V. Lifschitz, On the Declarative Semantics of Logic Programs with Negation, in [Minker '88], pp. 177\u2013192.","DOI":"10.1016\/B978-0-934613-40-8.50008-7"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundations of Logic Programming, Second extended edition, Springer Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd and R.W. Topor, Making Prolog More Expressive, Journal of Logic Programming 3, 1984.","DOI":"10.1016\/0743-1066(84)90011-6"},{"key":"28_CR18","unstructured":"D. Lugiez, A Deduction Procedure for First Order Programs, in [Levi and Martelli '89], pp. 585\u2013599."},{"key":"28_CR19","unstructured":"E.L. Lusk and R.A. Overbeek (eds.), Logic Programming, Proceedings of the North American Conference 1989, MIT Press, 1989."},{"key":"28_CR20","unstructured":"M.J. Maher, Complete Axiomatization of the Algebras of Finite, Rational and Infinite Trees, research report, IBM \u2014 T.J. Watson Research Center, Yorktown Heights, NY."},{"key":"28_CR21","unstructured":"J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, 1988."},{"key":"28_CR22","unstructured":"J.A. Plaza, Fully Declarative Programming with Logic, Ph.D. Dissertation, City University of New York, 1990."},{"key":"28_CR23","series-title":"Lecture Notes in AI 542","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1007\/3-540-54563-8_123","volume-title":"Methodologies for Intelligent Systems, Proceedings of the 6th International Symposium","author":"J.A. Plaza","year":"1991","unstructured":"J.A. Plaza, Completeness for Propositional Logic Programs with Negation, in [Ras and Zemankova '91]. pp. 600\u2013609."},{"key":"28_CR24","unstructured":"J.A. Plaza, Operators on Lattices of \u03a9-Herbrand Interpretations, in [Taitslin and Nerode '92]."},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"T.C. Przymusinski, On the Declarative Semantics of Deductive Databases and Logic Programs, in [Minker '88], pp. 193\u2013216.","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"key":"28_CR26","unstructured":"T.C. Przymusinski, On Constructive Negation in Logic Programming, in [Lusk and Overbeek '89], addendum."},{"key":"28_CR27","unstructured":"T.C. Przymusinski, On the Declarative and Procedural Semantics of Logic Programs, Journal of Logic Programming, to appear."},{"key":"28_CR28","series-title":"Lecture Notes in AI 542","volume-title":"Methodologies for Intelligent Systems, Proceedings of the 6th International Symposium","year":"1991","unstructured":"Z.W. Ras and M. Zemankova (eds.), Methodologies for Intelligent Systems, Proceedings of the 6 th International Symposium, Lecture Notes in AI 542, Springer Verlag, Berlin-New York, 1991."},{"volume-title":"Concurrent Prolog: Collected Papers","year":"1987","key":"28_CR29","unstructured":"E.Y. Shapiro (ed.), Concurrent Prolog: Collected Papers, MIT Press, Cambridge MA, 1987."},{"key":"28_CR30","doi-asserted-by":"crossref","unstructured":"J.C. Shepherdson, Negation in Logic Programming, in [Minker '88], pp. 19\u201388.","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"key":"28_CR31","unstructured":"M.A. Taitslin and A. Nerode (eds.), Proceedings of the Symposium on Logical Foundations of Computer Science \u2014 Logic at Tver '92, Lecture Notes in Computer Science, Springer Verlag, 1992, to appear."},{"key":"28_CR32","first-page":"140","volume-title":"Concurrent Prolog: Collected Papers","author":"K. Ueda","year":"1987","unstructured":"K. Ueda, Guarded Horn Clauses, in [Shapiro '87], vol.1, pp. 140\u2013156."},{"issue":"No.3","key":"28_CR33","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"A. Van Gelder, K.A. Ross, and J.S. Schlipf, The Well-founded Semantics for General Logic Programs, Journal of the ACM, Vol. 38, No. 3, July 1991, pp. 620\u2013650.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55844-6_151.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:36:31Z","timestamp":1619573791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55844-6_151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540558446"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-55844-6_151","relation":{},"subject":[]}}