乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T20:16:31Z","timestamp":1648671391367},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2009,11,1]],"date-time":"2009-11-01T00:00:00Z","timestamp":1257033600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s11390-009-9285-5","type":"journal-article","created":{"date-parts":[[2009,11,5]],"date-time":"2009-11-05T19:38:14Z","timestamp":1257449894000},"page":"1125-1137","source":"Crossref","is-referenced-by-count":2,"title":["Logic Programs, Compatibility and Forward Chaining Construction"],"prefix":"10.1007","volume":"24","author":[{"given":"Yi-Song","family":"Wang","sequence":"first","affiliation":[]},{"given":"Ming-Yi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,6]]},"reference":[{"key":"9285_CR1","unstructured":"Frank Van Harmelen, Vladimir Lifschitz, Bruce Porter (eds.). Handbook of Knowledge Representation. Elsevier, 2008."},{"key":"9285_CR2","doi-asserted-by":"crossref","unstructured":"Baral C. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, 2003.","DOI":"10.1017\/CBO9780511543357"},{"key":"9285_CR3","unstructured":"Gelfond M, Lifschitz V. The stable model semantics for logic programming. In Proc. the Fifth International Conference and Symposium on Logic Programming, Seattle, Washington, Aug. 15\u201319, 1988, pp.1070\u20131080."},{"issue":"1\/2","key":"9285_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0004-3702(02)00186-8","volume":"138","author":"V Lifschitz","year":"2002","unstructured":"Lifschitz V. Answer set programming and plan generation. Artificial Intelligence, 2002, 138(1\/2): 39\u201354.","journal-title":"Artificial Intelligence"},{"key":"9285_CR5","doi-asserted-by":"crossref","unstructured":"Marek V W, Truszczynski M. Stable models and an alternative logic programming paradigm. The Logic Programming Paradigm: A 25-Year Perspective. Apt K R, Marek V W, Truszczynski M, Warren D S (eds.), Springer-Verlag, 1999, pp.375\u2013398.","DOI":"10.1007\/978-3-642-60085-2_17"},{"issue":"3\/4","key":"9285_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4 I. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 1999, 25(3\/4): 241\u2013273.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"4","key":"9285_CR7","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1007\/s11390-007-9078-7","volume":"22","author":"XS Zhao","year":"2007","unstructured":"Zhao X S, Shen Y P. Comparison of semantics of disjunctive logic programs based on model-equivalent reduction. Journal of Computer Science and Technology, 2007,22(4): 562\u2013568.","journal-title":"Journal of Computer Science and Technology"},{"issue":"4","key":"9285_CR8","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1007\/s11390-009-9256-x","volume":"24","author":"W Chen","year":"2009","unstructured":"Chen W, Zhang M Y, Wu M N. Logic-program-based negotiation mechanism. Journal of Computer Science and Technology, 2009, 24(4): 753\u2013760.","journal-title":"Journal of Computer Science and Technology"},{"key":"9285_CR9","doi-asserted-by":"crossref","unstructured":"Lifschitz V. Twelve definitions of a stable model. In Proc. the 24th Int. Conf. Logic Programming, LNCS 5366, Udine, Italy, Dec. 9\u201313, 2008, pp.37\u201351.","DOI":"10.1007\/978-3-540-89982-2_8"},{"issue":"1\u20133","key":"9285_CR10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0168-0072(98)00041-4","volume":"96","author":"VW Marek","year":"1999","unstructured":"Marek V W, Nerode A, Remmel J B. Logic programs, wellordering, and forward chaining. Annals of Pure and Applied Logic, 1999, 96(1-3): 231\u2013276.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1\/2","key":"9285_CR11","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R Reiter","year":"1980","unstructured":"Reiter R. A logic for default reasoning. Artificial Intelligence, 1980, 13(1\/2): 81\u2013132.","journal-title":"Artificial Intelligence"},{"key":"9285_CR12","unstructured":"Zhang M. A characterization of extension of general default theories. In Proc. the Ninth Canadian Conference on Artificial Intelligence, Vancouver, Canada, 1992, pp.134\u2013139."},{"issue":"2","key":"9285_CR13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1006\/inco.1996.0075","volume":"129","author":"M Zhang","year":"1996","unstructured":"Zhang M. A new research into default logic. Information and Computation, 1996, 129(2): 73\u201385.","journal-title":"Information and Computation"},{"issue":"3","key":"9285_CR14","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E Dantsin","year":"2001","unstructured":"Dantsin E, Eiter T, Gottlob G, Voronkov A. Complexity and expressive power of logic programming. ACM Computing Surveys, 2001, 33(3): 374\u2013425.","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"9285_CR15","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"VW Marek","year":"1991","unstructured":"Marek V W, Truszczynski M. Autoepistemic logic. J. ACM, 1991, 38(3): 588\u2013619.","journal-title":"J. ACM"},{"key":"9285_CR16","doi-asserted-by":"crossref","unstructured":"Apt K R, Blair H A, Walker A. Towards a theory of declarative knowledge. Foundations of Deductive Databases and Logic Programming, Minker J (ed.), Morgan Kaufmann, Los Altos, 1988, pp.293\u2013322.","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"9285_CR17","unstructured":"Lin F, Zhao X. On odd and even cycles in normal logic programs. In Proc. the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, San Jose, USA, July 25-29, 2004, pp.80\u201385."},{"key":"9285_CR18","doi-asserted-by":"crossref","unstructured":"Papadimitriou C H, Yannakakis M. Tie-breaking semantics and structural totality. In Proc. 11th ACM Conference on Principles of Database Systems (PODS 1992), San Diego, USA, June 2\u20134, 1992, pp.16\u201322.","DOI":"10.1145\/137097.137103"},{"issue":"3","key":"9285_CR19","first-page":"237","volume":"45","author":"Robert Saxon Milnikel","year":"2001","unstructured":"Robert Saxon Milnikel. Skeptical reasoning in FC-normal logic programs is \u03c0 1 1 -complete. Fundamenta Informaticae, 2001, 45(3): 237\u2013252.","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"9285_CR20","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/s11390-007-9071-1","volume":"22","author":"Y Wang","year":"2007","unstructured":"Wang Y, Zhang M, Shen Y. Consistency property of finite FC-normal logic programs. Journal of Computer Science and Technology, 2007, 22(4): 554\u2013561.","journal-title":"Journal of Computer Science and Technology"},{"key":"9285_CR21","doi-asserted-by":"crossref","unstructured":"Lloyd J W. Foundations of Logic Programming. 2nd Edition, Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"9285_CR22","unstructured":"Zhang M, Zhang Y, Wang Y. On compatibility and forward chaining normality. In The Eleventh International Workshop on Non-Monotonic Reasoning, Lake District, UK, May 30\u2013June 1, 2006, pp.163\u2013171."},{"issue":"1\/2","key":"9285_CR23","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0004-3702(02)00182-0","volume":"138","author":"MSG Gottlob","year":"2002","unstructured":"Martha Sideri Georg Gottlob, Francesco Scarcello. Fixedparameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence, 2002, 138(1\/2): 55\u201386.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"9285_CR24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"FW Dowling","year":"1984","unstructured":"William F Dowling, Jean H Gallier. Linear-time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming, 1984, 1(3): 267\u2013284.","journal-title":"Journal of Logic Programming"},{"issue":"4","key":"9285_CR25","first-page":"259","volume":"45","author":"D Xu","year":"2002","unstructured":"Xu D, Ding D. FC-normal and extended stratified logic program. Science in China (Series F), 2002, 45(4): 259\u2013272.","journal-title":"Science in China (Series F)"},{"key":"9285_CR26","unstructured":"Garey M R, Johnson D S. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979."},{"issue":"3","key":"9285_CR27","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0743-1066(89)90022-8","volume":"7","author":"K Kunen","year":"1989","unstructured":"Kunen K. Signed data dependencies in logic programs. Journal of Logic Programming, 1989, 7(3): 231\u2013245.","journal-title":"Journal of Logic Programming"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-009-9285-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-009-9285-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-009-9285-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:34:28Z","timestamp":1559385268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-009-9285-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["9285"],"URL":"https:\/\/doi.org\/10.1007\/s11390-009-9285-5","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11]]}}}