{"id":"https://openalex.org/W6965151009","doi":"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_36","title":"Mathematical Programming Modulo Strings","display_name":"Mathematical Programming Modulo Strings","publication_year":2021,"publication_date":"2021-10-01","ids":{"openalex":"https://openalex.org/W6965151009","doi":"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_36"},"language":"en","primary_location":{"id":"doi:10.34727/2021/isbn.978-3-85448-046-4_36","is_oa":true,"landing_page_url":"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_36","pdf_url":null,"source":{"id":"https://openalex.org/S4306400493","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_36","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Kumar, Ankit","orcid":"https://orcid.org/0000-0001-9587-2861"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kumar, Ankit","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Manolios, Panagiotis","orcid":"https://orcid.org/0000-0003-0519-9699"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Manolios, Panagiotis","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.7009999752044678},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6800000071525574},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5289000272750854},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5202000141143799},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4586000144481659},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4242999851703644},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.423799991607666},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4156999886035919},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.3598000109195709}],"concepts":[{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7009999752044678},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6800000071525574},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5289000272750854},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5202000141143799},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5097000002861023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.486299991607666},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4586000144481659},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4429999887943268},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4242999851703644},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.423799991607666},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4156999886035919},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.38429999351501465},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3598000109195709},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.353300005197525},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.3531000018119812},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3458999991416931},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.34369999170303345},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33739998936653137},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.3179999887943268},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.30809998512268066},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.295199990272522},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.27880001068115234},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.27469998598098755}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.34727/2021/isbn.978-3-85448-046-4_36","is_oa":true,"landing_page_url":"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_36","pdf_url":null,"source":{"id":"https://openalex.org/S4306400493","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.34727/2021/isbn.978-3-85448-046-4_36","is_oa":true,"landing_page_url":"https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_36","pdf_url":null,"source":{"id":"https://openalex.org/S4306400493","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,68,97],"introduce":[1],"TranSeq,":[2],"a":[3,71,80,107],"non-deterministic,":[4],"branching":[5],"transition":[6],"system":[7],"for":[8],"deciding":[9],"the":[10,22,43],"satisfiability":[11],"of":[12,14,21,109],"conjunctions":[13],"string":[15,49],"equations.":[16],"TranSeq":[17],"is":[18,32,119],"an":[19],"extension":[20],"Mathematical":[23],"Programming":[24],"Modulo":[25],"Theories":[26],"(MPMT)":[27],"constraint":[28],"solving":[29],"framework":[30],"and":[31,37,51,58,95,112,122],"designed":[33],"to":[34],"enable":[35],"useful":[36],"computationally":[38],"efficient":[39],"inferences":[40],"that":[41,46,59,117],"reduce":[42],"search":[44],"space,":[45],"encode":[47],"certain":[48],"constraints":[50,57],"theory":[52],"lemmas":[53],"as":[54,79],"integer":[55],"linear":[56],"otherwise":[60],"split":[61],"problems":[62,111],"into":[63],"simpler":[64],"cases,":[65],"via":[66],"branching.":[67],"have":[69,85],"implemented":[70],"prototype,":[72],"SeqSolve,":[73],"in":[74,89],"ACL2s,":[75],"which":[76],"uses":[77],"Z3":[78],"back-end":[81],"solver.":[82],"String":[83],"solvers":[84],"numerous":[86],"applications,":[87],"including":[88],"security,":[90],"software":[91],"engineering,":[92],"programming":[93],"languages":[94],"verification.":[96],"evaluated":[98],"SeqSolve":[99,118],"by":[100],"comparing":[101],"it":[102],"with":[103],"existing":[104],"tools":[105],"on":[106],"set":[108],"benchmark":[110],"our":[113],"experimental":[114],"results":[115],"show":[116],"both":[120],"practical":[121],"efficient.":[123]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}