{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:41Z","timestamp":1759638401282},"reference-count":17,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1016\/0020-0190(93)90210-z","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"237-241","source":"Crossref","is-referenced-by-count":20,"title":["Satisfiability of the smallest binary program"],"prefix":"10.1016","volume":"45","author":[{"given":"Philipp","family":"Hanschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"W\u00fcrtz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90210-Z_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0049-237X(08)70839-5","article-title":"On the decision problem for formulas in which all disjunctions are binary","author":"Aanderaa","year":"1971","journal-title":"Proc. 2nd Scandinavian Logic Symp."},{"key":"10.1016\/0020-0190(93)90210-Z_BIB2","series-title":"Proc. Conf. on Automated Deduction","first-page":"94","article-title":"Cycle unification","volume":"607","author":"Bibel","year":"1992"},{"key":"10.1016\/0020-0190(93)90210-Z_BIB3","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1145\/355592.365646","article-title":"Flow diagrams, Turing machines and languages with only two formation rules","volume":"9","author":"B\u00f6hm","year":"1966","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90210-Z_BIB4","series-title":"Dissertation","article-title":"Reduktionstypen in Krom- und Hornformeln","author":"B\u00f6rger","year":"1971"},{"key":"10.1016\/0020-0190(93)90210-Z_BIB5","first-page":"649","article-title":"A practical technique for detecting non-terminating queries for a restricted class of Horn clauses, using directed, weighted graphs","author":"DeSchreye","year":"1990","journal-title":"Proc. Internat. Conf. on Logic Programming"},{"key":"10.1016\/0020-0190(93)90210-Z_BIB6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(90)90066-Q","article-title":"Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming","volume":"75","author":"Devienne","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(93)90210-Z_BIB7","article-title":"Weighted graphs: A tool for logic programming","author":"Devienne","year":"1986","journal-title":"Proc. 11th Coll. on Trees in Algebra and Programming (CAAP86)"},{"key":"10.1016\/0020-0190(93)90210-Z_BIB8","doi-asserted-by":"crossref","unstructured":"P. Devienne, P. Lebegue and J.-C. Routier, Halting problem of one binary Horn clause is undecidable, STACS, to appear.","DOI":"10.1007\/3-540-56503-5_7"},{"issue":"2","key":"10.1016\/0020-0190(93)90210-Z_BIB9","doi-asserted-by":"crossref","first-page":"341","DOI":"10.2307\/2272233","article-title":"Krom formulas with one dyadic predicate letter","volume":"46","author":"Lewis","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0020-0190(93)90210-Z_BIB10","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0020-0190(93)90210-Z_BIB11","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1992.267755","article-title":"Undecidability of the Horn-clause implication problem","author":"Marcinkowski","year":"1992","journal-title":"Proc. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90210-Z_BIB12","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","article-title":"A variant of a recursively unsolvable problem","volume":"52","author":"Post","year":"1946","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0020-0190(93)90210-Z_BIB13","article-title":"Solvable classes of cycle unification problems","author":"Salzer","year":"1992","journal-title":"IMYCS, Smolenice (CSFR)"},{"key":"10.1016\/0020-0190(93)90210-Z_BIB14","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(86)90003-2","article-title":"Controlling recursive inference","volume":"30","author":"Smith","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0020-0190(93)90210-Z_BIB15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(88)90146-6","article-title":"Implication of clauses is undecidable","volume":"59","author":"Schmidt-Scha\u03b2","year":"1988","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/0020-0190(93)90210-Z_BIB16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","article-title":"Efficient tests for topdown termination of logical rules","volume":"35","author":"Ullman","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(93)90210-Z_BIB17","series-title":"Proc. European Conf. on Artificial Intelligence","first-page":"60","article-title":"Unifying cycles","author":"W\u00fcrtz","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390210Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390210Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:39:32Z","timestamp":1580899172000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390210Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["002001909390210Z"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90210-z","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}