{"id":"https://openalex.org/W2053864268","doi":"https://doi.org/10.1109/coginf.2011.6016168","title":"Satisfiability degree computation for linear temporal logic","display_name":"Satisfiability degree computation for linear temporal logic","publication_year":2011,"publication_date":"2011-08-01","ids":{"openalex":"https://openalex.org/W2053864268","doi":"https://doi.org/10.1109/coginf.2011.6016168","mag":"2053864268"},"language":"en","primary_location":{"id":"doi:10.1109/coginf.2011.6016168","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coginf.2011.6016168","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE 10th International Conference on Cognitive Informatics and Cognitive Computing (ICCI-CC'11)","raw_type":"proceedings-article"},"type":"article","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/A5102950976","display_name":"Jian Luo","orcid":"https://orcid.org/0000-0002-8197-4020"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jian Luo","raw_affiliation_strings":["School of Software, Tsinghua University, Tsinghua National Laboratory for Information Science and Technology, Beijing 100084, China"],"affiliations":[{"raw_affiliation_string":"School of Software, Tsinghua University, Tsinghua National Laboratory for Information Science and Technology, Beijing 100084, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100731621","display_name":"Guiming Luo","orcid":"https://orcid.org/0000-0001-7665-0526"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guiming Luo","raw_affiliation_strings":["School of Software, Tsinghua University, Tsinghua National Laboratory for Information Science and Technology, Beijing 100084, China"],"affiliations":[{"raw_affiliation_string":"School of Software, Tsinghua University, Tsinghua National Laboratory for Information Science and Technology, Beijing 100084, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101971480","display_name":"Yang Zhao","orcid":"https://orcid.org/0000-0002-0313-3680"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yang Zhao","raw_affiliation_strings":["School of Software, Tsinghua University, Tsinghua National Laboratory for Information Science and Technology, Beijing 100084, China"],"affiliations":[{"raw_affiliation_string":"School of Software, Tsinghua University, Tsinghua National Laboratory for Information Science and Technology, Beijing 100084, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102950976"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.10102123,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"373","last_page":"380"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9993000030517578,"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.9993000030517578,"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.9969000220298767,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7425109148025513},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.6667854189872742},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5763463973999023},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5626585483551025},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.5515317320823669},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.521561324596405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5193954110145569},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4964752793312073},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48840969800949097},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46611860394477844},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.45767471194267273},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4427383840084076},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4124522805213928}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7425109148025513},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.6667854189872742},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5763463973999023},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5626585483551025},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.5515317320823669},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.521561324596405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5193954110145569},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4964752793312073},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48840969800949097},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46611860394477844},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.45767471194267273},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4427383840084076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4124522805213928},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coginf.2011.6016168","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coginf.2011.6016168","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE 10th International Conference on Cognitive Informatics and Cognitive Computing (ICCI-CC'11)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1498432697","https://openalex.org/W1510086190","https://openalex.org/W1819209966","https://openalex.org/W2037618078","https://openalex.org/W2047217912","https://openalex.org/W2102980637","https://openalex.org/W2116907478","https://openalex.org/W2136708886","https://openalex.org/W2146659604","https://openalex.org/W2167978186","https://openalex.org/W2170770935","https://openalex.org/W6677472665"],"related_works":["https://openalex.org/W1532447905","https://openalex.org/W858755136","https://openalex.org/W1981889059","https://openalex.org/W3005864166","https://openalex.org/W2143025323","https://openalex.org/W31328628","https://openalex.org/W3163822336","https://openalex.org/W3091862538","https://openalex.org/W1969550103","https://openalex.org/W4312622265"],"abstract_inverted_index":{"Temporal":[0],"logic":[1,28,56,66,87,124],"is":[2,29,35,67,88,107,126,130,154],"used":[3,36,101,155],"to":[4,37,40,102,156],"describe":[5],"any":[6],"system":[7],"of":[8,21,53,61,84,160],"rules":[9],"and":[10,14,48,116,143],"symbolism":[11],"for":[12,26,64,80],"representing,":[13],"reasoning":[15],"about,":[16],"propositions":[17],"qualified":[18],"in":[19,31],"terms":[20],"time.":[22],"The":[23,152],"satisfiability":[24,62,82,118],"degree":[25,63,83,119],"temporal":[27,65,86,123],"introduced":[30],"this":[32],"paper.":[33],"It":[34,129],"precisely":[38],"express":[39],"what":[41],"extent":[42],"a":[43,46,50,122,139],"model":[44],"satisfies":[45],"property":[47,115],"provides":[49],"quantitative":[51],"analysis":[52],"the":[54,59,71,81,85,91,96,105,113,117,133,158,161],"formal":[55],"model.":[57],"Then":[58],"computation":[60],"concerned.":[68],"Based":[69],"on":[70],"discrete-time":[72],"Markov":[73],"chains,":[74],"an":[75],"intelligent":[76,92,134,162],"path":[77,93,135,163],"selection":[78,94,136,164],"algorithm":[79,95,137],"proposed.":[89],"In":[90],"mother":[97],"states,":[98],"which":[99],"are":[100],"form":[103],"all":[104],"paths,":[106],"calculated":[108],"firstly.":[109],"Those":[110],"paths":[111],"satisfy":[112],"concerned":[114],"expressed":[120],"by":[121],"formula":[125],"then":[127],"computed.":[128],"shown":[131],"that":[132],"has":[138],"polynomial":[140],"time":[141],"complexity":[142],"O(n2)":[144],"space":[145],"complexity.":[146],"A":[147],"popular":[148],"puzzle":[149],"known":[150],"as":[151],"Ferryman":[153],"illustrate":[157],"feasibility":[159],"algorithm.":[165]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}