{"id":"https://openalex.org/W2807161818","doi":"https://doi.org/10.23919/fmcad.2018.8603016","title":"Learning Linear Temporal Properties","display_name":"Learning Linear Temporal Properties","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2807161818","doi":"https://doi.org/10.23919/fmcad.2018.8603016","mag":"2807161818"},"language":"en","primary_location":{"id":"doi:10.23919/fmcad.2018.8603016","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2018.8603016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Formal Methods in Computer Aided Design (FMCAD)","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/A5064701353","display_name":"Daniel Neider","orcid":"https://orcid.org/0000-0001-9276-6342"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Neider","raw_affiliation_strings":["Max Planck Institute for Software Systems, Kaiserslautern, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011081023","display_name":"Ivan Gavran","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ivan Gavran","raw_affiliation_strings":["Max Planck Institute for Software Systems, Kaiserslautern, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I4210121786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210121786"],"apc_list":null,"apc_paid":null,"fwci":9.6493,"has_fulltext":false,"cited_by_count":105,"citation_normalized_percentile":{"value":0.98461654,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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.9995999932289124,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9986000061035156,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9959999918937683,"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/computer-science","display_name":"Computer science","score":0.6808276176452637},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.6683481931686401},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6226296424865723},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5890922546386719},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5331164002418518},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.522924542427063},{"id":"https://openalex.org/keywords/multi-task-learning","display_name":"Multi-task learning","score":0.46656739711761475},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4662700295448303},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.4572235941886902},{"id":"https://openalex.org/keywords/decision-tree","display_name":"Decision tree","score":0.44539549946784973},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3893560767173767},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3742011785507202}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6808276176452637},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.6683481931686401},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6226296424865723},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5890922546386719},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5331164002418518},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.522924542427063},{"id":"https://openalex.org/C28006648","wikidata":"https://www.wikidata.org/wiki/Q6934509","display_name":"Multi-task learning","level":3,"score":0.46656739711761475},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4662700295448303},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.4572235941886902},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.44539549946784973},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3893560767173767},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3742011785507202},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/fmcad.2018.8603016","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2018.8603016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Formal Methods in Computer Aided Design (FMCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.8100000023841858,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W21416174","https://openalex.org/W1480909796","https://openalex.org/W1504694836","https://openalex.org/W1547304883","https://openalex.org/W1583869287","https://openalex.org/W1590315663","https://openalex.org/W1796872423","https://openalex.org/W1861590051","https://openalex.org/W1908450151","https://openalex.org/W1984936841","https://openalex.org/W1989445634","https://openalex.org/W2019363670","https://openalex.org/W2023808162","https://openalex.org/W2041701185","https://openalex.org/W2086092403","https://openalex.org/W2098171268","https://openalex.org/W2103976262","https://openalex.org/W2109213558","https://openalex.org/W2109525524","https://openalex.org/W2110852599","https://openalex.org/W2116861015","https://openalex.org/W2125055259","https://openalex.org/W2132912000","https://openalex.org/W2138856440","https://openalex.org/W2158391928","https://openalex.org/W2242407529","https://openalex.org/W2339807279","https://openalex.org/W2474788619","https://openalex.org/W2535981059","https://openalex.org/W2582355205","https://openalex.org/W2604459184","https://openalex.org/W2777404089","https://openalex.org/W2783370231","https://openalex.org/W2807161818","https://openalex.org/W2898333178","https://openalex.org/W2898709589","https://openalex.org/W2951908009","https://openalex.org/W2963468010","https://openalex.org/W3007267899","https://openalex.org/W3213228770","https://openalex.org/W4206807714","https://openalex.org/W4238893454","https://openalex.org/W4254906220","https://openalex.org/W6600857139","https://openalex.org/W6632722279","https://openalex.org/W6638231040","https://openalex.org/W6639142308","https://openalex.org/W6639893731","https://openalex.org/W6646609382","https://openalex.org/W6674423876","https://openalex.org/W6679835878","https://openalex.org/W6736103066","https://openalex.org/W6747267658","https://openalex.org/W6766209208"],"related_works":["https://openalex.org/W4312622265","https://openalex.org/W2013878945","https://openalex.org/W1546948343","https://openalex.org/W2180648729","https://openalex.org/W2104974242","https://openalex.org/W2028860036","https://openalex.org/W2396641696","https://openalex.org/W188509945","https://openalex.org/W2166338730","https://openalex.org/W2245396499"],"abstract_inverted_index":{"We":[0,99],"present":[1],"two":[2],"novel":[3],"algorithms":[4,68,103],"for":[5,69],"learning":[6,17,21,55,64,70,77,102],"formulas":[7],"in":[8,29],"Linear":[9],"Temporal":[10],"Logic":[11],"(LTL)":[12],"from":[13],"examples.":[14],"The":[15,73],"first":[16],"algorithm":[18,65,78],"reduces":[19],"the":[20,42,50,58,62,121],"task":[22,122],"to":[23,81,93],"a":[24,35,76,109,127],"series":[25],"of":[26,41,44,86,112,123,126],"satisfiability":[27],"problems":[28],"propositional":[30],"Boolean":[31],"logic":[32],"and":[33,104],"produces":[34],"smallest":[36],"LTL":[37,97],"formula":[38],"(in":[39],"terms":[40],"number":[43],"subformulas)":[45],"that":[46,79],"is":[47,75],"consistent":[48,96],"with":[49,66,84],"given":[51],"data.":[52],"Our":[53],"second":[54],"algorithm,":[56],"on":[57,108,120],"other":[59],"hand,":[60],"combines":[61],"SAT-based":[63],"classical":[67],"decision":[71],"trees.":[72],"result":[74],"scales":[80],"real-world":[82],"scenarios":[83],"hundreds":[85],"examples,":[87],"but":[88],"can":[89],"no":[90],"longer":[91],"guarantee":[92],"produce":[94],"minimal":[95],"formulas.":[98],"compare":[100],"both":[101],"demonstrate":[105],"their":[106,118],"performance":[107],"wide":[110],"range":[111],"synthetic":[113],"benchmarks.":[114],"Additionally,":[115],"we":[116],"illustrate":[117],"usefulness":[119],"understanding":[124],"executions":[125],"leader":[128],"election":[129],"protocol.":[130]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}