{"id":"https://openalex.org/W3033401407","doi":"https://doi.org/10.46298/lmcs-18(1:24)2022","title":"Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption","display_name":"Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption","publication_year":2022,"publication_date":"2022-02-01","ids":{"openalex":"https://openalex.org/W3033401407","doi":"https://doi.org/10.46298/lmcs-18(1:24)2022","mag":"3033401407"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-18(1:24)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(1:24)2022","pdf_url":"https://lmcs.episciences.org/9028/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/9028/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086034910","display_name":"Laura Bozzelli","orcid":"https://orcid.org/0000-0003-0963-8169"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Laura Bozzelli","raw_affiliation_strings":["University of Napoli \"Federico II\", Napoli, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Napoli \"Federico II\", Napoli, Italy","institution_ids":["https://openalex.org/I71267560"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015572946","display_name":"Alberto Molinari","orcid":"https://orcid.org/0000-0002-7792-2105"},"institutions":[{"id":"https://openalex.org/I129043915","display_name":"University of Udine","ror":"https://ror.org/05ht0mh31","country_code":"IT","type":"education","lineage":["https://openalex.org/I129043915"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alberto Molinari","raw_affiliation_strings":["University of Udine, Udine, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Udine, Udine, Italy","institution_ids":["https://openalex.org/I129043915"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015702335","display_name":"Angelo Montanari","orcid":"https://orcid.org/0000-0002-4322-769X"},"institutions":[{"id":"https://openalex.org/I129043915","display_name":"University of Udine","ror":"https://ror.org/05ht0mh31","country_code":"IT","type":"education","lineage":["https://openalex.org/I129043915"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Angelo Montanari","raw_affiliation_strings":["University of Udine, Udine, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Udine, Udine, Italy","institution_ids":["https://openalex.org/I129043915"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000697088","display_name":"Adriano Peron","orcid":"https://orcid.org/0000-0002-7111-3171"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Adriano Peron","raw_affiliation_strings":["University of Napoli \"Federico II\", Napoli, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Napoli \"Federico II\", Napoli, Italy","institution_ids":["https://openalex.org/I71267560"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050753589","display_name":"Pietro Sala","orcid":"https://orcid.org/0000-0002-2612-1519"},"institutions":[{"id":"https://openalex.org/I119439378","display_name":"University of Verona","ror":"https://ror.org/039bp8j42","country_code":"IT","type":"education","lineage":["https://openalex.org/I119439378"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Pietro Sala","raw_affiliation_strings":["University of Verona, Verona, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Verona, Verona, Italy","institution_ids":["https://openalex.org/I119439378"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6637,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.68650085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"Volume 18, Issue 1","issue":null,"first_page":null,"last_page":null},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9995999932289124,"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.9968000054359436,"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.8028915524482727},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7154960036277771},{"id":"https://openalex.org/keywords/interval-temporal-logic","display_name":"Interval temporal logic","score":0.6468286514282227},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6226475238800049},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5416311621665955},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4906212389469147},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.4883670210838318},{"id":"https://openalex.org/keywords/homogeneity","display_name":"Homogeneity (statistics)","score":0.4855043888092041},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4740219712257385},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4698599576950073},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.46541500091552734},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.44110584259033203},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.43812987208366394},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43502774834632874},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.43112921714782715},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4085463583469391},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3762879967689514},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36092448234558105},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1267327070236206}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.8028915524482727},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7154960036277771},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.6468286514282227},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6226475238800049},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5416311621665955},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4906212389469147},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.4883670210838318},{"id":"https://openalex.org/C142259097","wikidata":"https://www.wikidata.org/wiki/Q5891314","display_name":"Homogeneity (statistics)","level":2,"score":0.4855043888092041},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4740219712257385},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4698599576950073},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.46541500091552734},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.44110584259033203},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.43812987208366394},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43502774834632874},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.43112921714782715},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4085463583469391},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3762879967689514},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36092448234558105},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1267327070236206},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.46298/lmcs-18(1:24)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(1:24)2022","pdf_url":"https://lmcs.episciences.org/9028/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2006.04652","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2006.04652","pdf_url":"https://arxiv.org/pdf/2006.04652","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"raw_type":"text"},{"id":"pmh:oai:air.uniud.it:11390/1224310","is_oa":true,"landing_page_url":"http://hdl.handle.net/11390/1224310","pdf_url":null,"source":{"id":"https://openalex.org/S4306401163","display_name":"Institutional Research Information System (University of Udine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I129043915","host_organization_name":"University of Udine","host_organization_lineage":["https://openalex.org/I129043915"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:arts.units.it:11368/3032608","is_oa":true,"landing_page_url":"https://hdl.handle.net/11368/3032608","pdf_url":null,"source":{"id":"https://openalex.org/S4306400480","display_name":"ArTS Archivio della ricerca di Trieste (University of Trieste https://www.units.it/)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142444530","host_organization_name":"University of Trieste","host_organization_lineage":["https://openalex.org/I142444530"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:c1cfa6c162d94555a675589217afe86a","is_oa":true,"landing_page_url":"https://doaj.org/article/c1cfa6c162d94555a675589217afe86a","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 18, Issue 1 (2022)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-18(1:24)2022","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-18(1:24)2022","pdf_url":"https://lmcs.episciences.org/9028/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.7099999785423279,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334079","display_name":"Gruppo Nazionale per il Calcolo Scientifico","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3033401407.pdf","grobid_xml":"https://content.openalex.org/works/W3033401407.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W7214913","https://openalex.org/W174715067","https://openalex.org/W1503784010","https://openalex.org/W1698033501","https://openalex.org/W1735213251","https://openalex.org/W1786588788","https://openalex.org/W1968426428","https://openalex.org/W1970275850","https://openalex.org/W1978654873","https://openalex.org/W2004536649","https://openalex.org/W2007939755","https://openalex.org/W2011132281","https://openalex.org/W2066151023","https://openalex.org/W2087983477","https://openalex.org/W2092486735","https://openalex.org/W2095952582","https://openalex.org/W2104419987","https://openalex.org/W2293667833","https://openalex.org/W2420136928","https://openalex.org/W2560587823","https://openalex.org/W2740128568","https://openalex.org/W2753745283","https://openalex.org/W2797441266","https://openalex.org/W2891153460","https://openalex.org/W2952938415","https://openalex.org/W3098256944","https://openalex.org/W3110882779","https://openalex.org/W4236213737","https://openalex.org/W4254611763","https://openalex.org/W4288601052","https://openalex.org/W4313480275"],"related_works":["https://openalex.org/W3110882779","https://openalex.org/W2572650333","https://openalex.org/W2168791893","https://openalex.org/W59129029","https://openalex.org/W2062273688","https://openalex.org/W2296037021","https://openalex.org/W2350953867","https://openalex.org/W2337119313","https://openalex.org/W2031528374","https://openalex.org/W2573949374"],"abstract_inverted_index":{"The":[0,54],"expressive":[1],"power":[2],"of":[3,11,19,28,41,57,156],"interval":[4,105,158],"temporal":[5,159],"logics":[6,160],"(ITLs)":[7],"makes":[8],"them":[9],"one":[10],"the":[12,24,65,72,80,89,93,120,136,154],"most":[13],"natural":[14],"choices":[15],"in":[16],"a":[17,37,85,98,150,162],"number":[18],"application":[20],"domains,":[21],"ranging":[22],"from":[23],"specification":[25],"and":[26,75,107,131],"verification":[27],"complex":[29],"reactive":[30],"systems":[31],"to":[32,101],"automated":[33],"planning.":[34],"However,":[35],"for":[36,51,79,88,123,139],"long":[38],"time,":[39],"because":[40],"their":[42],"high":[43],"computational":[44],"complexity,":[45],"they":[46],"were":[47],"considered":[48],"not":[49],"suitable":[50],"practical":[52],"purposes.":[53],"recent":[55],"discovery":[56],"several":[58],"computationally":[59],"well-behaved":[60],"ITLs":[61],"has":[62,84],"finally":[63],"changed":[64],"scenario.":[66],"In":[67,148],"this":[68],"paper,":[69],"we":[70,133,152],"investigate":[71],"finite":[73,126,145],"satisfiability":[74,121],"model":[76,141],"checking":[77,142],"problems":[78],"ITL":[81],"D,":[82,124],"that":[83,119,135],"single":[86],"modality":[87],"sub-interval":[90],"relation,":[91],"under":[92],"homogeneity":[94],"assumption":[95],"(that":[96],"constrains":[97],"proposition":[99],"letter":[100],"hold":[102],"over":[103,112,125,144],"an":[104],"if":[106,109],"only":[108],"it":[110],"holds":[111,138],"all":[113],"its":[114,140],"points).":[115],"We":[116],"first":[117],"prove":[118],"problem":[122],"linear":[127],"orders,":[128],"is":[129],"PSPACE-complete,":[130],"then":[132],"show":[134],"same":[137],"problem,":[143],"Kripke":[146],"structures.":[147],"such":[149],"way,":[151],"enrich":[153],"set":[155],"tractable":[157],"with":[161],"new":[163],"meaningful":[164],"representative.":[165]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2020-06-12T00:00:00"}