{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:59:56Z","timestamp":1760061596333},"reference-count":29,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2015,4,16]],"date-time":"2015-04-16T00:00:00Z","timestamp":1429142400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2016,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>CLP(H) is an instantiation of the general constraint logic programming scheme with the constraint domain of hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms, for hedges, and for function symbols. Constraints involve equations between unranked terms and atoms for regular hedge language membership. We study algebraic semantics of CLP(H) programs, define a sound, terminating, and incomplete constraint solver, investigate two fragments of constraints for which the solver returns a complete set of solutions, and describe classes of programs that generate such constraints.<\/jats:p>","DOI":"10.1017\/s1471068415000071","type":"journal-article","created":{"date-parts":[[2015,4,16]],"date-time":"2015-04-16T09:30:37Z","timestamp":1429176637000},"page":"141-162","source":"Crossref","is-referenced-by-count":3,"title":["<i>CLP(H):<\/i>Constraint logic programming for hedges"],"prefix":"10.1017","volume":"16","author":[{"given":"BESIK","family":"DUNDUA","sequence":"first","affiliation":[]},{"given":"M\u00c1RIO","family":"FLORIDO","sequence":"additional","affiliation":[]},{"given":"TEMUR","family":"KUTSIA","sequence":"additional","affiliation":[]},{"given":"MIRCEA","family":"MARIN","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"S1471068415000071_ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1352582.1352583"},{"key":"S1471068415000071_ref8","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1997.0186"},{"key":"S1471068415000071_ref16","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004410"},{"key":"S1471068415000071_ref21","first-page":"77","volume-title":"Proc. of the 19th International Workshop on Unification UNIF'05","author":"Kutsia","year":"2005"},{"key":"S1471068415000071_ref23","first-page":"55","volume-title":"Proc. of the 4th International Workshop on the Implementation of Logics (WIL'03)","author":"Marin","year":"2003"},{"key":"S1471068415000071_ref13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-3-319-07151-0_18","volume-title":"Proc. of Functional and Logic Programming \u2013 12th International Symposium, FLOPS 2014, Kanazawa, Japan, June 4\u20136","author":"Dundua","year":"2014"},{"key":"S1471068415000071_ref7","doi-asserted-by":"publisher","DOI":"10.1145\/79204.79210"},{"key":"S1471068415000071_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30469-2_17"},{"key":"S1471068415000071_ref2","first-page":"36","volume-title":"Proc. Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26\u201328, 2007","author":"Balland","year":"2007"},{"key":"S1471068415000071_ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80917-4"},{"key":"S1471068415000071_ref19","first-page":"157","volume-title":"Proc of Artificial Intelligence and Symbolic Computation, 7th International Conference, AISC 2004, Linz, Austria, September 22\u201324","author":"Kutsia","year":"2004"},{"key":"S1471068415000071_ref14","first-page":"430","volume-title":"Proc. of Conditional Term Rewriting Systems, 3rd International Workshop, CTRS-92, Pont-\u00e0-Mousson, France, July 8\u201310","author":"Ganzinger","year":"1992"},{"key":"S1471068415000071_ref6","first-page":"1","volume-title":"Proc. of 9th ACM International Workshop on Web Information and Data Management (WIDM 2007), Lisbon, Portugal, November 9","author":"Coelho","year":"2007"},{"key":"S1471068415000071_ref5","first-page":"148","volume-title":"Proc. Advanced Web and Network Technologies, and Applications, APWeb 2006 International Workshops: XRA, IWSN, MEGA, and ICSE, Harbin, China, January 16\u201318, 2006","author":"Coelho","year":"2006"},{"key":"S1471068415000071_ref3","volume-title":"All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic","author":"Clavel","year":"2007"},{"key":"S1471068415000071_ref25","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/1.4.497"},{"key":"S1471068415000071_ref29","volume-title":"The Mathematica Book","author":"Wolfram","year":"2003"},{"key":"S1471068415000071_ref28","first-page":"181","volume-title":"Logic Programming, Proc. of the 6th International Conference, Lisbon, Portugal, June 19\u201323","author":"Walinsky","year":"1989"},{"key":"S1471068415000071_ref9","first-page":"29","volume-title":"Proceedings of the 1985 Symposium on Logic Programming, Boston, Massachusetts, USA, July 15\u201318","author":"Dembinski","year":"1985"},{"key":"S1471068415000071_ref11","doi-asserted-by":"publisher","DOI":"10.1145\/365151.365169"},{"key":"S1471068415000071_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90026-3"},{"key":"S1471068415000071_ref22","first-page":"215","volume-title":"Proc. of Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2\u20136","author":"Kutsia","year":"2005"},{"key":"S1471068415000071_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00182-4"},{"key":"S1471068415000071_ref26","first-page":"681","volume-title":"Logic Programming, Proc. of the 1994 International Symposium, Ithaca, New York, USA, November 13\u201317","author":"Rajasekar","year":"1994"},{"key":"S1471068415000071_ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2006.12.002"},{"key":"S1471068415000071_ref24","doi-asserted-by":"publisher","DOI":"10.3166\/jancl.16.151-168"},{"key":"S1471068415000071_ref18","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/3-540-44881-0_26","volume-title":"Proc. of Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9\u201311","author":"Kutsia","year":"2003"},{"key":"S1471068415000071_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(98)10002-X"},{"key":"S1471068415000071_ref15","unstructured":"Genesereth M. R. and Fikes R. E. 1992. Knowledge Interchange Format, Version 3.0 Reference Manual. Tech. Rep. Logic-92-1, Stanford University, Stanford, CA, USA."}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068415000071","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T23:36:18Z","timestamp":1598916978000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068415000071\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,16]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["S1471068415000071"],"URL":"https:\/\/doi.org\/10.1017\/s1471068415000071","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,16]]}}}