{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:03:17Z","timestamp":1743076997969,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031215407"},{"type":"electronic","value":"9783031215414"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21541-4_2","type":"book-chapter","created":{"date-parts":[[2022,12,13]],"date-time":"2022-12-13T06:02:41Z","timestamp":1670911361000},"page":"20-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Generalization of\u00a0Learned Constraints for\u00a0ASP Solving in\u00a0Temporal Domains"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5546-9939","authenticated-orcid":false,"given":"Javier","family":"Romero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7456-041X","authenticated-orcid":false,"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3288-8978","authenticated-orcid":false,"given":"Klaus","family":"Strauch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,14]]},"reference":[{"issue":"1\u20132","key":"2_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1080\/11663081.2013.798985","volume":"23","author":"F Aguado","year":"2013","unstructured":"Aguado, F., Cabalar, P., Di\u00e9guez, M., P\u00e9rez, G., Vidal, C.: Temporal equilibrium logic: a survey. J. Appl. Non-Classical Logics 23(1\u20132), 2\u201324 (2013). https:\/\/doi.org\/10.1080\/11663081.2013.798985","journal-title":"J. Appl. Non-Classical Logics"},{"key":"2_CR2","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Boutilier, C. (ed.) Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 399\u2013404. AAAI\/MIT Press (2009)"},{"key":"2_CR3","unstructured":"Cabalar, P., Di\u00e9guez, M., Hahn, S., Schaub, T.: Automata for dynamic answer set solving: preliminary report. In: Proceedings of the Fourteenth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2021) (2021). http:\/\/ceur-ws.org\/Vol-2970\/aspocpinvited1.pdf"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1017\/S1471068420000368","volume":"20","author":"R Comploi-Taupe","year":"2020","unstructured":"Comploi-Taupe, R., Weinzierl, A., Friedrich, G.: Conflict generalisation in asp: learning correct and effective non-ground constraints. Theory Pract. Logic Program. 20, 799\u2013814 (2020). https:\/\/doi.org\/10.1017\/S1471068420000368","journal-title":"Theory Pract. Logic Program."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Cuteri, B., Dodaro, C., Ricca, F., Sch\u00fcller, P.: Overcoming the grounding bottleneck due to constraints in ASP solving: constraints become propagators. In: Bessiere, C. (ed.) Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI 2020), pp. 1688\u20131694. ijcai.org (2020)","DOI":"10.24963\/ijcai.2020\/234"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1017\/S1471068418000583","volume":"19","author":"Y Dimopoulos","year":"2018","unstructured":"Dimopoulos, Y., Gebser, M., L\u00fchne, P., Romero, J., Schaub, T.: plasp 3: towards effective ASP planning. Theory Pract. Logic Program. 19(3), 477\u2013504 (2018)","journal-title":"Theory Pract. Logic Program."},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S1571-0661(05)82542-3","volume":"89","author":"N E\u00e9n","year":"2003","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Temporal induction by incremental SAT solving. Electron. Notes Theor. Comput. Sci. 89(4), 543\u2013560 (2003)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"5","key":"2_CR8","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1017\/S1471068421000259","volume":"21","author":"J Fandinno","year":"2021","unstructured":"Fandinno, J., Laferriere, F., Romero, J., Schaub, T., Son, T.: Planning with incomplete information in quantified answer set programming. Theory Pract. Logic Program. 21(5), 663\u2013679 (2021). https:\/\/doi.org\/10.1017\/S1471068421000259","journal-title":"Theory Pract. Logic Program."},{"key":"2_CR9","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., L\u00fchne, P., Romero, J., Schaub, T.: Answer set solving with generalized learned constraints. In: Carro, M., King, A. (eds.) Technical Communications of the Thirty-Second International Conference on Logic Programming (ICLP 2016). OpenAccess Series in Informatics (OASIcs), vol. 52, pp. 9:1\u20139:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool Publishers, San Rafael (2012)","DOI":"10.1007\/978-3-031-01561-8"},{"key":"2_CR11","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Veloso, M. (ed.) Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 386\u2013392. AAAI\/MIT Press (2007)"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proceedings of the Fifth International Conference and Symposium of Logic Programming (ICLP 1988), pp. 1070\u20131080. MIT Press (1988). https:\/\/doi.org\/10.1201\/b10397-6","DOI":"10.1201\/b10397-6"},{"key":"2_CR13","unstructured":"Gelfond, M., Lifschitz, V.: Action languages. Electron. Transac. Artif. Intell. 3(6), 193\u2013210 (1998). http:\/\/www.ep.liu.se\/ej\/etai\/1998\/007\/"},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1017\/S1471068416000569","volume":"17","author":"C Lef\u00e8vre","year":"2017","unstructured":"Lef\u00e8vre, C., B\u00e9atrix, C., St\u00e9phan, I., Garcia, L.: ASPeRiX, a first-order forward chaining approach for answer set computing. Theory Pract. Logic Program. 17(3), 266\u2013310 (2017)","journal-title":"Theory Pract. Logic Program."},{"issue":"3","key":"2_CR15","first-page":"297","volume":"96","author":"AD Pal\u00f9","year":"2009","unstructured":"Pal\u00f9, A.D., Dovier, A., Pontelli, E., Rossi, G.: GASP: answer set programming with lazy grounding. Fund. Inform. 96(3), 297\u2013322 (2009)","journal-title":"Fund. Inform."},{"issue":"12\u201313","key":"2_CR16","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.artint.2006.08.002","volume":"170","author":"J Rintanen","year":"2006","unstructured":"Rintanen, J., Heljanko, K., Niemel\u00e4, I.: Planning as satisfiability: parallel plans and algorithms for plan search. Artif. Intell. 170(12\u201313), 1031\u20131080 (2006)","journal-title":"Artif. Intell."},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Weinzierl, A., Taupe, R., Friedrich, G.: Advancing lazy-grounding ASP solving techniques \u2013 restarts, phase saving, heuristics, and more. Theory Pract. Logic Program. 20(5), 609\u2013624 (2020). http:\/\/arxiv.org\/abs\/2008.03526","DOI":"10.1017\/S1471068420000332"}],"container-title":["Lecture Notes in Computer Science","Rules and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21541-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,13]],"date-time":"2022-12-13T06:02:58Z","timestamp":1670911378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21541-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031215407","9783031215414"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21541-4_2","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":"14 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RuleML+RR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Rules and Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rulemlrr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dblp.org\/db\/conf\/rulemlrr\/index.html","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.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","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":"18","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":"0","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":"33% - 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.2","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":"2.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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}