{"id":"https://openalex.org/W2048265179","doi":"https://doi.org/10.1142/s0129054104002509","title":"A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING","display_name":"A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING","publication_year":2004,"publication_date":"2004-04-01","ids":{"openalex":"https://openalex.org/W2048265179","doi":"https://doi.org/10.1142/s0129054104002509","mag":"2048265179"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054104002509","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054104002509","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5061141406","display_name":"Manolis Gergatsoulis","orcid":"https://orcid.org/0000-0001-9744-5839"},"institutions":[{"id":"https://openalex.org/I187792471","display_name":"Ionian University","ror":"https://ror.org/01xm4n520","country_code":"GR","type":"education","lineage":["https://openalex.org/I187792471"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"MANOLIS GERGATSOULIS","raw_affiliation_strings":["Department of Archive and Library Sciences, Ionian University, Palea Anaktora, Plateia Eleftherias, 49100 Corfu, Greece","Department of Archive and Library Sciences, Ionian University, Palea Anaktora, Plateia Eleftherias, 49100 Corfu, Greece#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Archive and Library Sciences, Ionian University, Palea Anaktora, Plateia Eleftherias, 49100 Corfu, Greece","institution_ids":["https://openalex.org/I187792471"]},{"raw_affiliation_string":"Department of Archive and Library Sciences, Ionian University, Palea Anaktora, Plateia Eleftherias, 49100 Corfu, Greece#TAB#","institution_ids":["https://openalex.org/I187792471"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027624552","display_name":"Christos Nomikos","orcid":null},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"CHRISTOS NOMIKOS","raw_affiliation_strings":["Computer Science Department, University of Ioannina, Dourouti Campus, Ioannina, 451 10, Greece"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Ioannina, Dourouti Campus, Ioannina, 451 10, Greece","institution_ids":["https://openalex.org/I194019607"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061141406"],"corresponding_institution_ids":["https://openalex.org/I187792471"],"apc_list":null,"apc_paid":null,"fwci":0.4497,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74662162,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"15","issue":"02","first_page":"417","last_page":"443"},"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.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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","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/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/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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/soundness","display_name":"Soundness","score":0.7902686595916748},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6294214129447937},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5552830696105957},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5435793399810791},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.5277431607246399},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.526127815246582},{"id":"https://openalex.org/keywords/structural-proof-theory","display_name":"Structural proof theory","score":0.5177573561668396},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43523237109184265},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4127342700958252},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.40836042165756226},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3546068072319031},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.3528796434402466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32488957047462463}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7902686595916748},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6294214129447937},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5552830696105957},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5435793399810791},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.5277431607246399},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.526127815246582},{"id":"https://openalex.org/C195653647","wikidata":"https://www.wikidata.org/wiki/Q7625047","display_name":"Structural proof theory","level":4,"score":0.5177573561668396},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43523237109184265},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4127342700958252},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.40836042165756226},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3546068072319031},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.3528796434402466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32488957047462463},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054104002509","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054104002509","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W618815147","https://openalex.org/W628495853","https://openalex.org/W1480862739","https://openalex.org/W1589223644","https://openalex.org/W1969550103","https://openalex.org/W1984909320","https://openalex.org/W2003219696","https://openalex.org/W2008276941","https://openalex.org/W2049351618","https://openalex.org/W2068379155","https://openalex.org/W2086240210","https://openalex.org/W2097622845","https://openalex.org/W2129686131","https://openalex.org/W2136547062","https://openalex.org/W2565157351","https://openalex.org/W2586374872","https://openalex.org/W4206370914","https://openalex.org/W4388216319","https://openalex.org/W4388216484"],"related_works":["https://openalex.org/W2151894250","https://openalex.org/W3187382182","https://openalex.org/W2113211405","https://openalex.org/W3173957725","https://openalex.org/W3157478331","https://openalex.org/W2912489206","https://openalex.org/W1593882330","https://openalex.org/W2787858359","https://openalex.org/W2510312343","https://openalex.org/W2404743010"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,33,84],"new":[6,22,77],"resolution":[7],"proof":[8,23,78,87],"procedure":[9,79],"for":[10,74,89],"the":[11,21,55,71,81,98],"branching-time":[12],"logic":[13,91,123],"programming":[14,92],"language":[15],"Cactus.":[16],"The":[17,76],"particular":[18],"strength":[19],"of":[20,57,70,83,86,100],"procedure,":[24],"called":[25],"CSLD-resolution,":[26],"is":[27],"that":[28,42],"it":[29,107,114],"can":[30,115],"handle,":[31],"in":[32,52],"more":[34],"general":[35],"way,":[36],"open-ended":[37],"queries,":[38],"i.e.":[39],"goal":[40,104],"clauses":[41],"include":[43],"atoms":[44],"which":[45,94],"do":[46],"not":[47],"refer":[48],"to":[49,110,119,121,128],"specific":[50],"moments":[51],"time,":[53],"without":[54],"need":[56],"enumerating":[58],"all":[59],"their":[60],"canonical":[61,101],"instances.":[62],"We":[63],"also":[64],"prove":[65],"soundness,":[66],"completeness":[67],"and":[68,103,113],"independence":[69],"computation":[72],"rule":[73],"CSLD-resolution.":[75],"overcomes":[80],"limitations":[82],"family":[85],"procedures":[88],"temporal":[90],"languages,":[93],"were":[95],"based":[96],"on":[97],"notions":[99],"program":[102],"clauses.":[105],"Moreover,":[106],"applies":[108],"directly":[109],"Chronolog":[111],"programs":[112,124],"be":[116],"easily":[117],"extended":[118],"apply":[120],"multi-dimensional":[122],"as":[125,127],"well":[126],"Chronolog(MC)":[129],"programs.":[130]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}