{"id":"https://openalex.org/W2964305133","doi":"https://doi.org/10.4230/lipics.mfcs.2017.77","title":"Making Metric Temporal Logic Rational","display_name":"Making Metric Temporal Logic Rational","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2964305133","doi":"https://doi.org/10.4230/lipics.mfcs.2017.77","mag":"2964305133"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:8111","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.77","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.77","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101833503","display_name":"Shankara Narayanan Krishna","orcid":"https://orcid.org/0000-0003-0925-398X"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Krishna, Shankara Narayanan","raw_affiliation_strings":["Indian Institute of Technology Bombay, Mumbai, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075264711","display_name":"Khushraj Madnani","orcid":"https://orcid.org/0000-0003-0629-3847"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Madnani, Khushraj","raw_affiliation_strings":["Indian Institute of Technology Bombay, Mumbai, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027806769","display_name":"Paritosh K. Pandya","orcid":"https://orcid.org/0000-0001-7085-0148"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Pandya, Paritosh K.","raw_affiliation_strings":["Tata Institute of Fundamental Research, Mumbai, India"],"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research, Mumbai, India","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101833503"],"corresponding_institution_ids":["https://openalex.org/I162827531"],"apc_list":null,"apc_paid":null,"fwci":0.5851,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.77675686,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"83","issue":null,"first_page":"14","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9976000189781189,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9976000189781189,"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.9975000023841858,"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/T11567","display_name":"semigroups and automata theory","score":0.9890999794006348,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8651553392410278},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.6658106446266174},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5665158033370972},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5544546842575073},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.506622850894928},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5061678290367126},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5015413761138916},{"id":"https://openalex.org/keywords/pointwise","display_name":"Pointwise","score":0.4905688166618347},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.483602911233902},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.45182815194129944},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.43952086567878723},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.42736172676086426},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3748309314250946},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2881722152233124},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20286253094673157},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1439571976661682}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8651553392410278},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.6658106446266174},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5665158033370972},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5544546842575073},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.506622850894928},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5061678290367126},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5015413761138916},{"id":"https://openalex.org/C2777984123","wikidata":"https://www.wikidata.org/wiki/Q9248237","display_name":"Pointwise","level":2,"score":0.4905688166618347},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.483602911233902},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.45182815194129944},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.43952086567878723},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.42736172676086426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3748309314250946},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2881722152233124},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20286253094673157},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1439571976661682},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:8111","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.77","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"mag:2964305133","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1705.01501","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":null,"is_accepted":false,"is_published":null,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.4230/lipics.mfcs.2017.77","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2017.77","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:8111","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.77","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1775249002","https://openalex.org/W45450336","https://openalex.org/W2887835352","https://openalex.org/W2906142081","https://openalex.org/W2971834608","https://openalex.org/W2734651385","https://openalex.org/W41344992","https://openalex.org/W2504709358","https://openalex.org/W2109489765","https://openalex.org/W1599046285","https://openalex.org/W2099032193","https://openalex.org/W2809438112","https://openalex.org/W2040716657","https://openalex.org/W2102566802","https://openalex.org/W658731987","https://openalex.org/W1600824897","https://openalex.org/W2276770679","https://openalex.org/W2164502223","https://openalex.org/W2358399202","https://openalex.org/W2121740517"],"abstract_inverted_index":{"We":[0,23,68],"study":[1,24],"an":[2,63],"extension":[3,31],"of":[4,29,51,74,85],"MTL":[5],"in":[6],"pointwise":[7],"time":[8],"with":[9],"regular":[10],"expression":[11,20],"guarded":[12],"modality":[13],"Reg_I(re)":[14],"where":[15,41],"re":[16],"is":[17],"a":[18,71,97],"rational":[19,44],"over":[21],"subformulae.":[22],"the":[25,49],"decidability":[26],"and":[27,103],"expressiveness":[28],"this":[30],"(MTL+Ureg+Reg),":[32],"called":[33],"RegMTL,":[34],"as":[35,37],"well":[36],"its":[38],"fragment":[39],"SfrMTL":[40,102],"only":[42],"star-free":[43],"expressions":[45],"are":[46],"allowed.":[47],"Using":[48],"technique":[50],"temporal":[52],"projections,":[53],"we":[54,95],"show":[55,96],"that":[56],"RegMTL":[57,75],"has":[58],"decidable":[59],"satisfiability":[60],"by":[61],"giving":[62],"equisatisfiable":[64,79],"reduction":[65,80],"to":[66,83],"MTL.":[67],"also":[69],"identify":[70],"subclass":[72],"MITL+UReg":[73],"for":[76],"which":[77],"our":[78,91],"gives":[81],"rise":[82],"formulae":[84],"MITL,":[86],"yielding":[87],"elementary":[88],"decidability.":[89],"As":[90],"second":[92],"main":[93],"result,":[94],"tight":[98],"automaton-logic":[99],"connection":[100],"between":[101],"partially":[104],"ordered":[105],"(or":[106],"very":[107],"weak)":[108],"1-clock":[109],"alternating":[110],"timed":[111],"automata.":[112]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":3}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}