{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T14:05:49Z","timestamp":1763388349141},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":3669,"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":[[2003,7]]},"DOI":"10.1016\/s0747-7171(03)00029-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T21:48:28Z","timestamp":1051134508000},"page":"235-269","source":"Crossref","is-referenced-by-count":5,"title":["On the complexity of equational problems in CNF"],"prefix":"10.1016","volume":"36","author":[{"given":"Reinhard","family":"Pichler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(03)00029-4_B1","series-title":"Foundations of Databases","author":"Abiteboul","year":"1995"},{"key":"10.1016\/S0747-7171(03)00029-4_B2","series-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","first-page":"41","article-title":"Unification theory","author":"Baader","year":"1994"},{"key":"10.1016\/S0747-7171(03)00029-4_B3","series-title":"IJCAI\u201995, Proc. 14th Int. Joint Conf. on Artificial Intelligence","first-page":"328","article-title":"Extending semantic resolution via automated model building: applications","author":"Caferra","year":"1995"},{"key":"10.1016\/S0747-7171(03)00029-4_B4","series-title":"JELIA\u201990, Proc. Logics in AI, European Workshop","first-page":"153","article-title":"Extending resolution for model construction","volume":"no. 478","author":"Caferra","year":"1991"},{"key":"10.1016\/S0747-7171(03)00029-4_B5","series-title":"FGCS\u201984, Proc. Int. Conf. on Fifth Generation Computer Systems","first-page":"85","article-title":"Equations and inequations on finite and infinite trees","author":"Colmerauer","year":"1984"},{"issue":"2","key":"10.1016\/S0747-7171(03)00029-4_B6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1006\/inco.1994.1056","article-title":"Equational formulae with membership constraints","volume":"112","author":"Comon","year":"1994","journal-title":"Information and Computation"},{"issue":"3\/4","key":"10.1016\/S0747-7171(03)00029-4_B7","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"},{"issue":"2","key":"10.1016\/S0747-7171(03)00029-4_B8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1093\/logcom\/6.2.173","article-title":"Hyperresolution and automated model building","volume":"6","author":"Ferm\u00fcller","year":"1996","journal-title":"Journal of Logic and Computation"},{"key":"10.1016\/S0747-7171(03)00029-4_B9","series-title":"LICS\u201999, Proc. 14th Annual IEEE Symp. on Logic in Computer Science","first-page":"306","article-title":"Working with ARMs: complexity results on atomic representations of Herbrand models","author":"Gottlob","year":"1999"},{"key":"10.1016\/S0747-7171(03)00029-4_B10","series-title":"ICLP\u201987, Proc. 4th Int. Conf. on Logic Programming","first-page":"219","article-title":"Answer sets and negation as failure","author":"Kunen","year":"1987"},{"key":"10.1016\/S0747-7171(03)00029-4_B11","series-title":"MFCS\u201991, Proc. 16th Int. Symp. on Mathematical Foundations of Computer Science","first-page":"1","article-title":"Elimination of negation in term algebras","volume":"no. 520","author":"Lassez","year":"1991"},{"issue":"3","key":"10.1016\/S0747-7171(03)00029-4_B12","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF00243794","article-title":"Explicit representation of terms defined by counter examples","volume":"3","author":"Lassez","year":"1987","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S0747-7171(03)00029-4_B13","series-title":"ICLP\u201989, Proc. 6th Int. Conf. on Logic Programming","first-page":"585","article-title":"A deduction procedure for first order programs","author":"Lugiez","year":"1989"},{"key":"10.1016\/S0747-7171(03)00029-4_B14","series-title":"LICS\u201988, Proc. 3rd Annual Symp. on Logic in Computer Science","first-page":"348","article-title":"Complete axiomatizations of the algebras of finite, rational and infinite trees","author":"Maher","year":"1988"},{"issue":"2","key":"10.1016\/S0747-7171(03)00029-4_B15","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An efficient unification algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0747-7171(03)00029-4_B16","series-title":"CADE-16, Proc. 16th Int. Conf. on Automated Deduction","first-page":"97","article-title":"Solving equational problems efficiently","volume":"no. 1632","author":"Pichler","year":"1999"},{"key":"10.1016\/S0747-7171(03)00029-4_B17","unstructured":"Pichler, R., 2000a. On the complexity of equational problems in CNF over a finite domain. In: Baumgartner, P., Zhang, H. (eds), FTP 2000, Proc. 3rd Int. Workshop on First-Order Theorem Proving. Fachberichte Informatik der Universit\u00e4t Koblenz-Landau, St. Andrews, Scotland, UK, pp. 182\u2013193. Available at http:\/\/www.uni-koblenz.de\/fb4\/publikationen\/gelbereihe\/RR-5-2000\/"},{"issue":"2","key":"10.1016\/S0747-7171(03)00029-4_B18","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1006\/jsco.1999.0361","article-title":"Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria","volume":"29","author":"Pichler","year":"2000","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"10.1016\/S0747-7171(03)00029-4_B19","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0747-7171(03)00029-4_B20","series-title":"ILPS\u201991, Proc. Int. Symp. on Logic Programming","first-page":"35","article-title":"A complete top-down interpreter for first order programs","author":"Sato","year":"1991"},{"issue":"1\u201312","key":"10.1016\/S0747-7171(03)00029-4_B21","article-title":"The polynomial time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0747-7171(03)00029-4_B22","volume":"no. II","author":"Ullman","year":"1989"},{"key":"10.1016\/S0747-7171(03)00029-4_B23","series-title":"CADE-13, Proc. 13th Int. Conf. on Automated Deduction","first-page":"316","article-title":"An improved lower bound for the elementary theories of trees","volume":"no. 690","author":"Vorobyov","year":"1996"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717103000294?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717103000294?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T02:58:10Z","timestamp":1553223490000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717103000294"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0747717103000294"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(03)00029-4","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}