乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T03:57:49Z","timestamp":1720411069837},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61173010"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1016\/j.artint.2015.03.007","type":"journal-article","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T07:45:52Z","timestamp":1427874352000},"page":"72-102","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Ordered completion for logic programs with aggregates"],"prefix":"10.1016","volume":"224","author":[{"given":"Vernon","family":"Asuncion","sequence":"first","affiliation":[]},{"given":"Yin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.artint.2015.03.007_br0010","series-title":"LPNMR","first-page":"67","article-title":"The complexity boundary of answer set programming with generalized atoms under the flp semantics","author":"Alviano","year":"2013"},{"key":"10.1016\/j.artint.2015.03.007_br0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2011.11.001","article-title":"Ordered completion for first-order logic programs on finite structures","volume":"177\u2013179","author":"Asuncion","year":"2012","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2015.03.007_br0030","series-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"Baral","year":"2003"},{"key":"10.1016\/j.artint.2015.03.007_br0040","series-title":"IJCAI-2011","first-page":"724","article-title":"First-order extension of the FLP stable model semantics via modified circumscription","author":"Bartholomew","year":"2011"},{"key":"10.1016\/j.artint.2015.03.007_br0050","series-title":"LPNMR","first-page":"388","article-title":"The third answer set programming competition: preliminary report of the system competition track","author":"Calimeri","year":"2011"},{"key":"10.1016\/j.artint.2015.03.007_br0060","series-title":"KR","first-page":"298","article-title":"First-order loop formulas for normal logic programs","author":"Chen","year":"2006"},{"key":"10.1016\/j.artint.2015.03.007_br0070","series-title":"Logics and Databases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/j.artint.2015.03.007_br0080","series-title":"ICLP","first-page":"145","article-title":"Modular nonmonotonic logic programming revisited","author":"Dao-Tran","year":"2009"},{"key":"10.1016\/j.artint.2015.03.007_br0090","series-title":"IS\/KI","first-page":"83","article-title":"Expressive power and complexity of disjunctive datalog under the stable model semantics","author":"Eiter","year":"1994"},{"key":"10.1016\/j.artint.2015.03.007_br0100","series-title":"IJCAI","first-page":"90","article-title":"A uniform integration of higher-order reasoning and external evaluations in answer-set programming","author":"Eiter","year":"2005"},{"key":"10.1016\/j.artint.2015.03.007_br0110","series-title":"LPNMR","first-page":"97","article-title":"On the complexity of answer set programming with aggregates","author":"Faber","year":"2007"},{"key":"10.1016\/j.artint.2015.03.007_br0120","series-title":"Answer Set Programming: Advances in Theory and Implementation","first-page":"274","article-title":"Aggregate functions in DLV","author":"Faber","year":"2003"},{"issue":"1","key":"10.1016\/j.artint.2015.03.007_br0130","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","article-title":"Semantics and complexity of recursive aggregates in answer set programming","volume":"175","author":"Faber","year":"2011","journal-title":"Artif. Intell."},{"issue":"5\u20136","key":"10.1016\/j.artint.2015.03.007_br0140","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1017\/S1471068408003323","article-title":"Design and implementation of aggregate functions in the DLV system","volume":"8","author":"Faber","year":"2008","journal-title":"Theory Pract. Log. Program."},{"key":"10.1016\/j.artint.2015.03.007_br0150","series-title":"Proceedings of SIAM\u2013AMS, vol. 7","first-page":"27","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","author":"Fagin","year":"1974"},{"issue":"4","key":"10.1016\/j.artint.2015.03.007_br0160","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1970398.1970401","article-title":"Logic programs with propositional connectives and aggregates","volume":"12","author":"Ferraris","year":"2011","journal-title":"ACM Trans. Comput. Log."},{"issue":"1","key":"10.1016\/j.artint.2015.03.007_br0170","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.artint.2010.04.011","article-title":"Stable models and circumscription","volume":"175","author":"Ferraris","year":"2011","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2015.03.007_br0180","series-title":"Proceedings of the 2010 Workshop on Nonmonotonic Reasoning","article-title":"On the stable model semantics of first-order formulas with aggregates","author":"Ferraris","year":"2010"},{"key":"10.1016\/j.artint.2015.03.007_br0190","series-title":"Proceedings of the 25th International Conference on Logic Programming (ICLP'2009), vol. 5649","first-page":"250","article-title":"On the implementation of weigh constraints in conflict-driven ASP solvers","author":"Gebser","year":"2009"},{"key":"10.1016\/j.artint.2015.03.007_br0200","series-title":"Proceedings of International Logic Programming Conference and Symposium","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/j.artint.2015.03.007_br0210","series-title":"AAAI","first-page":"472","article-title":"A reductive semantics for counting and choice in answer set programming","author":"Lee","year":"2008"},{"key":"10.1016\/j.artint.2015.03.007_br0220","series-title":"LPNMR","first-page":"182","article-title":"On reductive semantics of aggregates in answer set programming","author":"Lee","year":"2009"},{"key":"10.1016\/j.artint.2015.03.007_br0230","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1613\/jair.2009","article-title":"Properties and applications of programs with monotone and convex constraints","volume":"27","author":"Liu","year":"2006","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.artint.2015.03.007_br0240","series-title":"The Logic Programming Paradigm: A 25-Year Perspective","first-page":"375","article-title":"Stable models and an alternative logic programming paradigm","author":"Marek","year":"1999"},{"issue":"3\u20134","key":"10.1016\/j.artint.2015.03.007_br0250","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1018930122475","article-title":"Logic programs with stable model semantics as a constraint programming paradigm","volume":"25","author":"Niemel\u00e4","year":"1999","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.artint.2015.03.007_br0260","series-title":"LPNMR","first-page":"207","article-title":"Partial stable models for logic programs with aggregates","author":"Pelov","year":"2004"},{"issue":"3","key":"10.1016\/j.artint.2015.03.007_br0270","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1017\/S1471068406002973","article-title":"Well-founded and stable semantics of logic programs with aggregates","volume":"7","author":"Pelov","year":"2007","journal-title":"Theory Pract. Log. Program."},{"key":"10.1016\/j.artint.2015.03.007_br0280","series-title":"LPNMR-2004","first-page":"356","article-title":"A treatment of aggregates in ASP (system description)","author":"Pontelli","year":"2004"},{"issue":"1\u20132","key":"10.1016\/j.artint.2015.03.007_br0290","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","article-title":"Extending and implementing the stable model semantics","volume":"138","author":"Simons","year":"2002","journal-title":"Artif. Intell."},{"issue":"3","key":"10.1016\/j.artint.2015.03.007_br0300","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1017\/S1471068406002936","article-title":"A constructive semantic characterization of aggregates in answer set programming","volume":"7","author":"Tran Cao Son","year":"2007","journal-title":"Theory Pract. Log. Program."},{"key":"10.1016\/j.artint.2015.03.007_br0310","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1613\/jair.2171","article-title":"Answer sets for logic programs with arbitrary abstract constraint atoms","volume":"29","author":"Tran Cao Son","year":"2007","journal-title":"J. Artif. Intell. Res."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370215000533?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370215000533?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T19:37:16Z","timestamp":1617305836000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370215000533"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":31,"alternative-id":["S0004370215000533"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2015.03.007","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2015,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Ordered completion for logic programs with aggregates","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.artint.2015.03.007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}