{"id":"https://openalex.org/W2062926163","doi":"https://doi.org/10.2168/lmcs-3(3:3)2007","title":"Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems","display_name":"Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems","publication_year":2007,"publication_date":"2007-07-19","ids":{"openalex":"https://openalex.org/W2062926163","doi":"https://doi.org/10.2168/lmcs-3(3:3)2007","mag":"2062926163"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-3(3:3)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(3:3)2007","pdf_url":"https://lmcs.episciences.org/947/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/947/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Dimitar P. Guelev","orcid":null},"institutions":[{"id":"https://openalex.org/I4210105926","display_name":"Institute of Mathematics and Informatics","ror":"https://ror.org/01b5dy719","country_code":"BG","type":"facility","lineage":["https://openalex.org/I24768866","https://openalex.org/I4210105926"]},{"id":"https://openalex.org/I24768866","display_name":"Bulgarian Academy of Sciences","ror":"https://ror.org/01x8hew03","country_code":"BG","type":"funder","lineage":["https://openalex.org/I24768866"]}],"countries":["BG"],"is_corresponding":true,"raw_author_name":"Dimitar P. Guelev","raw_affiliation_strings":["Institute of Mathematics and Informatics, Bulgarian Academy of Sciences"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Informatics, Bulgarian Academy of Sciences","institution_ids":["https://openalex.org/I4210105926","https://openalex.org/I24768866"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I24768866","https://openalex.org/I4210105926"],"apc_list":null,"apc_paid":null,"fwci":0.3385,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66156555,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 3, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.3815000057220459,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.3815000057220459,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.2897999882698059,"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.24120000004768372,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.7983999848365784},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6452000141143799},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6089000105857849},{"id":"https://openalex.org/keywords/interval-temporal-logic","display_name":"Interval temporal logic","score":0.5921000242233276},{"id":"https://openalex.org/keywords/probabilistic-ctl","display_name":"Probabilistic CTL","score":0.5848000049591064},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4442000091075897},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.41659998893737793},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.4047999978065491}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7983999848365784},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6452000141143799},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6089000105857849},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.5921000242233276},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.5848000049591064},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47429999709129333},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4442000091075897},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4348999857902527},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.41659998893737793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41019999980926514},{"id":"https://openalex.org/C128828806","wikidata":"https://www.wikidata.org/wiki/Q7246848","display_name":"Probabilistic argumentation","level":3,"score":0.4047999978065491},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.4047999978065491},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.375900000333786},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.351500004529953},{"id":"https://openalex.org/C200116569","wikidata":"https://www.wikidata.org/wiki/Q902052","display_name":"G\u00f6del's completeness theorem","level":2,"score":0.34130001068115234},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3034999966621399},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.2939999997615814},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.2743000090122223},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.265500009059906},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2648000121116638}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-3(3:3)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(3:3)2007","pdf_url":"https://lmcs.episciences.org/947/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:0706.0692","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0706.0692","pdf_url":"https://arxiv.org/pdf/0706.0692","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:6ea38e9830be4a23beb486159860597c","is_oa":true,"landing_page_url":"https://doaj.org/article/6ea38e9830be4a23beb486159860597c","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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 3, Issue 3 (2007)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-3(3:3)2007","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-3(3:3)2007","pdf_url":"https://lmcs.episciences.org/947/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":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2062926163.pdf","grobid_xml":"https://content.openalex.org/works/W2062926163.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W61119655","https://openalex.org/W106209860","https://openalex.org/W207180005","https://openalex.org/W1505738311","https://openalex.org/W1506458079","https://openalex.org/W1511105469","https://openalex.org/W1525064557","https://openalex.org/W1573589782","https://openalex.org/W1575770272","https://openalex.org/W1585411267","https://openalex.org/W1590430020","https://openalex.org/W1603245791","https://openalex.org/W1750187267","https://openalex.org/W1829576798","https://openalex.org/W1976412619","https://openalex.org/W1980924813","https://openalex.org/W1999122486","https://openalex.org/W2000916035","https://openalex.org/W2003523243","https://openalex.org/W2033814565","https://openalex.org/W2055078971","https://openalex.org/W2060426327","https://openalex.org/W2110246462","https://openalex.org/W2134991157","https://openalex.org/W2166721364","https://openalex.org/W2253502498","https://openalex.org/W2598408477","https://openalex.org/W2624873985"],"related_works":[],"abstract_inverted_index":{"The":[0,24,60],"paper":[1],"presents":[2],"probabilistic":[3,36,53,64,82],"extensions":[4],"of":[5,35,52,81],"interval":[6,83],"temporal":[7,84],"logic":[8,85],"(ITL)":[9],"and":[10,17,44,78,89],"duration":[11],"calculus":[12],"(DC)":[13],"with":[14,38,55,86],"infinite":[15],"intervals":[16,88],"complete":[18],"Hilbert-style":[19],"proof":[20],"systems":[21,62,77],"for":[22,32,49],"them.":[23],"completeness":[25,30,47],"results":[26],"are":[27],"a":[28,45,79],"strong":[29],"theorem":[31,48],"the":[33,50,70,75],"system":[34,51,80],"ITL":[37],"respect":[39,56],"to":[40,57],"an":[41],"abstract":[42],"semantics":[43],"relative":[46],"DC":[54,66],"real-time":[58,65],"semantics.":[59],"proposed":[61,76],"subsume":[63],"as":[67],"known":[68],"from":[69],"literature.":[71],"A":[72],"correspondence":[73],"between":[74],"finite":[87],"expanding":[90],"modalities":[91],"is":[92],"established":[93],"too.":[94]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}