{"id":"https://openalex.org/W2113389546","doi":"https://doi.org/10.1093/logcom/exl007","title":"A New Modal Approach to the Logic of Intervals","display_name":"A New Modal Approach to the Logic of Intervals","publication_year":2007,"publication_date":"2007-04-01","ids":{"openalex":"https://openalex.org/W2113389546","doi":"https://doi.org/10.1093/logcom/exl007","mag":"2113389546"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exl007","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exl007","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-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/A5062211930","display_name":"Amir Hussain","orcid":"https://orcid.org/0000-0002-8080-082X"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"A. Hussain","raw_affiliation_strings":["Department of Computing, Imperial College London, South Kensington Campus, London SW7 2AZ, UK. E-mail: ah701@doc.ic.ac.uk","Department of Computing, Imperial College London, South Kensington Campus, London SW7 2AZ, UK. E-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College London, South Kensington Campus, London SW7 2AZ, UK. E-mail: ah701@doc.ic.ac.uk","institution_ids":["https://openalex.org/I47508984"]},{"raw_affiliation_string":"Department of Computing, Imperial College London, South Kensington Campus, London SW7 2AZ, UK. E-mail:","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062211930"],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.11223884,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"2","first_page":"221","last_page":"254"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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.9998000264167786,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9991000294685364,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9986000061035156,"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/interval-temporal-logic","display_name":"Interval temporal logic","score":0.797399640083313},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.6840301156044006},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6228189468383789},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.6068591475486755},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5877057909965515},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5583399534225464},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.5139855742454529},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5123994946479797},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4888969957828522},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.472971111536026},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4405348300933838},{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.4325394630432129},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.42265334725379944},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3577861785888672},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34219685196876526},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.3223191201686859},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1862768828868866}],"concepts":[{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.797399640083313},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.6840301156044006},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6228189468383789},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.6068591475486755},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5877057909965515},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5583399534225464},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.5139855742454529},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5123994946479797},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4888969957828522},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.472971111536026},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4405348300933838},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.4325394630432129},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.42265334725379944},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3577861785888672},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34219685196876526},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.3223191201686859},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1862768828868866},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/logcom/exl007","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exl007","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.3504","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3504","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://pubs.doc.ic.ac.uk/new-modal-logic-intervals/new-modal-logic-intervals.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.7799999713897705,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W95860231","https://openalex.org/W166266902","https://openalex.org/W1480255812","https://openalex.org/W1480415539","https://openalex.org/W1485990531","https://openalex.org/W1488267121","https://openalex.org/W1536088796","https://openalex.org/W1928206718","https://openalex.org/W1966911791","https://openalex.org/W1967494119","https://openalex.org/W1969184283","https://openalex.org/W1978000758","https://openalex.org/W1978654873","https://openalex.org/W2002176884","https://openalex.org/W2004532354","https://openalex.org/W2004665970","https://openalex.org/W2011132281","https://openalex.org/W2016293897","https://openalex.org/W2023808162","https://openalex.org/W2040022302","https://openalex.org/W2040575807","https://openalex.org/W2052882335","https://openalex.org/W2059354551","https://openalex.org/W2066949643","https://openalex.org/W2068458083","https://openalex.org/W2073491323","https://openalex.org/W2092576830","https://openalex.org/W2098770011","https://openalex.org/W2118324648","https://openalex.org/W2120506667","https://openalex.org/W2122540544","https://openalex.org/W2124576280","https://openalex.org/W2132751985","https://openalex.org/W2146819619","https://openalex.org/W2180189393","https://openalex.org/W2610670723","https://openalex.org/W2899987233","https://openalex.org/W3106280715","https://openalex.org/W3140030144","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W55334476","https://openalex.org/W4232446061","https://openalex.org/W2124110813","https://openalex.org/W2092656858","https://openalex.org/W4285022830","https://openalex.org/W2996932295","https://openalex.org/W4387188591","https://openalex.org/W59129029","https://openalex.org/W2168791893","https://openalex.org/W2585210618"],"abstract_inverted_index":{"In":[0,142],"Artificial":[1],"Intelligence":[2],"there":[3],"is":[4,126,140],"a":[5,42,193],"need":[6],"for":[7],"reasoning":[8],"about":[9,65],"continuous":[10],"processes,":[11],"where":[12],"assertions":[13],"refer":[14],"to":[15,117,144,166,175],"time":[16,20],"intervals":[17],"rather":[18],"than":[19],"points.":[21],"Taking":[22],"our":[23,101,185,201],"lead":[24],"from":[25,200],"van":[26,92],"Benthem\u2019s":[27],"treatment":[28],"of":[29,69,84,122,184,195],"interval":[30,43,85,89,95,102,124],"temporal":[31,44,86,103],"structures":[32,90,125],"and":[33,35,51,91,128,135,162],"Halpern":[34],"Shoham\u2019s":[36],"work":[37],"on":[38,116,174],"intervals,":[39],"we":[40,149],"present":[41],"logic":[45,56,121],"with":[46],"two":[47,81,106],"binary":[48],"relations,":[49],"precedence":[50],"inclusion.":[52],"We":[53,79,97,114,172],"study":[54],"the":[55,66,105,111,120,131,137,146,151,181,189],"in":[57,100,108,180],"its":[58],"full":[59],"generality":[60],"without":[61],"making":[62],"any":[63],"assumptions":[64],"underlying":[67],"nature":[68],"time,":[70],"be":[71],"it":[72],"discrete":[73],"or":[74,77],"dense,":[75],"linear":[76],"branching.":[78],"identify":[80,176],"general":[82],"classes":[83,107],"structures,":[87],"minimal":[88,94,123],"Benthem":[93],"structures.":[96],"show":[98],"that":[99,119,136,198],"language,":[104],"fact":[109],"have":[110],"same":[112],"logic.":[113],"go":[115,173],"prove":[118],"complete":[127],"decidable,":[129],"possessing":[130],"finite":[132],"model":[133],"property,":[134],"satisfiability":[138],"problem":[139],"PSPACE-complete.":[141],"order":[143],"establish":[145],"complexity":[147],"result":[148],"extend":[150],"tableau":[152],"method":[153],"introduced":[154],"by":[155,191],"Horrocks":[156],"et":[157],"al.,":[158],"which":[159],"treats":[160],"transitive":[161],"inverse":[163],"relations":[164],"only,":[165],"also":[167],"incorporate":[168],"interaction":[169],"between":[170],"relations.":[171],"some":[177],"important":[178],"limitations":[179],"expressive":[182],"power":[183],"logic,":[186],"before":[187],"concluding":[188],"paper":[190],"raising":[192],"number":[194],"interesting":[196],"questions":[197],"follow":[199],"work.":[202]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}