{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T03:31:41Z","timestamp":1768447901942,"version":"3.49.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"2-4","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":7200,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1993,11]]},"DOI":"10.1016\/0743-1066(93)90033-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"265-278","source":"Crossref","is-referenced-by-count":12,"title":["Proof method of partial correctness and weak completeness for normal logic programs"],"prefix":"10.1016","volume":"17","author":[{"given":"G\u00e9rard","family":"Ferrand","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Deransart","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(93)90033-D_BIB1","first-page":"89","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/0743-1066(93)90033-D_BIB2","article-title":"General Logical Databases and Programs: Default Logic Semantics and Stratification","author":"Bidoit","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0743-1066(93)90033-D_BIB3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(51)90004-7","article-title":"Negation by Default and Unstratifiable Logic Programs","volume":"78","author":"Bidoit","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(93)90033-D_BIB4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0190(91)90012-7","article-title":"A simple Fixed Point Characterization of Three-Valued Stable Model Semantics","volume":"40","author":"Bonnier","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-1066(93)90033-D_BIB5","article-title":"Predicate Logic as a Computational Formalism","author":"Clark","year":"1979"},{"key":"10.1016\/0743-1066(93)90033-D_BIB6","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(93)90107-5","article-title":"Proof Methods of Declarative Properties of Definite Programs","author":"Deransart","year":"1991"},{"key":"10.1016\/0743-1066(93)90033-D_BIB7","article-title":"A Methodological View of Logic Programming with Negation","author":"Deransart","year":"1989"},{"key":"10.1016\/0743-1066(93)90033-D_BIB8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF03037477","article-title":"An Operational Formal Definition of PROLOG: A Specification Method and Its Application","volume":"10","author":"Deransart","year":"1992","journal-title":"New Generation Computing"},{"key":"10.1016\/0743-1066(93)90033-D_BIB9","article-title":"Constructive Negation by Fail Answers","author":"Drabent","year":"1991"},{"issue":"3","key":"10.1016\/0743-1066(93)90033-D_BIB10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","article-title":"Declarative Modeling of the Operational Behaviour of logic languages","volume":"69","author":"Falaschi","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(93)90033-D_BIB11","article-title":"Tutorial: Basic Concepts of Logic Programming and PROLOG","author":"Ferrand","year":"1991","journal-title":"8th International Conference on Logic Programming"},{"key":"10.1016\/0743-1066(93)90033-D_BIB12","doi-asserted-by":"crossref","DOI":"10.1016\/0743-1066(93)90033-D","article-title":"Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs","author":"Ferrand","year":"1992"},{"issue":"4","key":"10.1016\/0743-1066(93)90033-D_BIB13","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke\u2014Kleene Semantics for Logic Programs","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(93)90033-D_BIB14","article-title":"Equivalence-Preserving Transformations of Inductive Properties of Prolog Programs","author":"Fribourg","year":"1988"},{"key":"10.1016\/0743-1066(93)90033-D_BIB15","first-page":"1070","article-title":"The Stable Model Semantics for Logic Programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/0743-1066(93)90033-D_BIB16","article-title":"On Proving First Order Inductive Properties in Horn Clauses","author":"Hsiang","year":"1984"},{"key":"10.1016\/0743-1066(93)90033-D_BIB17","article-title":"Soundness and Completeness of Extended Execution of Proving Properties of Prolog Programs","volume":"175","author":"Kanamori","year":"1986"},{"key":"10.1016\/0743-1066(93)90033-D_BIB18","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/3-540-16492-8_96","article-title":"Verification of Prolog Programs Using an Extension of Execution","author":"Kanamori","year":"1986","journal-title":"Proc. International Conference on Logic Programming"},{"key":"10.1016\/0743-1066(93)90033-D_BIB19","article-title":"ARGUS\/V: A System for Verification of Prolog Programs","volume":"176","author":"Kanamori","year":"1986"},{"key":"10.1016\/0743-1066(93)90033-D_BIB20","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(93)90033-D_BIB21","first-page":"193","article-title":"On the Declarative Semantics of Logic Programs","author":"Przymusinski","year":"1988"},{"key":"10.1016\/0743-1066(93)90033-D_BIB22","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/73721.73723","article-title":"Every Logic Program Has a Natural Stratification and an Iterated Fixed Point Model","author":"Przymusinski","year":"1989","journal-title":"Symp. on Principles of Databases Systems"},{"key":"10.1016\/0743-1066(93)90033-D_BIB23","first-page":"445","article-title":"Well-Founded Semantics Coincides with Three-Valued Stable Semantics","volume":"13","author":"Przymusinski","year":"1990","journal-title":"Fund. Inform."},{"key":"10.1016\/0743-1066(93)90033-D_BIB24","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/73721.73724","article-title":"A Procedural Semantics for Well Founded Negation in Logic Programs","author":"Ross","year":"1989","journal-title":"Symp. on Principles of Database Systems"},{"key":"10.1016\/0743-1066(93)90033-D_BIB25","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(51)90008-4","article-title":"Programming in Three-Valued Logic","volume":"78","author":"Thibau","year":"1991","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/0743-1066(93)90033-D_BIB26","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The Semantics of Predicate Logic as a Programming Language","volume":"23","author":"van","year":"1976","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0743-1066(93)90033-D_BIB27","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"The Well-Founded Semantics for General Logic Programs","volume":"38","author":"Van Gelder","year":"1991","journal-title":"J. ACM"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669390033D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669390033D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:11:01Z","timestamp":1704208261000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669390033D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":27,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["074310669390033D"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(93)90033-d","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}