{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:46:04Z","timestamp":1752461164797},"reference-count":35,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":7716,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1016\/s0747-7171(10)80014-8","type":"journal-article","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T09:01:52Z","timestamp":1276160512000},"page":"613-641","source":"Crossref","is-referenced-by-count":43,"title":["A method for simultaneous search for refutations and models by equational constraint solving"],"prefix":"10.1016","volume":"13","author":[{"given":"Ricardo","family":"Caferra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Zabel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(10)80014-8_bib1","series-title":"Solvable cases for the decision problem","author":"Ackermann","year":"1954"},{"key":"10.1016\/S0747-7171(10)80014-8_bib2","first-page":"3","article-title":"On generating and using examples in proof discovery","volume":"10","author":"Ballantyne","year":"1982"},{"key":"10.1016\/S0747-7171(10)80014-8_bib3","author":"Barwise","year":"1977"},{"key":"10.1016\/S0747-7171(10)80014-8_bib4","year":"1984"},{"key":"10.1016\/S0747-7171(10)80014-8_bib5","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0012853","article-title":"Solving disequations in equational theories","author":"B\u00fcrckert","year":"1988"},{"key":"10.1016\/S0747-7171(10)80014-8_bib6","first-page":"178","article-title":"A resolution principle for clauses with constraints","author":"B\u00fcrckert","year":"1990"},{"key":"10.1016\/S0747-7171(10)80014-8_bib7","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54507-7_1","article-title":"User-oriented theorem proving with the ATINF graphic proof editor","author":"Caferra","year":"1991"},{"key":"10.1016\/S0747-7171(10)80014-8_bib8","first-page":"153","article-title":"Extending resolution for model construction","author":"Caferra","year":"1990"},{"key":"10.1016\/S0747-7171(10)80014-8_bib9","author":"Comon","year":"1990"},{"key":"10.1016\/S0747-7171(10)80014-8_bib10","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0032066","article-title":"Equational formulas in order-sorted algebras","author":"Comon","year":"1990"},{"key":"10.1016\/S0747-7171(10)80014-8_bib11","first-page":"62","article-title":"Solving inequation in term algebras","author":"Comon","year":"1990"},{"key":"10.1016\/S0747-7171(10)80014-8_bib12","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0747-7171(89)80017-3","article-title":"Equational problems and disunification","volume":"7","author":"Comon","year":"1989","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/S0747-7171(10)80014-8_bib13","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":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0747-7171(10)80014-8_bib14","series-title":"The decision problem - Solvable Classes of Quantificational Formulas","author":"Dreben","year":"1979"},{"key":"10.1016\/S0747-7171(10)80014-8_bib15","series-title":"Logic for Computer Science","author":"Gallier","year":"1986"},{"key":"10.1016\/S0747-7171(10)80014-8_bib16","first-page":"111","article-title":"Constraint logic programming","author":"Jaffar","year":"1987"},{"key":"10.1016\/S0747-7171(10)80014-8_bib17","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/321958.321960","article-title":"Resolution strategies as decision procedures","volume":"23","author":"Joyner","year":"1976","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0747-7171(10)80014-8_bib18","first-page":"382","article-title":"Constrained equational reasoning","author":"Kirchner","year":"1989"},{"key":"10.1016\/S0747-7171(10)80014-8_bib19","first-page":"9","article-title":"Deduction with symbolic constraints","volume":"4","author":"Kirchner","year":"1990","journal-title":"Revue d'Intelligence Artificielle"},{"key":"10.1016\/S0747-7171(10)80014-8_bib20","article-title":"Quantifier elimination for conjunctions of linear constraints via a convex hull","author":"Lassez","year":"1991"},{"key":"10.1016\/S0747-7171(10)80014-8_bib21","doi-asserted-by":"crossref","DOI":"10.1145\/298514.298581","article-title":"Querying constraints","author":"Lassez","year":"1990"},{"key":"10.1016\/S0747-7171(10)80014-8_bib22","doi-asserted-by":"crossref","DOI":"10.1016\/0747-7171(92)90002-L","article-title":"A canonical form for generalized linear constraints","author":"Lassez","year":"1991"},{"key":"10.1016\/S0747-7171(10)80014-8_bib23","year":"1990"},{"key":"10.1016\/S0747-7171(10)80014-8_bib24","series-title":"Automatic Theorem Proving: a logical basis, vol. 6 of Fundamental Studies in Computer Science","author":"Loveland","year":"1978"},{"key":"10.1016\/S0747-7171(10)80014-8_bib25","series-title":"Automated theorem proving: a quarter-century review","author":"Loveland","year":"1984"},{"key":"10.1016\/S0747-7171(10)80014-8_bib26","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02432151","article-title":"Seventy-five problems for testing automatic theorem provers","volume":"2","author":"Pelletier","year":"1986","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S0747-7171(10)80014-8_bib27","series-title":"D\u00e9monstration automatique par des techniques de r\u00e9\u00e9criture","author":"Rusinowitch","year":"1987"},{"key":"10.1016\/S0747-7171(10)80014-8_bib28","series-title":"Using sophisticated Models in resolution theorem proving, vol. 90 of Lecture Notes in Computer Sciences","author":"Sandford","year":"1980"},{"key":"10.1016\/S0747-7171(10)80014-8_bib29","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/321420.321428","article-title":"Automatic theorem proving with renamable and semantic resolution","volume":"14","author":"Slagle","year":"1967","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0747-7171(10)80014-8_bib30","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00244275","article-title":"Automated deduction by theory resolution","volume":"1","author":"Stickel","year":"1985","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S0747-7171(10)80014-8_bib31","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/322307.322308","article-title":"Generation and verification of finite models and counter-examples using an automated theorem prover answering two open questions","volume":"29","author":"Winker","year":"1982","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0747-7171(10)80014-8_bib32","first-page":"240","article-title":"Solving open questions with automated theorem-proving program","author":"Wos","year":"1982"},{"key":"10.1016\/S0747-7171(10)80014-8_bib33","series-title":"Automated reasoning: 33 basic research problems","author":"Wos","year":"1988"},{"key":"10.1016\/S0747-7171(10)80014-8_bib34","series-title":"Open questions solved with the assistance of AURA","author":"Wos","year":"1984"},{"key":"10.1016\/S0747-7171(10)80014-8_bib35","first-page":"1","article-title":"On a bound for a complexity of terms in the resolution method","author":"Zamov","year":"1972"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717110800148?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717110800148?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,10]],"date-time":"2018-12-10T12:53:50Z","timestamp":1544446430000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717110800148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["S0747717110800148"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(10)80014-8","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}