{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,14]],"date-time":"2022-12-14T15:29:23Z","timestamp":1671031763091},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":7471,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0168-0072(93)90097-w","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T07:34:16Z","timestamp":1041060856000},"page":"273-286","source":"Crossref","is-referenced-by-count":2,"title":["A decision algorithm for linear sentences on a PFM"],"prefix":"10.1016","volume":"59","author":[{"given":"Lian","family":"Li","sequence":"first","affiliation":[]},{"given":"Huilin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yixun","family":"Liu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(93)90097-W_bib1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0304-3975(83)90005-1","article-title":"Decidable sentences of Church-Rosser congruences","volume":"24","author":"Book","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(93)90097-W_bib2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0747-7171(87)80021-4","article-title":"True systems as rewriting systems","volume":"3","author":"Book","year":"1987","journal-title":"J. Symbolic Computation"},{"issue":"2","key":"10.1016\/0168-0072(93)90097-W_bib3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/5383.5389","article-title":"Equality-based binary resolution","volume":"33","author":"Digricoli","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0168-0072(93)90097-W_bib4","series-title":"A Mathematical Introduction to Logic","author":"Enderton","year":"1972"},{"key":"10.1016\/0168-0072(93)90097-W_bib5","article-title":"The Computational Complexity of Logical Theories","volume":"718","author":"Ferrante","year":"1979"},{"key":"10.1016\/0168-0072(93)90097-W_bib6","series-title":"Basic Algebra I","author":"Jacobson","year":"1974"},{"key":"10.1016\/0168-0072(93)90097-W_bib7","series-title":"Basic Algebra II","author":"Jacobson","year":"1980"},{"issue":"4","key":"10.1016\/0168-0072(93)90097-W_bib8","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1137\/0608057","article-title":"Fast parallel computation of Hermite and Smith forms of polynomial matrices","volume":"8","author":"Kaltofen","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0168-0072(93)90097-W_bib9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(85)90131-8","article-title":"Solving systems of linear equations over polynomials","volume":"39","author":"Kannan","year":"1985","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/0168-0072(93)90097-W_bib10","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0208040","article-title":"Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix","volume":"8","author":"Kannan","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(93)90097-W_bib11","unstructured":"Li Lian, Li Huilin and Liu Yixun, On the satisfiability of a system of linear equations for quantifiers, Scientia Sinica, to appear."},{"key":"10.1016\/0168-0072(93)90097-W_bib12","doi-asserted-by":"crossref","unstructured":"D.W. Loveland, Automated theorem-proving: a quarter-century review, in: Contemporary Mathematics, Vol. 29: Automated Theorem Proving: After 25 Years, 1\u201346.","DOI":"10.1090\/conm\/029\/749237"},{"key":"10.1016\/0168-0072(93)90097-W_bib13","series-title":"Abstract Algebra: A Computational Approach","author":"Sims","year":"1984"},{"key":"10.1016\/0168-0072(93)90097-W_bib14","series-title":"Komplexit\u00e4t von Entscheidungs-problemen","author":"Specker","year":"1976"},{"key":"10.1016\/0168-0072(93)90097-W_bib15","series-title":"The Basic Principles of Theorem Proving in Elementary Geometry","author":"Wu","year":"1984"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729390097W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729390097W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T15:53:42Z","timestamp":1553961222000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729390097W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["016800729390097W"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(93)90097-w","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}