乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T00:01:47Z","timestamp":1704758507418},"reference-count":27,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":2968,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1016\/j.tcs.2004.12.003","type":"journal-article","created":{"date-parts":[[2004,12,30]],"date-time":"2004-12-30T12:22:24Z","timestamp":1104409344000},"page":"127-152","source":"Crossref","is-referenced-by-count":9,"title":["Ordering default theories and nonmonotonic logic programs"],"prefix":"10.1016","volume":"338","author":[{"given":"Chiaki","family":"Sakama","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2004.12.003_bib1","first-page":"201","article-title":"On the correctness of unfold\/fold transformation of normal and extended logic programs","volume":"22","author":"Aravindan","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/j.tcs.2004.12.003_bib2","series-title":"Inductive Logic Programming","first-page":"145","article-title":"Non-monotonic learning","author":"Bain","year":"1992"},{"key":"10.1016\/j.tcs.2004.12.003_bib3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0743-1066(94)90025-6","article-title":"Logic programming and knowledge representation","volume":"19\/20","author":"Baral","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/j.tcs.2004.12.003_bib4","series-title":"Modern Uses of Multiple-Valued Logic","first-page":"8","article-title":"A useful four-valued logic","author":"Belnap","year":"1975"},{"key":"10.1016\/j.tcs.2004.12.003_bib5","series-title":"Proc. 5th Internat. Conf. on Principles of Knowledge Representation and Reasoning","first-page":"482","article-title":"Biconsequence relations for nonmonotonic reasoning","author":"Bochman","year":"1996"},{"key":"10.1016\/j.tcs.2004.12.003_bib6","series-title":"Proc. 13th Internat. Joint Conf. Artificial Intelligence","first-page":"578","article-title":"On the semantics of supernormal defaults","author":"Brass","year":"1993"},{"key":"10.1016\/j.tcs.2004.12.003_bib7","unstructured":"G. Brewka, J. Dix, Knowledge representation with logic programs, in: Proc. 3rd Workshop on Logic Programming and Knowledge Representation, Lecture Notes in Artificial Intelligence, Vol. 1471, Springer, Berlin, 1997, pp. 1\u201351."},{"key":"10.1016\/j.tcs.2004.12.003_bib8","first-page":"241","article-title":"A survey of paraconsistent semantics for logic programs","volume":"Vol. 2","author":"Dam\u00e1sio","year":"1998"},{"key":"10.1016\/j.tcs.2004.12.003_bib9","unstructured":"F.M. Dion\u00edsio, S. Brass, M. Ryan, U. Lipeck, Hypothetical reasoning with defaults, in: Proc. Workshop on Computational Aspects of Nonmonotonic Reasoning, at the 7th Internat. Workshop on Nonmonotonic Reasoning, 1998."},{"key":"10.1016\/j.tcs.2004.12.003_bib10","series-title":"Proc. 3rd Internat. Conf. on Knowledge Representation and Reasoning","first-page":"591","article-title":"A framework for representing and characterizing semantics of logic programs","author":"Dix","year":"1992"},{"key":"10.1016\/j.tcs.2004.12.003_bib11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(91)90014-G","article-title":"Bilattices and the semantics of logic programming","volume":"11","author":"Fitting","year":"1991","journal-title":"J. Logic Programming"},{"key":"10.1016\/j.tcs.2004.12.003_bib12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Comput."},{"key":"10.1016\/j.tcs.2004.12.003_bib13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1111\/j.1467-8640.1988.tb00280.x","article-title":"Multi-valued logics","volume":"4","author":"Ginsberg","year":"1988","journal-title":"Comput. Intell."},{"key":"10.1016\/j.tcs.2004.12.003_bib14","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","article-title":"Complexity results for nonmonotonic logics","volume":"2","author":"Gottlob","year":"1992","journal-title":"J. Logic Comput."},{"key":"10.1016\/j.tcs.2004.12.003_bib15","series-title":"Proc. 15th Internat. Joint Conf. on Artificial Intelligence","first-page":"176","article-title":"Learning extended logic programs","author":"Inoue","year":"1997"},{"key":"10.1016\/j.tcs.2004.12.003_bib16","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1145\/383779.383783","article-title":"Strongly equivalent logic programs","volume":"2","author":"Lifschitz","year":"2001","journal-title":"ACM Trans. Comput. Logic"},{"issue":"3","key":"10.1016\/j.tcs.2004.12.003_bib17","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/116825.116836","article-title":"Autoepistemic logic","volume":"38","author":"Marek","year":"1991","journal-title":"J. Assoc. Comput. Math."},{"key":"10.1016\/j.tcs.2004.12.003_bib18","series-title":"Proc. 3rd European Working Sessions on Learning (EWSL-88)","first-page":"131","article-title":"A study of generalization in logic programs","author":"Niblett","year":"1988"},{"key":"10.1016\/j.tcs.2004.12.003_bib19","doi-asserted-by":"crossref","unstructured":"S.-H. Nienhuys-Cheng, R. de Wolf, Foundations of Inductive Logic Programming, Lecture Notes in Artificial Intelligence, Vol. 1228, Springer, Berlin, 1997.","DOI":"10.1007\/3-540-62927-0"},{"key":"10.1016\/j.tcs.2004.12.003_bib20","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A logic for default reasoning","volume":"13","author":"Reiter","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.tcs.2004.12.003_bib21","series-title":"Artificial Intelligence","author":"Russell","year":"1995"},{"key":"10.1016\/j.tcs.2004.12.003_bib22","unstructured":"C. Sakama, Nonmonotonic inductive logic programming, in: Proc. 6th Internat. Conf. on Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence, Vol. 2173, Springer, Berlin, 2001, pp. 62\u201380."},{"key":"10.1016\/j.tcs.2004.12.003_bib23","series-title":"Proc. 18th Internat. Joint Conf. on Artificial Intelligence","first-page":"839","article-title":"Ordering default theories","author":"Sakama","year":"2003"},{"key":"10.1016\/j.tcs.2004.12.003_bib24","doi-asserted-by":"crossref","unstructured":"C. Sakama, Induction from answer sets in nonmonotonic logic programs, ACM Trans. Comput. Logic, 6(2) (2005).","DOI":"10.1145\/1055686.1055687"},{"issue":"1","key":"10.1016\/j.tcs.2004.12.003_bib25","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF00881915","article-title":"Paraconsistent stable semantics for extended disjunctive programs","volume":"13","author":"Sakama","year":"1995","journal-title":"J. Automat. Reason."},{"key":"10.1016\/j.tcs.2004.12.003_bib26","series-title":"Proc. 2nd Internat. Conf. on Logic Programming","first-page":"127","article-title":"Unfold\/fold transformation of logic programs","author":"Tamaki","year":"1984"},{"key":"10.1016\/j.tcs.2004.12.003_bib27","doi-asserted-by":"crossref","unstructured":"H. Turner, Strong equivalence for logic programs and default theories, (made easy), in: Proc. 6th Internat. Conf. on Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence, Vol. 2173, Springer, Berlin, 2001, pp. 81\u201392.","DOI":"10.1007\/3-540-45402-0_6"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397504007893?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397504007893?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T14:21:10Z","timestamp":1548858070000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397504007893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":27,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["S0304397504007893"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2004.12.003","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}