{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:13:45Z","timestamp":1757780025901,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031849237"},{"type":"electronic","value":"9783031849244"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-84924-4_11","type":"book-chapter","created":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T12:01:15Z","timestamp":1742212875000},"page":"163-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Leveraging LLM Reasoning with\u00a0Dual Horn Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7192-9421","authenticated-orcid":false,"given":"Paul","family":"Tarau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,18]]},"reference":[{"issue":"3\u20134","key":"11_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1017\/S1471068418000285","volume":"18","author":"J Arias","year":"2018","unstructured":"Arias, J., Carro, M., Salazar, E., Marple, K., Gupta, G.: Constraint answer set programming without grounding. Theory Pract. Logic Program. 18(3\u20134), 337\u2013354 (2018). https:\/\/doi.org\/10.1017\/S1471068418000285","journal-title":"Theory Pract. Logic Program."},{"unstructured":"Chan, D.: Constructive negation based on the completed database. In: Kowalski, R.A., Bowen, K.A. (eds.) Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, USA, 15\u201319 August 1988 (2 Volumes), pp. 111\u2013125. MIT Press (1988)","key":"11_CR2"},{"doi-asserted-by":"publisher","unstructured":"Chandru, V., Coullard, C.R., Hammer, P.L., Monta\u00f1ez, M., Sun, X.: On renamable Horn and generalized Horn functions. Ann. Math. Artif. Intell. 1(1-4), 33\u201347 (1990). https:\/\/doi.org\/10.1007\/BF01531069","key":"11_CR3","DOI":"10.1007\/BF01531069"},{"doi-asserted-by":"publisher","unstructured":"Cingillioglu, N., Russo, A.: Learning invariants through soft unification (2020). https:\/\/doi.org\/10.48550\/arXiv.1909.07328","key":"11_CR4","DOI":"10.48550\/arXiv.1909.07328"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"WF Dowling","year":"1984","unstructured":"Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional horn formulae. J. Log. Program. 1(3), 267\u2013284 (1984). https:\/\/doi.org\/10.1016\/0743-1066(84)90014-1","journal-title":"J. Log. Program."},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"795","DOI":"10.2307\/2275431","volume":"57","author":"R Dyckhoff","year":"1992","unstructured":"Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. J. Symb. Log. 57(3), 795\u2013807 (1992). https:\/\/doi.org\/10.2307\/2275431","journal-title":"J. Symb. Log."},{"unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Complexity results for checking equivalence of stratified logic programs. In: IJCAI, pp. 330\u2013335 (2007)","key":"11_CR7"},{"unstructured":"Eshghi, K., Kowalski, R.A.: Abduction compared with negation by failure. In: Levi, G., Martelli, M. (eds.) Logic Programming, Proceedings of the Sixth International Conference, Lisbon, Portugal, 19\u201323 June 1989, pp. 234\u2013254. MIT Press (1989)","key":"11_CR8"},{"doi-asserted-by":"publisher","unstructured":"Gallier, J.H., Raatz, S.: HORNLOG: a graph-based interpreter for general Horn clauses. J. Logic Program. 4(2), 119\u2013155 (1987). https:\/\/doi.org\/10.1016\/0743-1066(87)90015-X. https:\/\/www.sciencedirect.com\/science\/article\/pii\/074310668790015X","key":"11_CR9","DOI":"10.1016\/0743-1066(87)90015-X"},{"unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K.A. (eds.) Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, USA, 15\u201319 August 1988 (2 Volumes), pp. 1070\u20131080. MIT Press (1988)","key":"11_CR10"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-53162-9_41","volume-title":"Algebraic and Logic Programming","author":"K Kanchanasut","year":"1990","unstructured":"Kanchanasut, K., Stuckey, P.: Eliminating negation from normal logic programs. In: Kirchner, H., Wechler, W. (eds.) Algebraic and Logic Programming, pp. 217\u2013231. Springer, Heidelberg (1990)"},{"unstructured":"Miller, D.: A survey of the proof-theoretic foundations of logic programming. CoRR abs\/2109.01483 (2021). https:\/\/arxiv.org\/abs\/2109.01483","key":"11_CR12"},{"key":"11_CR13","volume-title":"The Logic of Scientific Discovery","author":"KR Popper","year":"1934","unstructured":"Popper, K.R.: The Logic of Scientific Discovery. Hutchinson, London (1934)"},{"doi-asserted-by":"publisher","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216\u2013226. Association for Computing Machinery, New York (1978). https:\/\/doi.org\/10.1145\/800133.804350","key":"11_CR14","DOI":"10.1145\/800133.804350"},{"doi-asserted-by":"publisher","unstructured":"Stuckey, P.: Negation and constraint logic programming. Inf. Comput. 118(1), 12\u201333 (1995). https:\/\/doi.org\/10.1006\/inco.1995.1048. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540185710486","key":"11_CR15","DOI":"10.1006\/inco.1995.1048"},{"issue":"5","key":"11_CR16","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1017\/S1471068422000254","volume":"22","author":"P Tarau","year":"2022","unstructured":"Tarau, P.: Abductive reasoning in intuitionistic propositional logic via theorem synthesis. Theory Pract. Logic Program. 22(5), 693\u2013707 (2022). https:\/\/doi.org\/10.1017\/S1471068422000254","journal-title":"Theory Pract. Logic Program."},{"unstructured":"Tarau, P.: Full automation of goal-driven LLM dialog threads with and-or recursors and refiner oracles arXiv:2306.14077 (2023)","key":"11_CR17"},{"doi-asserted-by":"publisher","unstructured":"Tarau, P.: System description: deepllm, casting dialog threads into logic programs. In: Gibbons, J., Miller, D. (eds.) Functional and Logic Programming, pp. 117\u2013134. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-97-2300-3_7","key":"11_CR18","DOI":"10.1007\/978-981-97-2300-3_7"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-84924-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T12:01:18Z","timestamp":1742212878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-84924-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031849237","9783031849244"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-84924-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denver, CO","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}