{"id":"https://openalex.org/W2909742694","doi":"https://doi.org/10.1007/978-3-030-17127-8_16","title":"Optimal Satisfiability Checking for Arithmetic $$\\mu $$-Calculi","display_name":"Optimal Satisfiability Checking for Arithmetic $$\\mu $$-Calculi","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2909742694","doi":"https://doi.org/10.1007/978-3-030-17127-8_16","mag":"2909742694"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-17127-8_16","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-17127-8_16","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-17127-8_16.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-17127-8_16.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068252968","display_name":"Daniel Hausmann","orcid":"https://orcid.org/0000-0002-0935-8602"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Daniel Hausmann","raw_affiliation_strings":["Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany","[Friedrich\u2013Alexander Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany]"],"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"[Friedrich\u2013Alexander Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany]","institution_ids":["https://openalex.org/I181369854"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073765060","display_name":"Lutz Schr\u00f6der","orcid":"https://orcid.org/0000-0002-3146-5906"},"institutions":[{"id":"https://openalex.org/I181369854","display_name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","ror":"https://ror.org/00f7hpc57","country_code":"DE","type":"education","lineage":["https://openalex.org/I181369854"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Lutz Schr\u00f6der","raw_affiliation_strings":["Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany","[Friedrich\u2013Alexander Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany]"],"affiliations":[{"raw_affiliation_string":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany","institution_ids":["https://openalex.org/I181369854"]},{"raw_affiliation_string":"[Friedrich\u2013Alexander Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany]","institution_ids":["https://openalex.org/I181369854"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068252968"],"corresponding_institution_ids":["https://openalex.org/I181369854"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02644127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"277","last_page":"294"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.8838141560554504},{"id":"https://openalex.org/keywords/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.7914627194404602},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5927614569664001},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5895647406578064},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5588708519935608},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4823872148990631},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4759485423564911},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.46479126811027527},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.4396223723888397},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.3392688035964966},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32295042276382446},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2733466625213623},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.20485669374465942}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.8838141560554504},{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.7914627194404602},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5927614569664001},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5895647406578064},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5588708519935608},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4823872148990631},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4759485423564911},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.46479126811027527},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4396223723888397},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.3392688035964966},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32295042276382446},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2733466625213623},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.20485669374465942},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-030-17127-8_16","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-17127-8_16","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-17127-8_16.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:arXiv.org:1901.04893","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1901.04893","pdf_url":"https://arxiv.org/pdf/1901.04893","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2909742694","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1901.04893","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"doi:10.1007/978-3-030-17127-8_16","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-17127-8_16","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-17127-8_16.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2909742694.pdf","grobid_xml":"https://content.openalex.org/works/W2909742694.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W187636597","https://openalex.org/W193053345","https://openalex.org/W1497670448","https://openalex.org/W1501952738","https://openalex.org/W1507873625","https://openalex.org/W1532044601","https://openalex.org/W1554477044","https://openalex.org/W1557881307","https://openalex.org/W1570729432","https://openalex.org/W1590721921","https://openalex.org/W1721572253","https://openalex.org/W1795139737","https://openalex.org/W1932846340","https://openalex.org/W1982431152","https://openalex.org/W2015640848","https://openalex.org/W2028860036","https://openalex.org/W2031592188","https://openalex.org/W2048905609","https://openalex.org/W2049154590","https://openalex.org/W2050530663","https://openalex.org/W2077974960","https://openalex.org/W2088189323","https://openalex.org/W2142018979","https://openalex.org/W2170319925","https://openalex.org/W2172114884","https://openalex.org/W2176114185","https://openalex.org/W2207337225","https://openalex.org/W2241580932","https://openalex.org/W2250074872","https://openalex.org/W2467982476","https://openalex.org/W2502103274","https://openalex.org/W2585141290","https://openalex.org/W2804589645","https://openalex.org/W2952908521","https://openalex.org/W2963537255","https://openalex.org/W3125989314","https://openalex.org/W3189472968"],"related_works":["https://openalex.org/W1525390211","https://openalex.org/W3102693153","https://openalex.org/W1983967297","https://openalex.org/W2027602125","https://openalex.org/W1523929643","https://openalex.org/W1525959920","https://openalex.org/W3099252540","https://openalex.org/W2989517397","https://openalex.org/W1517830222","https://openalex.org/W1556844982","https://openalex.org/W1859659230","https://openalex.org/W110461417","https://openalex.org/W2165775376","https://openalex.org/W3165398732","https://openalex.org/W2799335769","https://openalex.org/W2156117182","https://openalex.org/W2765197941","https://openalex.org/W143215475","https://openalex.org/W3162476872","https://openalex.org/W1767868015"],"abstract_inverted_index":{"Abstract":[0],"The":[1,130],"coalgebraic":[2,31],"$$\\mu":[3,32,78,161,180],"$$":[4,33,79,162,181],"-calculus":[5,34,163,182],"provides":[6],"a":[7,47,135],"generic":[8,136],"semantic":[9],"framework":[10],"for":[11,53,114,152],"fixpoint":[12],"logics":[13],"with":[14,86,164,183],"branching":[15],"types":[16],"beyond":[17],"the":[18,30,54,76,90,95,106,109,115,123,128,159,177],"standard":[19],"relational":[20],"setup,":[21],"e.g.":[22],"probabilistic,":[23],"weighted,":[24],"or":[25,81],"game-based.":[26],"Previous":[27],"work":[28],"on":[29,41],"includes":[35],"an":[36,156,174],"exponential":[37],"time":[38],"upper":[39,97,150],"bound":[40,99,131],"satisfiability":[42,112,143,153],"checking,":[43],"which":[44],"however":[45],"requires":[46],"well-behaved":[48],"set":[49],"of":[50,65,108,127,158,176],"tableau":[51],"rules":[52,58],"next-step":[55,125],"modalities.":[56],"Such":[57],"are":[59],"not":[60],"available":[61],"in":[62,67,75,84,155],"all":[63],"cases":[64],"interest,":[66],"particular":[68],"ones":[69],"involving":[70],"either":[71],"integer":[72],"weights":[73,83],"as":[74,122,171,173],"graded":[77,160],"-calculus,":[80],"real-valued":[82],"combination":[85],"non-linear":[87],"arithmetic.":[88],"In":[89],"present":[91],"work,":[92],"we":[93],"prove":[94],"same":[96],"complexity":[98,107],"under":[100],"more":[101],"general":[102],"assumptions,":[103],"specifically":[104],"regarding":[105],"(much":[110],"simpler)":[111],"problem":[113],"underlying":[116],"one-step":[117],"logic":[118],",":[119],"roughly":[120],"described":[121],"nesting-free":[124],"fragment":[126],"logic.":[129],"is":[132],"realized":[133],"by":[134],"global":[137],"caching":[138],"algorithm":[139],"that":[140],"supports":[141],"on-the-fly":[142],"checking.":[144],"Example":[145],"applications":[146],"include":[147],"new":[148],"exponential-time":[149],"bounds":[151],"checking":[154],"extension":[157,175],"polynomial":[165,184],"inequalities":[166],"(including":[167],"positive":[168],"Presburger":[169],"arithmetic),":[170],"well":[172],"(two-valued)":[178],"probabilistic":[179],"inequalities.":[185]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}