{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:46:51Z","timestamp":1760597211570},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[2006,2]]},"abstract":"<jats:p> The Lexicographic Path Ordering (LPO) poses an interesting problem to the implementor: How to achieve a version that is both efficient and correct? The method of program transformation helps us to develop an efficient version step-by-step, making clear the essential ideas, while retaining correctness. By theoretical analysis we show that the worst-case behavior is thereby changed from exponential to polynomial. Detailed measurements show the practical improvements of the different variants. They allow us to assess experimentally various optimizations suggested for LPO. <\/jats:p>","DOI":"10.1142\/s0218213006002564","type":"journal-article","created":{"date-parts":[[2006,1,24]],"date-time":"2006-01-24T11:15:46Z","timestamp":1138101346000},"page":"53-79","source":"Crossref","is-referenced-by-count":9,"title":["THINGS TO KNOW WHEN IMPLEMENTING LPO"],"prefix":"10.1142","volume":"15","author":[{"given":"BERND","family":"L\u00d6CHNER","sequence":"first","affiliation":[{"name":"FB Informatik, Technische Universit\u00e4t Kaiserslautern, Kaiserslautern, Germany"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","unstructured":"I. V.\u00a0Ramakrishnan, R.\u00a0Sekar and A.\u00a0Voronkov, Handbook of Automated Reasoning\u00a0II, eds. A.\u00a0Robinson and A.\u00a0Voronkov (Elsevier Science, 2001)\u00a0pp. 1853\u20131964."},{"key":"rf3","first-page":"127","volume":"15","author":"L\u00f6chner B.","journal-title":"AI Communications"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321996"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57499-9_23"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044450813-3\/50011-4"},{"key":"rf11","volume-title":"Dynamic Programming","author":"Bellman R. E.","year":"1957"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1038\/218019a0"},{"key":"rf13","doi-asserted-by":"crossref","unstructured":"D.\u00a0Kapur, P.\u00a0Narendran and G.\u00a0Sivakumar, Coll. on Trees in Algebra and Programming, LNCS\u00a0185, eds. H.\u00a0Ehrig (Springer, 1985)\u00a0pp. 173\u2013187.","DOI":"10.1007\/3-540-15198-2_11"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90105-I"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044450813-3\/50029-1"},{"key":"rf21","first-page":"111","volume":"15","author":"Schulz S.","journal-title":"J. of AI Communications"},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2002.3158"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752"}],"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213006002564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T02:31:03Z","timestamp":1565145063000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213006002564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":13,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2006,2]]}},"alternative-id":["10.1142\/S0218213006002564"],"URL":"https:\/\/doi.org\/10.1142\/s0218213006002564","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}