{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T20:18:10Z","timestamp":1730319490947,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,9]],"date-time":"2017-10-09T00:00:00Z","timestamp":1507507200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,9]]},"DOI":"10.1145\/3131851.3131863","type":"proceedings-article","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T12:51:09Z","timestamp":1507812669000},"page":"115-126","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Selective unification in constraint logic programming"],"prefix":"10.1145","author":[{"given":"Fred","family":"Mesnard","sequence":"first","affiliation":[{"name":"Universit\u00e9 de la R\u00e9union, France"}]},{"given":"\u00c9tienne","family":"Payet","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de la R\u00e9union, France"}]},{"given":"Germ\u00e1n","family":"Vidal","sequence":"additional","affiliation":[{"name":"Universitat Polit\u00e8cnica, de Val\u00e8ncia, Spain"}]}],"member":"320","published-online":{"date-parts":[[2017,10,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11609773_28"},{"volume-title":"Constructive Negation Based on the Completed Database","author":"Chan D.","key":"e_1_3_2_1_2_1","unstructured":"D. Chan . 1988. Constructive Negation Based on the Completed Database . In ICLP\/SLP. MIT Press , 111--125. D. Chan. 1988. Constructive Negation Based on the Completed Database. In ICLP\/SLP. MIT Press, 111--125."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/2963594"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00046-6"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037167"},{"key":"e_1_3_2_1_6_1","first-page":"4","article-title":"Failure tabled constraint logic programming by interpolation","volume":"13","author":"Gange G.","year":"2013","unstructured":"G. Gange , J. A. Navas , P. Schachte , H. S\u00f8ndergaard , and P. J. Stuckey . 2013 . Failure tabled constraint logic programming by interpolation . TPLP 13 , 4 -- 5 (2013), 593--607. G. Gange, J. A. Navas, P. Schachte, H. S\u00f8ndergaard, and P. J. Stuckey. 2013. Failure tabled constraint logic programming by interpolation. TPLP 13, 4--5 (2013), 593--607.","journal-title":"TPLP"},{"issue":"3","key":"e_1_3_2_1_7_1","first-page":"3","article-title":"OFAI clp(q,r) Manual","volume":"1","author":"Holzbaur C.","year":"1995","unstructured":"C. Holzbaur . 1995 . OFAI clp(q,r) Manual , Edition 1 . 3 . 3 . Technical Report TR-95-09. Austrian Research Institute. C. Holzbaur. 1995. OFAI clp(q,r) Manual, Edition 1.3.3. Technical Report TR-95-09. Austrian Research Institute.","journal-title":"Edition"},{"key":"e_1_3_2_1_8_1","unstructured":"J. E. Hopcroft and J. D. Ullman. 1979. Introduction to Automata Theory Languages and Computation. Addison Wesley. J. E. Hopcroft and J. D. Ullman. 1979. Introduction to Automata Theory Languages and Computation. Addison Wesley."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/41625.41635"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90033-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(98)10002-X"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491425"},{"key":"e_1_3_2_1_13_1","volume-title":"An Interpolation Method for CLP Traversal. In CP (Lecture Notes in Computer Science)","volume":"5732","author":"Jaffar J.","unstructured":"J. Jaffar , A. E. Santosa , and R. Voicu . 2009 . An Interpolation Method for CLP Traversal. In CP (Lecture Notes in Computer Science) , Vol. 5732 . Springer, 454--469. J. Jaffar, A. E. Santosa, and R. Voicu. 2009. An Interpolation Method for CLP Traversal. In CP (Lecture Notes in Computer Science), Vol. 5732. Springer, 454--469."},{"key":"e_1_3_2_1_14_1","volume-title":"Foundations of Logic Programming","author":"Lloyd J. W.","unstructured":"J. W. Lloyd . 1987. Foundations of Logic Programming . Springer-Verlag , Berlin . 2 nd Ed. J. W. Lloyd. 1987. Foundations of Logic Programming. Springer-Verlag, Berlin. 2nd Ed.","edition":"2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5625.003.0004"},{"key":"e_1_3_2_1_16_1","first-page":"4","article-title":"Concolic testing in logic programming","volume":"15","author":"Mesnard F.","year":"2015","unstructured":"F. Mesnard , \u00c9. Payet, and G. Vidal . 2015 . Concolic testing in logic programming . TPLP 15 , 4 -- 5 (2015), 711--725. F. Mesnard, \u00c9. Payet, and G. Vidal. 2015. Concolic testing in logic programming. TPLP 15, 4--5 (2015), 711--725.","journal-title":"TPLP"},{"key":"e_1_3_2_1_17_1","unstructured":"F. Mesnard \u00c9. Payet and G. Vidal. 2016. On the Completeness of Selective Unification in Concolic Testing of Logic Programs. CoRR abs\/1608.03054 (2016). F. Mesnard \u00c9. Payet and G. Vidal. 2016. On the Completeness of Selective Unification in Concolic Testing of Logic Programs. CoRR abs\/1608.03054 (2016)."},{"volume-title":"CLP(Rlin) Revised. In Proc. of the Joint International Conf. and Symposium on Logic Programming, M. Maher (Ed.). The MIT Press, 22--36","author":"Refalo P.","key":"e_1_3_2_1_18_1","unstructured":"P. Refalo and P. Van Hentenryck . 1996 . CLP(Rlin) Revised. In Proc. of the Joint International Conf. and Symposium on Logic Programming, M. Maher (Ed.). The MIT Press, 22--36 . P. Refalo and P. Van Hentenryck. 1996. CLP(Rlin) Revised. In Proc. of the Joint International Conf. and Symposium on Logic Programming, M. Maher (Ed.). The MIT Press, 22--36."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32211-2_16"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1048"}],"event":{"name":"PPDP'17: 19th International Symposium on Principles and Practice of Declarative Programming","acronym":"PPDP'17","location":"Namur Belgium"},"container-title":["Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3131851.3131863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T12:51:40Z","timestamp":1673700700000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3131851.3131863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,9]]},"references-count":20,"alternative-id":["10.1145\/3131851.3131863","10.1145\/3131851"],"URL":"https:\/\/doi.org\/10.1145\/3131851.3131863","relation":{},"subject":[],"published":{"date-parts":[[2017,10,9]]},"assertion":[{"value":"2017-10-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}