{"id":"https://openalex.org/W2224581992","doi":"https://doi.org/10.1007/978-3-319-22264-6_19","title":"A Solving Procedure for Stochastic Satisfiability Modulo Theories with Continuous Domain","display_name":"A Solving Procedure for Stochastic Satisfiability Modulo Theories with Continuous Domain","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2224581992","doi":"https://doi.org/10.1007/978-3-319-22264-6_19","mag":"2224581992"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-22264-6_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-22264-6_19","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011313354","display_name":"Yang Gao","orcid":"https://orcid.org/0000-0002-6449-6696"},"institutions":[{"id":"https://openalex.org/I129877168","display_name":"Carl von Ossietzky Universit\u00e4t Oldenburg","ror":"https://ror.org/033n9gh91","country_code":"DE","type":"education","lineage":["https://openalex.org/I129877168"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Yang Gao","raw_affiliation_strings":["Department of Computing Science, Carl von Ossietzky Universit\u00e4t Oldenburg, Oldenburg, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Carl von Ossietzky Universit\u00e4t Oldenburg, Oldenburg, Germany","institution_ids":["https://openalex.org/I129877168"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089746112","display_name":"Martin Fr\u00e4nzle","orcid":"https://orcid.org/0000-0002-9138-8340"},"institutions":[{"id":"https://openalex.org/I129877168","display_name":"Carl von Ossietzky Universit\u00e4t Oldenburg","ror":"https://ror.org/033n9gh91","country_code":"DE","type":"education","lineage":["https://openalex.org/I129877168"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Fr\u00e4nzle","raw_affiliation_strings":["Department of Computing Science, Carl von Ossietzky Universit\u00e4t Oldenburg, Oldenburg, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Carl von Ossietzky Universit\u00e4t Oldenburg, Oldenburg, Germany","institution_ids":["https://openalex.org/I129877168"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011313354"],"corresponding_institution_ids":["https://openalex.org/I129877168"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.851,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.85046522,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"295","last_page":"311"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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.9983999729156494,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9958000183105469,"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/reachability","display_name":"Reachability","score":0.8534976243972778},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.7669592499732971},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6972740292549133},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6553207039833069},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.6518989205360413},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.650675356388092},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.593428909778595},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4931044280529022},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4881606698036194},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4876827001571655},{"id":"https://openalex.org/keywords/hybrid-system","display_name":"Hybrid system","score":0.4575239419937134},{"id":"https://openalex.org/keywords/stochastic-game","display_name":"Stochastic game","score":0.4454357922077179},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4418324828147888},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41556715965270996},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3050401210784912},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.2894260287284851},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28706175088882446},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2685461640357971},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.12043046951293945}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8534976243972778},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7669592499732971},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6972740292549133},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6553207039833069},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.6518989205360413},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.650675356388092},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.593428909778595},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4931044280529022},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4881606698036194},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4876827001571655},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.4575239419937134},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.4454357922077179},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4418324828147888},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41556715965270996},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3050401210784912},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.2894260287284851},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28706175088882446},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2685461640357971},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.12043046951293945},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"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":1,"locations":[{"id":"doi:10.1007/978-3-319-22264-6_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-22264-6_19","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7300000190734863,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W47957325","https://openalex.org/W91128990","https://openalex.org/W1489146285","https://openalex.org/W1495732641","https://openalex.org/W1511506132","https://openalex.org/W1580809199","https://openalex.org/W1598511880","https://openalex.org/W1609596465","https://openalex.org/W1915967525","https://openalex.org/W1969710845","https://openalex.org/W1989783852","https://openalex.org/W2019851160","https://openalex.org/W2021229104","https://openalex.org/W2022846948","https://openalex.org/W2060924166","https://openalex.org/W2073787328","https://openalex.org/W2080813827","https://openalex.org/W2084965339","https://openalex.org/W2126053898","https://openalex.org/W2161302718","https://openalex.org/W2163850966"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W2578463151","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W1945774704","https://openalex.org/W1505872263","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}