{"id":"https://openalex.org/W7168554196","doi":"https://doi.org/10.24963/kr.2026/66","title":"Optimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis","display_name":"Optimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis","publication_year":2026,"publication_date":"2026-07-01","ids":{"openalex":"https://openalex.org/W7168554196","doi":"https://doi.org/10.24963/kr.2026/66"},"language":null,"primary_location":{"id":"doi:10.24963/kr.2026/66","is_oa":true,"landing_page_url":"https://doi.org/10.24963/kr.2026/66","pdf_url":"https://proceedings.kr.org/2026/66/kr2026-0066-banbara-et-al.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the TwentyThird International Conference on Principles of Knowledge Representation and Reasoning","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://proceedings.kr.org/2026/66/kr2026-0066-banbara-et-al.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038979849","display_name":"Mutsunori Banbara","orcid":"https://orcid.org/0000-0002-5388-727X"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Mutsunori Banbara","raw_affiliation_strings":["Nagoya University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nagoya University","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011046118","display_name":"Hideo Bannai","orcid":"https://orcid.org/0000-0002-6856-5185"},"institutions":[{"id":"https://openalex.org/I4400009020","display_name":"Institute of Science Tokyo","ror":"https://ror.org/05dqf9946","country_code":null,"type":"education","lineage":["https://openalex.org/I4400009020"]}],"countries":[],"is_corresponding":false,"raw_author_name":"Hideo Bannai","raw_affiliation_strings":["Institute of Science Tokyo"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Science Tokyo","institution_ids":["https://openalex.org/I4400009020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048619635","display_name":"Takashi Horiyama","orcid":"https://orcid.org/0000-0001-9451-259X"},"institutions":[{"id":"https://openalex.org/I205349734","display_name":"Hokkaido University","ror":"https://ror.org/02e16g702","country_code":"JP","type":"education","lineage":["https://openalex.org/I205349734"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takashi Horiyama","raw_affiliation_strings":["Hokkaido University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hokkaido University","institution_ids":["https://openalex.org/I205349734"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5141002446","display_name":"Dominik K\u00f6ppl","orcid":null},"institutions":[{"id":"https://openalex.org/I66906201","display_name":"University of Yamanashi","ror":"https://ror.org/059x21724","country_code":"JP","type":"education","lineage":["https://openalex.org/I66906201"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Dominik K\u00f6ppl","raw_affiliation_strings":["University of Yamanashi"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Yamanashi","institution_ids":["https://openalex.org/I66906201"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5141035968","display_name":"Takuya Mieno","orcid":null},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takuya Mieno","raw_affiliation_strings":["The University of Electro-Communications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Electro-Communications","institution_ids":["https://openalex.org/I20529979"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091014036","display_name":"Hidetomo Nabeshima","orcid":"https://orcid.org/0000-0003-3752-2518"},"institutions":[{"id":"https://openalex.org/I66906201","display_name":"University of Yamanashi","ror":"https://ror.org/059x21724","country_code":"JP","type":"education","lineage":["https://openalex.org/I66906201"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hidetomo Nabeshima","raw_affiliation_strings":["University of Yamanashi"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Yamanashi","institution_ids":["https://openalex.org/I66906201"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"700","last_page":"710"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.8712000250816345},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.714900016784668},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6694999933242798},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5152000188827515},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.49459999799728394},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.41449999809265137},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.41179999709129333},{"id":"https://openalex.org/keywords/macro","display_name":"Macro","score":0.3822999894618988}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.8712000250816345},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.714900016784668},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6757000088691711},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6694999933242798},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6013000011444092},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5152000188827515},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.49459999799728394},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.41449999809265137},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.41179999709129333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3855000138282776},{"id":"https://openalex.org/C166955791","wikidata":"https://www.wikidata.org/wiki/Q629579","display_name":"Macro","level":2,"score":0.3822999894618988},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3822000026702881},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.3723999857902527},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3714999854564667},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3100000023841858},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.29420000314712524},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C2778220771","wikidata":"https://www.wikidata.org/wiki/Q1522579","display_name":"Substitution (logic)","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26330000162124634},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2538999915122986},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/kr.2026/66","is_oa":true,"landing_page_url":"https://doi.org/10.24963/kr.2026/66","pdf_url":"https://proceedings.kr.org/2026/66/kr2026-0066-banbara-et-al.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the TwentyThird International Conference on Principles of Knowledge Representation and Reasoning","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/kr.2026/66","is_oa":true,"landing_page_url":"https://doi.org/10.24963/kr.2026/66","pdf_url":"https://proceedings.kr.org/2026/66/kr2026-0066-banbara-et-al.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the TwentyThird International Conference on Principles of Knowledge Representation and Reasoning","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3429881471","display_name":null,"funder_award_id":"JP20H05964","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G4225369301","display_name":"\u8f9e\u66f8\u5f0f\u5727\u7e2e\u3068\u5727\u7e2e\u60c5\u5831\u51e6\u7406\u306e\u6df1\u5316","funder_award_id":"24K02899","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G577723003","display_name":"Integrated Techniques and Applications of Enumeration, Optimization, and SAT-Solving Based on Discrete Structure Manipulation","funder_award_id":"25H01114","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G8390964879","display_name":"Algorithm-Engineered Compressed Indexes","funder_award_id":"25K21150","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7168554196.pdf","grobid_xml":"https://content.openalex.org/works/W7168554196.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,70],"develop":[1],"an":[2,40],"Answer":[3],"Set":[4],"Programming":[5],"(ASP)-based":[6],"approach":[7,25,101],"for":[8],"computing":[9],"the":[10,34,83,97],"smallest":[11,84],"bidirectional":[12],"macro":[13],"schemes":[14],"(BMSs),":[15],"a":[16,107],"fundamental":[17],"NP-hard":[18,90],"optimization":[19],"problem":[20],"in":[21],"dictionary-based":[22],"compression.":[23],"Our":[24],"relies":[26],"on":[27],"high-level":[28],"ASP":[29,42,54,60,75],"encodings":[30,66],"and":[31,36,49,51,63],"delegates":[32],"both":[33],"grounding":[35],"solving":[37],"tasks":[38],"to":[39,56,81],"off-the-shelf":[41],"solver.":[43],"The":[44],"proposed":[45],"encoding":[46,76],"is":[47],"compact":[48],"extensible,":[50],"leverages":[52],"advanced":[53],"techniques":[55],"improve":[57],"scalability,":[58],"including":[59],"modulo":[61],"acyclicity":[62,68],"refined":[64],"declarative":[65],"of":[67,92,99],"constraints.":[69],"further":[71],"show":[72],"that":[73],"our":[74,100],"can":[77],"be":[78],"naturally":[79],"extended":[80],"compute":[82],"straight-line":[85],"programs":[86],"(SLPs),":[87],"another":[88],"important":[89],"measure":[91],"repetitiveness.":[93],"Furthermore,":[94],"we":[95],"establish":[96],"competitiveness":[98],"by":[102],"empirically":[103],"contrasting":[104],"it":[105],"with":[106],"more":[108],"dedicated":[109],"MaxSAT-based":[110],"approach.":[111]},"counts_by_year":[],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2026-07-17T00:00:00"}