{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:10:09Z","timestamp":1743009009841,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030944780"},{"type":"electronic","value":"9783030944797"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-94479-7_8","type":"book-chapter","created":{"date-parts":[[2022,1,7]],"date-time":"2022-01-07T09:02:57Z","timestamp":1641546177000},"page":"117-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards Dynamic Consistency Checking in\u00a0Goal-Directed Predicate Answer Set Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4148-311X","authenticated-orcid":false,"given":"Joaqu\u00edn","family":"Arias","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5199-3135","authenticated-orcid":false,"given":"Manuel","family":"Carro","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9727-0362","authenticated-orcid":false,"given":"Gopal","family":"Gupta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,7]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Arias, J., Carro, M., Chen, Z., Gupta, G.: Justifications for goal-directed constraint answer set programming. In: Proceedings 36th International Conference on Logic Programming (Technical Communications). EPTCS, vol. 325, pp. 59\u201372. Open Publishing Association (2020). https:\/\/doi.org\/10.4204\/EPTCS.325.12","DOI":"10.4204\/EPTCS.325.12"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Arias, J., Carro, M., Chen, Z., Gupta, G.: Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming. Theory and Practice of Logic Programming, pp. 1\u201330 (2021). https:\/\/doi.org\/10.1017\/S1471068421000156","DOI":"10.1017\/S1471068421000156"},{"issue":"3\u20134","key":"8_CR3","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. Theor. Pract. Logic Program. 18(3\u20134), 337\u2013354 (2018). https:\/\/doi.org\/10.1017\/S1471068418000285","journal-title":"Theor. Pract. Logic Program."},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-030-45260-5_9","volume-title":"Logic-Based Program Synthesis and Transformation","author":"J Arias","year":"2020","unstructured":"Arias, J., Chen, Z., Carro, M., Gupta, G.: Modeling and reasoning in event calculus using goal-directed constraint answer set programming. In: Gabbrielli, M. (ed.) LOPSTR 2019. LNCS, vol. 12042, pp. 139\u2013155. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45260-5_9"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-030-85713-4_25","volume-title":"Advances in Artificial Intelligence","author":"J Arias","year":"2021","unstructured":"Arias, J., Moreno-Rebato, M., Rodriguez-Garc\u00eda, J.A., Ossowski, S.: Modeling administrative discretion using goal-directed answer set programming. In: Alba, E., et al. (eds.) CAEPIA 2021. LNCS (LNAI), vol. 12882, pp. 258\u2013267. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85713-4_25"},{"issue":"4","key":"8_CR6","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1017\/S1471068417000102","volume":"17","author":"M Balduccini","year":"2017","unstructured":"Balduccini, M., Lierler, Y.: Constraint answer set solver EZCSP and why integration schemas matter. Theor. Pract. Logic Program. 17(4), 462\u2013515 (2017). https:\/\/doi.org\/10.1017\/S1471068417000102","journal-title":"Theor. Pract. Logic Program."},{"issue":"4","key":"8_CR7","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1017\/S1471068417000138","volume":"17","author":"M Banbara","year":"2017","unstructured":"Banbara, M., Kaufmann, B., Ostrowski, M., Schaub, T.: Clingcon: the next generation. Theor. Pract. Log. Program. 17(4), 408\u2013461 (2017). https:\/\/doi.org\/10.1017\/S1471068417000138","journal-title":"Theor. Pract. Log. Program."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Basu, K., Varanasi, S., Shakerin, F., Arias, J., Gupta, G.: Knowledge-driven natural language understanding of english text and its applications. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 12554\u201312563 (2021)","DOI":"10.1609\/aaai.v35i14.17488"},{"key":"8_CR9","unstructured":"Basu, K., et al.: CASPR: a commonsense reasoning-based conversational Socialbot. In: 4th Proceedings of Alexa Prize (Alexa Prize 2021) (2021)"},{"issue":"5\u20136","key":"8_CR10","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1017\/S1471068416000429","volume":"16","author":"Z Chen","year":"2016","unstructured":"Chen, Z., Marple, K., Salazar, E., Gupta, G., Tamil, L.: A physician advisory system for chronic heart failure management based on knowledge patterns. Theor. Pract. Logic Program. 16(5\u20136), 604\u2013618 (2016). https:\/\/doi.org\/10.1017\/S1471068416000429","journal-title":"Theor. Pract. Logic Program."},{"issue":"3\u20134","key":"8_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0020-0190(00)00046-6","volume":"74","author":"A Dovier","year":"2000","unstructured":"Dovier, A., Pontelli, E., Rossi, G.: A necessary condition for constructive negation in constraint logic programming. Inf. Process. Lett. 74(3\u20134), 147\u2013156 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S1471068418000054","volume":"19","author":"M Gebser","year":"2019","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. Theor. Pract. Logic Program. 19(1), 27\u201382 (2019). https:\/\/doi.org\/10.1017\/S1471068418000054","journal-title":"Theor. Pract. Logic Program."},{"key":"8_CR13","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: 5th International Conference on Logic Programming, pp. 1070\u20131080 (1988). http:\/\/www.cse.unsw.edu.au\/~cs4415\/2010\/resources\/stable.pdf"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Hall, B., et al.: Knowledge-Assisted reasoning of model-augmented system requirements with event calculus and goal-directed answer set programming. In: Proceedings 8th Workshop on Horn Clause Verification and Synthesis (2021)","DOI":"10.4204\/EPTCS.344.6"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Marple, K., Bansal, A., Min, R., Gupta, G.: Goal-Directed execution of answer set programs. In: Schreye, D.D., Janssens, G., King, A. (eds.) Principles and Practice of Declarative Programming, PPDP 2012, Leuven, Belgium - 19\u201321 September 2012, pp. 35\u201344. ACM (2012). https:\/\/doi.org\/10.1145\/2370776.2370782","DOI":"10.1145\/2370776.2370782"},{"issue":"4\u20135","key":"8_CR16","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1017\/S1471068414000118","volume":"14","author":"K Marple","year":"2014","unstructured":"Marple, K., Gupta, G.: Dynamic consistency checking in goal-directed answer set programming. Theor. Pract. Loging Program. 14(4\u20135), 415\u2013427 (2014). https:\/\/doi.org\/10.1017\/S1471068414000118","journal-title":"Theor. Pract. Loging Program."},{"key":"8_CR17","unstructured":"Marple, K., Salazar, E., Gupta, G.: Computing Stable Models of Normal Logic Programs Without Grounding. arXiv:1709.00501 (2017). http:\/\/arxiv.org\/abs\/1709.00501"},{"key":"8_CR18","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints: An Introduction","author":"K Marriott","year":"1998","unstructured":"Marriott, K., Stuckey, P.J.: Programming with Constraints: An Introduction. MIT Press, Cambridge (1998)"},{"key":"8_CR19","unstructured":"Mellarkod, V.S., Gelfond, M., Zhang, Y.: Integrating Answer Set Programming and Constraint Logic Programming. Technical Report, Texas Tech University, October 2008, this is a long version of [20]. https:\/\/www.depts.ttu.edu\/cs\/research\/documents\/46.pdf"},{"issue":"1\u20134","key":"8_CR20","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10472-009-9116-y","volume":"53","author":"VS Mellarkod","year":"2008","unstructured":"Mellarkod, V.S., Gelfond, M., Zhang, Y.: Integrating answer set programming and constraint logic programming. Ann. Math. Artif. Intell. 53(1\u20134), 251\u2013287 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Morris, J.: Constraint answer set programming as a tool to improve legislative drafting: a rules as code experiment. In: ICAIL, pp. 262\u2013263. ACM (2021)","DOI":"10.1145\/3462757.3466084"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Pereira, L.M., Apar\u00edcio, J.N.: Relevant counterfactuals. In: EPIA 89, 4th Portuguese Conference on Artificial Intelligence, Lisbon, Portugal, 26\u201329 September 1989, Proceedings, pp. 107\u2013118 (1989). https:\/\/doi.org\/10.1007\/3-540-51665-4_78","DOI":"10.1007\/3-540-51665-4_78"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"Shakerin, F., Gupta, G.: Induction of non-monotonic logic programs to explain boosted tree models using LIME. In: AAAI 2019, pp. 3052\u20133059, January\u2013February 2019. https:\/\/doi.org\/10.1609\/aaai.v33i01.33013052","DOI":"10.1609\/aaai.v33i01.33013052"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Stuckey, P.: Constructive negation for constraint logic programming. In: Proceedings LICS 1991, pp. 328\u2013339 (1991)","DOI":"10.1109\/LICS.1991.151657"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-030-45260-5_5","volume-title":"Logic-Based Program Synthesis and Transformation","author":"SC Varanasi","year":"2020","unstructured":"Varanasi, S.C., Salazar, E., Mittal, N., Gupta, G.: Synthesizing imperative code from answer set programming specifications. In: Gabbrielli, M. (ed.) LOPSTR 2019. LNCS, vol. 12042, pp. 75\u201389. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45260-5_5"}],"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-030-94479-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T21:26:28Z","timestamp":1726435588000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94479-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030944780","9783030944797"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94479-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 January 2022","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":"Philadelphia, PA","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl22.sigplan.org\/home\/PADL-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}