{"id":"https://openalex.org/W4385071282","doi":"https://doi.org/10.1017/s147106842300025x","title":"Logic-Based Benders Decomposition in Answer Set Programming for Chronic Outpatients Scheduling","display_name":"Logic-Based Benders Decomposition in Answer Set Programming for Chronic Outpatients Scheduling","publication_year":2023,"publication_date":"2023-07-01","ids":{"openalex":"https://openalex.org/W4385071282","doi":"https://doi.org/10.1017/s147106842300025x"},"language":"en","primary_location":{"id":"doi:10.1017/s147106842300025x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s147106842300025x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/EE79CF9B533ED16315CAFBF5A3E50A56/S147106842300025Xa.pdf/div-class-title-logic-based-benders-decomposition-in-answer-set-programming-for-chronic-outpatients-scheduling-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/EE79CF9B533ED16315CAFBF5A3E50A56/S147106842300025Xa.pdf/div-class-title-logic-based-benders-decomposition-in-answer-set-programming-for-chronic-outpatients-scheduling-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068486649","display_name":"Paola Cappanera","orcid":"https://orcid.org/0000-0003-3674-3896"},"institutions":[{"id":"https://openalex.org/I45084792","display_name":"University of Florence","ror":"https://ror.org/04jr1s763","country_code":"IT","type":"education","lineage":["https://openalex.org/I45084792"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"PAOLA CAPPANERA","raw_affiliation_strings":["DINFO, Universit\u00e0 degli Studi di Firenze, Italy (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DINFO, Universit\u00e0 degli Studi di Firenze, Italy (e-mail:","institution_ids":["https://openalex.org/I45084792"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088751356","display_name":"Marco Gavanelli","orcid":"https://orcid.org/0000-0001-7433-5899"},"institutions":[{"id":"https://openalex.org/I201324441","display_name":"University of Ferrara","ror":"https://ror.org/041zkgm14","country_code":"IT","type":"education","lineage":["https://openalex.org/I201324441"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"MARCO GAVANELLI","raw_affiliation_strings":["DE, Universit\u00e0 degli Studi di Ferrara, Italy (e-mails:"],"raw_orcid":"https://orcid.org/0000-0001-7433-5899","affiliations":[{"raw_affiliation_string":"DE, Universit\u00e0 degli Studi di Ferrara, Italy (e-mails:","institution_ids":["https://openalex.org/I201324441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019882165","display_name":"Maddalena Nonato","orcid":"https://orcid.org/0000-0001-8708-120X"},"institutions":[{"id":"https://openalex.org/I201324441","display_name":"University of Ferrara","ror":"https://ror.org/041zkgm14","country_code":"IT","type":"education","lineage":["https://openalex.org/I201324441"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"MADDALENA NONATO","raw_affiliation_strings":["DE, Universit\u00e0 degli Studi di Ferrara, Italy (e-mails:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DE, Universit\u00e0 degli Studi di Ferrara, Italy (e-mails:","institution_ids":["https://openalex.org/I201324441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102974997","display_name":"Marco Roma","orcid":"https://orcid.org/0000-0002-0925-212X"},"institutions":[{"id":"https://openalex.org/I45084792","display_name":"University of Florence","ror":"https://ror.org/04jr1s763","country_code":"IT","type":"education","lineage":["https://openalex.org/I45084792"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"MARCO ROMA","raw_affiliation_strings":["DINFO, Universit\u00e0 degli Studi di Firenze, Italy (e-mail:"],"raw_orcid":"https://orcid.org/0000-0002-0925-212X","affiliations":[{"raw_affiliation_string":"DINFO, Universit\u00e0 degli Studi di Firenze, Italy (e-mail:","institution_ids":["https://openalex.org/I45084792"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5068486649"],"corresponding_institution_ids":["https://openalex.org/I45084792"],"apc_list":null,"apc_paid":null,"fwci":1.5337,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86038533,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"23","issue":"4","first_page":"848","last_page":"864"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.7642369270324707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7074196934700012},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.6812568306922913},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5805466771125793},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5651108026504517},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4758065342903137},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4670516550540924},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4656646251678467},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.44495195150375366},{"id":"https://openalex.org/keywords/benders-decomposition","display_name":"Benders' decomposition","score":0.43938320875167847},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4360734224319458},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.43307018280029297},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.42653900384902954},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3439347743988037},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.3016466498374939},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2732733488082886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24279305338859558},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.15427270531654358},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.11316448450088501},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09664657711982727},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09214800596237183}],"concepts":[{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.7642369270324707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7074196934700012},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.6812568306922913},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5805466771125793},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5651108026504517},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4758065342903137},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4670516550540924},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4656646251678467},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44495195150375366},{"id":"https://openalex.org/C27665512","wikidata":"https://www.wikidata.org/wiki/Q3042795","display_name":"Benders' decomposition","level":2,"score":0.43938320875167847},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4360734224319458},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.43307018280029297},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.42653900384902954},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3439347743988037},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.3016466498374939},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2732733488082886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24279305338859558},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.15427270531654358},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.11316448450088501},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09664657711982727},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09214800596237183},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s147106842300025x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s147106842300025x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/EE79CF9B533ED16315CAFBF5A3E50A56/S147106842300025Xa.pdf/div-class-title-logic-based-benders-decomposition-in-answer-set-programming-for-chronic-outpatients-scheduling-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:iris.unife.it:11392/2519733","is_oa":true,"landing_page_url":"https://hdl.handle.net/11392/2519733","pdf_url":"https://sfera.unife.it/bitstream/11392/2519733/3/logic-based-benders-decomposition-in-answer-set-programming-for-chronic-outpatients-scheduling.pdf","source":{"id":"https://openalex.org/S4306400369","display_name":"Institutional Research Information System University of Ferrara (University of Ferrara)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I201324441","host_organization_name":"University of Ferrara","host_organization_lineage":["https://openalex.org/I201324441"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:arpi.unipi.it:11568/1204767","is_oa":false,"landing_page_url":"https://hdl.handle.net/11568/1204767","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:flore.unifi.it:2158/1344992","is_oa":true,"landing_page_url":"https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/article/logicbased-benders-decomposition-in-answer-set-programming-for-chronic-outpatients-scheduling/EE79CF9B533ED16315CAFBF5A3E50A56","pdf_url":null,"source":{"id":"https://openalex.org/S4306402033","display_name":"Florence Research (University of Florence)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45084792","host_organization_name":"University of Florence","host_organization_lineage":["https://openalex.org/I45084792"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1017/s147106842300025x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s147106842300025x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/EE79CF9B533ED16315CAFBF5A3E50A56/S147106842300025Xa.pdf/div-class-title-logic-based-benders-decomposition-in-answer-set-programming-for-chronic-outpatients-scheduling-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320311030","display_name":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","ror":"https://ror.org/01vx64p53"},{"id":"https://openalex.org/F4320334079","display_name":"Gruppo Nazionale per il Calcolo Scientifico","ror":null}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4385071282.pdf"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1508945008","https://openalex.org/W1566150287","https://openalex.org/W2017295921","https://openalex.org/W2439137874","https://openalex.org/W2542981480","https://openalex.org/W2623761406","https://openalex.org/W2728577422","https://openalex.org/W2806094366","https://openalex.org/W2808078614","https://openalex.org/W2809237174","https://openalex.org/W2900049970","https://openalex.org/W2926083238","https://openalex.org/W2944475406","https://openalex.org/W2963234253","https://openalex.org/W2971583140","https://openalex.org/W2985257580","https://openalex.org/W2994667977","https://openalex.org/W3111874214","https://openalex.org/W3180488600","https://openalex.org/W3203072813","https://openalex.org/W4205490898","https://openalex.org/W4206401899","https://openalex.org/W4214479678","https://openalex.org/W4283797444","https://openalex.org/W4285242384","https://openalex.org/W4313568626","https://openalex.org/W4365147121","https://openalex.org/W4385161693","https://openalex.org/W6637298476","https://openalex.org/W6680694123"],"related_works":["https://openalex.org/W1511336005","https://openalex.org/W1903938722","https://openalex.org/W1875972884","https://openalex.org/W34858115","https://openalex.org/W1575307414","https://openalex.org/W2460803124","https://openalex.org/W4231236017","https://openalex.org/W2076569795","https://openalex.org/W1596719193","https://openalex.org/W3088092049"],"abstract_inverted_index":{"Abstract":[0],"In":[1,149,189,242],"answer":[2],"set":[3],"programming":[4],"(ASP),":[5],"the":[6,36,52,55,70,84,95,100,103,107,117,121,134,142,146,161,178,183,198,205,208,224,227,248,266,269,274,281],"user":[7],"can":[8,139,186,278],"define":[9],"declaratively":[10],"a":[11,44,91,166,193,217],"problem":[12,72,97,162,168],"and":[13,25,89,170],"solve":[14],"it":[15,124],"with":[16,33,49,204],"efficient":[17],"solvers;":[18],"practical":[19,282],"applications":[20],"of":[21,54,102,130,136,177,191,207,268,276,284],"ASP":[22,285],"are":[23,77],"countless":[24],"several":[26,173],"constraint":[27],"problems":[28],"have":[29],"been":[30],"successfully":[31],"solved":[32,78,202],"ASP.":[34],"On":[35,106],"other":[37,122,150],"hand,":[38,109,123],"solution":[39,144,176,212,219,234],"time":[40,250],"usually":[41],"grows":[42],"in":[43,79,159,257],"superlinear":[45,118],"way":[46],"(often,":[47],"exponential)":[48],"respect":[50],"to":[51,68,83,116,133,182,197,252],"size":[53],"instance,":[56],"which":[57],"is":[58,67,112,163,180,195,201,214,220,229,235],"impractical":[59],"for":[60,94,222,247],"large":[61],"instances.":[62],"A":[63],"widely":[64],"used":[65],"approach":[66,111],"split":[69],"optimization":[71],"into":[73,165],"subproblems":[74],"(SPs)":[75],"that":[76,185,200,273],"sequence,":[80],"some":[81],"committing":[82,132],"values":[85],"assigned":[86],"by":[87,98],"others,":[88],"reconstructing":[90],"valid":[92,218],"assignment":[93,135],"whole":[96],"juxtaposing":[99],"solutions":[101],"single":[104],"SPs.":[105,174],"one":[108,137,171],"this":[110,243],"much":[113],"faster":[114],"due":[115],"behavior;":[119],"on":[120],"does":[125],"not":[126],"provide":[127],"any":[128],"guarantee":[129],"optimality:":[131],"SP":[138],"rule":[140],"out":[141],"optimal":[143,237],"from":[145],"search":[147],"space.":[148],"research":[151],"areas,":[152],"logic-Based":[153],"Benders":[154],"decomposition":[155],"(LBBD)":[156],"proved":[157],"effective;":[158],"LBBD,":[160],"decomposed":[164],"master":[167],"(MP)":[169],"or":[172,226],"The":[175,211,232],"MP":[179,199,228],"passed":[181],"SPs":[184,225],"possibly":[187],"fail.":[188],"case":[190,261],"failure,":[192],"no-good":[194],"returned":[196],"again":[203],"addition":[206],"new":[209],"constraint.":[210],"process":[213],"iterated":[215],"until":[216],"obtained":[221,233],"all":[223],"proven":[230],"infeasible.":[231],"provably":[236],"under":[238],"very":[239],"mild":[240],"conditions.":[241],"paper,":[244],"we":[245],"apply":[246],"first":[249],"LBBD":[251,277],"ASP,":[253],"exploiting":[254],"an":[255],"application":[256],"health":[258],"care":[259],"as":[260],"study.":[262],"Experimental":[263],"results":[264],"show":[265],"effectiveness":[267],"approach.":[270],"We":[271],"believe":[272],"availability":[275],"further":[279],"increase":[280],"applicability":[283],"technologies.":[286]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}