乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:51:00Z","timestamp":1649217060310},"reference-count":37,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":5466,"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":[[1998,8]]},"DOI":"10.1016\/s0743-1066(97)10014-0","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T03:40:06Z","timestamp":1052797206000},"page":"91-147","source":"Crossref","is-referenced-by-count":10,"title":["Combining negation as failure and embedded implications in logic programs"],"prefix":"10.1016","volume":"36","author":[{"given":"Laura","family":"Giordano","sequence":"first","affiliation":[]},{"given":"Nicola","family":"Olivetti","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0743-1066(97)10014-0_BIB1","first-page":"1","article-title":"Partial logic","volume":"vol. 3","author":"Blamey","year":"1986"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB2","series-title":"Proceedings of North American Conference on Logic Programming","first-page":"681","article-title":"Adding negation-as-failure to intuitionistic logic programming","author":"Bonner","year":"1990"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB3","doi-asserted-by":"crossref","unstructured":"A.J. Bonner, Hypothetical Datalog: Complexity and expressibility, in: Lecture Notes in Computer Science, vol. 326, pp. 144\u2013160.","DOI":"10.1007\/3-540-50171-1_9"},{"issue":"3","key":"10.1016\/S0743-1066(97)10014-0_BIB4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0743-1066(89)90020-4","article-title":"A completeness theorem for SLDNF-resolution","volume":"7","author":"Cavedon","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB5","series-title":"Proceedings of the European Conference on Artificial Intelligence","article-title":"Strong circumscription specifies the stable semantics of logic programs","author":"Dung","year":"1990"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB6_1","series-title":"Proceedings of the Third International Workshop on Extensions of Logic Programming","first-page":"61","article-title":"Hypothetical logic programming with negation as failure","author":"Dung","year":"1992"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB6_2","series-title":"Proceedings of the Third International Workshop on Extensions of Logic Programming","first-page":"144","article-title":"Hypothetical logic programming with negation as failure","author":"Dung","year":"1992"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke\/Kleene semantics for logic programs","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0743-1066(93)90031-B","article-title":"The family of stable models","volume":"17","author":"Fitting","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB9","series-title":"On prudent bravery and other abstractions","author":"Fitting","year":"1993"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0743-1066(84)90029-3","article-title":"N-Prolog: An extension of Prolog with hypothetical implications. I","volume":"4","author":"Gabbay","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB11","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0743-1066(85)80003-0","article-title":"N-Prolog: An extension of Prolog with hypothetical implications. II. Logical foundations and negation as failure","volume":"4","author":"Gabbay","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB12","series-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB13","series-title":"Proceedings of the International Conference and Symposium on Logic Programming","article-title":"Negation as failure in intuitionistic logic programming","author":"Giordano","year":"1992"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB14","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0304-3975(92)90066-O","article-title":"Extending Horn clause logic with implication goals","volume":"95","author":"Giordano","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB15","series-title":"Proceedings of North American Conference on Logic Programming","first-page":"626","article-title":"A Kripke-like model for negation as failure","author":"Harland","year":"1989"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB16","series-title":"Proceedings of the Eighth International Conference on Logic Programming","first-page":"711","article-title":"A clausal form for the completion of logic programs","author":"Harland","year":"1991"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(93)90007-4","article-title":"Success and failure for hereditary Harrop formulae","volume":"17","author":"Harland","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","article-title":"Negation in logic programming","volume":"4","author":"Kunen","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","article-title":"Signed data dependencies in logic programs","volume":"7","author":"Kunen","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB20","series-title":"Foundations of deductive Databases and Logic Programming","first-page":"177","article-title":"On the declarative semantics of logic programs with negation","author":"Lifschitz","year":"1988"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB21","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"issue":"1","key":"10.1016\/S0743-1066(97)10014-0_BIB22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(88)90005-2","article-title":"Clausal intuitionistic logic. I. Fixed-point semantics","volume":"5","author":"McCarty","year":"1988","journal-title":"J. Logic Programming"},{"issue":"2","key":"10.1016\/S0743-1066(97)10014-0_BIB23","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0743-1066(88)90014-3","article-title":"Clausal intuitionistic logic. II. Tableau proof procedures","volume":"5","author":"McCarty","year":"1988","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB24","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0743-1066(93)90036-G","article-title":"Circumscribing embedded implications (without stratification)","volume":"17","author":"McCarty","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB25","series-title":"IEEE Symposium on Logic Programming","first-page":"106","article-title":"A theory of modules for logic programming","author":"Miller","year":"1986"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB26","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-1066(89)90031-9","article-title":"A logical analysis of modules in logic programming","volume":"6","author":"Miller","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB27","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","article-title":"Uniform proofs as a foundation of logic programming","volume":"51","author":"Miller","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"issue":"4","key":"10.1016\/S0743-1066(97)10014-0_BIB28","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF00172059","article-title":"N-Prolog and equivalence of logic programs","volume":"1","author":"Olivetti","year":"1992","journal-title":"J. Logic, Language and Information"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB29","series-title":"Foundations of deductive Databases and Logic Programming","first-page":"193","article-title":"On the declarative semantics of stratified deductive databases and logic programming","author":"Przymusinski","year":"1988"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB30","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","article-title":"Negation as failure: A comparison of Clark's completed data base and Reiter's closed world assumption","volume":"1","author":"Shepherdson","year":"1984","journal-title":"J. Logic Programming"},{"issue":"3","key":"10.1016\/S0743-1066(97)10014-0_BIB31","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-1066(85)90018-4","article-title":"Negation as failure II","volume":"2","author":"Shepherdson","year":"1985","journal-title":"J. Logic Programming"},{"issue":"4","key":"10.1016\/S0743-1066(97)10014-0_BIB32","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1093\/logcom\/1.6.811","article-title":"A complete axiomatization of the three-valued completion of logic programs","volume":"6","author":"St\u00e4rk","year":"1991","journal-title":"Journal of Logic and Computation"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB33","first-page":"71","article-title":"Many-valued","volume":"vol. III","author":"Urquhart","year":"1984"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB34","series-title":"Proceedings of the Seventh ACM Symposium on Principles of Database Systems","first-page":"221","article-title":"Unfounded sets and well-founded semantics for general logic programs","author":"Van Gelder","year":"1988"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB35_1","series-title":"Polish Logic 1920\u20131939","article-title":"Axiomatization of 3-valued sentential calculus","author":"Wajsberg","year":"1967"},{"key":"10.1016\/S0743-1066(97)10014-0_BIB35_2","first-page":"126","volume":"24","year":"1931","journal-title":"Comptes Rendus des Seances de la Societ\u00e9 des Sciences et des Lettres de Varsovie, Classe III"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106697100140?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106697100140?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T19:07:24Z","timestamp":1580843244000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106697100140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0743106697100140"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(97)10014-0","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}