{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:12:23Z","timestamp":1648901543528},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"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":[[1999,3]]},"DOI":"10.1007\/bf02946521","type":"journal-article","created":{"date-parts":[[2008,9,5]],"date-time":"2008-09-05T01:26:22Z","timestamp":1220577982000},"page":"146-152","source":"Crossref","is-referenced-by-count":1,"title":["Deciding quasi-reducibility using witnessed test sets"],"prefix":"10.1007","volume":"14","author":[{"given":"Zhiqing","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongqiang","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoxin","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huiqun","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02946521_CR1","unstructured":"Kapur D, Musser D R. Inductive reasoning with incomplete specifications. InProceedings of Logic in Computer Science Conference, Cambridge, MA, 1986, pp.367\u2013377."},{"key":"BF02946521_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(89)90062-X","volume":"82","author":"J-P Jouannaud","year":"1989","unstructured":"Jouannaud J-P, Kounalis E Automatic proofs by induction in theories without constructors.Information and Computation, 1989, 82: 1\u201333.","journal-title":"Information and Computation"},{"key":"BF02946521_CR3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0747-7171(08)80133-2","volume":"11","author":"D Kapur","year":"1991","unstructured":"Kapur D, Narendran P, Zhang H. Automating inductionless induction using test sets.Journal of Symbolic Computation, 1991, 11: 83\u2013111.","journal-title":"Journal of Symbolic Computation"},{"key":"BF02946521_CR4","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/3-540-59200-8_49","volume":"914","author":"K Schmid","year":"1995","unstructured":"Schmid K, Fettig R. Towards an efficient construction of test sets for deciding ground reducibility.Lecture Notes in Computer Science, 1995, 914: 86\u2013100.","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02946521.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02946521\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02946521","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:17:12Z","timestamp":1558469832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02946521"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["BF02946521"],"URL":"https:\/\/doi.org\/10.1007\/bf02946521","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}