乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:05:03Z","timestamp":1725563103502},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642150241"},{"type":"electronic","value":"9783642150258"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15025-8_10","type":"book-chapter","created":{"date-parts":[[2010,8,16]],"date-time":"2010-08-16T02:52:44Z","timestamp":1281927164000},"page":"181-200","source":"Crossref","is-referenced-by-count":5,"title":["Finding Reductions Automatically"],"prefix":"10.1007","author":[{"given":"Michael","family":"Crouch","sequence":"first","affiliation":[]},{"given":"Neil","family":"Immerman","sequence":"additional","affiliation":[]},{"given":"J. Eliot B.","family":"Moss","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.jcss.2008.11.001","volume":"75","author":"E. Allender","year":"2009","unstructured":"Allender, E., Bauland, M., Immerman, N., Schnoor, H., Vollmer, H.: The Complexity of Satisfiability Problems: Refining Schaefer\u2019s Theorem. J. Comput. Sys. Sci.\u00a075, 245\u2013254 (2009)","journal-title":"J. Comput. Sys. Sci."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01530761","volume":"12","author":"R. Ben-Eliyahu","year":"1996","unstructured":"Ben-Eliyahu, R., Dechter, R.: Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence\u00a012, 53\u201387 (1996)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Clark, K.: Negation as Failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293\u2013322. Plenum Press, New York","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Cook, S.: The Complexity of Theorem Proving Procedures. In: Proc. Third Annual ACM STOC Symp., pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"10_CR5","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)","edition":"2"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver [extended version 1.2]. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1999","unstructured":"Feder, T., Vardi, M.: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study Through Datalog and Group Theory. SAIM J. Comput.\u00a028, 57\u2013104 (1999)","journal-title":"SAIM J. Comput."},{"key":"10_CR8","unstructured":"Giunchiglia, E., Lierler, Y., Maratea, M.: SAT-Based Answer Set Programming. In: Proc. AAAI, pp. 61\u201366 (2004)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Hartmanis, J., Immerman, N., Mahaney, S.: One-Way Log Tape Reductions. In: IEEE Found. of Comp. Sci. Symp., pp. 65\u201372 (1978)","DOI":"10.1109\/SFCS.1978.31"},{"key":"10_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Springer Graduate Texts in Computer Science, New York (1999)"},{"issue":"4","key":"10_CR11","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N. Immerman","year":"1987","unstructured":"Immerman, N.: Languages That Capture Complexity Classes. SIAM J. Comput.\u00a016(4), 760\u2013778 (1987)","journal-title":"SIAM J. Comput."},{"key":"10_CR12","unstructured":"Janhunen, T.: A counter-based approach to translating normal logic programs into sets of clauses. In: Proc. ASP 2003 Workshop, pp. 166\u2013180 (2003)"},{"key":"10_CR13","unstructured":"Jones, N.: Reducibility Among Combinatorial Problems in Log n Space. In: Proc. Seventh Annual Princeton Conf. Info. Sci. and Systems, pp. 547\u2013551 (1973)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computations","author":"R. Karp","year":"1972","unstructured":"Karp, R.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computations, pp. 85\u2013104. Plenum Press, New York (1972)"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/321864.321877","volume":"2","author":"R. Ladner","year":"1975","unstructured":"Ladner, R.: On the Structure of Polynomial Time Reducibility. J. Assoc. Comput. Mach.\u00a02(1), 155\u2013171 (1975)","journal-title":"J. Assoc. Comput. Mach."},{"key":"10_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)"},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/1131313.1131316","volume":"7","author":"V. Lifschitz","year":"2006","unstructured":"Lifschitz, V., Razborov, A.A.: Why are there so many loop formulas? ACM Trans. Comput. Log.\u00a07(2), 261\u2013268 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malike, S.: Chaff: Engineering an Efficient SAT Solver. In: Design Automation Conference 2001 (2001)","DOI":"10.1145\/378239.379017"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected ST-connectivity in Log-Space. In: ACM Symp. Theory of Comput., pp. 376\u2013385 (2005)","DOI":"10.1145\/1060590.1060647"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Schaefer, T.: The Complexity of Satisfiability Problems. In: ACM Symp. Theory of Comput., pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"10_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9575-1","volume-title":"Programming with Sets: an Introduction to SETL","author":"J.T. Schwartz","year":"1986","unstructured":"Schwartz, J.T., Dewar, R.B.K., Dubinsky, E., Schonberg, E.: Programming with Sets: an Introduction to SETL. Springer, New York (1986)"},{"key":"10_CR22","unstructured":"Valiant, L.: Reducibility By Algebraic Projections. L\u2019Enseignement math\u00e9matique, T. XXVIII 3-4, 253\u2013268 (1982)"}],"container-title":["Lecture Notes in Computer Science","Fields of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15025-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:15:18Z","timestamp":1558286118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15025-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642150241","9783642150258"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15025-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}