{"id":"https://openalex.org/W1983313429","doi":"https://doi.org/10.1145/1149114.1149116","title":"Fast verification of MLL proof nets via IMLL","display_name":"Fast verification of MLL proof nets via IMLL","publication_year":2006,"publication_date":"2006-07-01","ids":{"openalex":"https://openalex.org/W1983313429","doi":"https://doi.org/10.1145/1149114.1149116","mag":"1983313429"},"language":"en","primary_location":{"id":"doi:10.1145/1149114.1149116","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1149114.1149116","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","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/A5000119795","display_name":"Andrzej S. Murawski","orcid":"https://orcid.org/0000-0002-4725-410X"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrzej S. Murawski","raw_affiliation_strings":["Oxford University Computing Laboratory, Oxford, United Kingdom","Oxford University, Computing Laboratory, Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Oxford University Computing Laboratory, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Oxford University, Computing Laboratory, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025152913","display_name":"C.-H. Luke Ong","orcid":"https://orcid.org/0000-0001-7509-680X"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"C.-H. Luke Ong","raw_affiliation_strings":["Oxford University Computing Laboratory, Oxford, United Kingdom","Oxford University, Computing Laboratory, Oxford, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Oxford University Computing Laboratory, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Oxford University, Computing Laboratory, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.4622,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.72826829,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"7","issue":"3","first_page":"473","last_page":"498"},"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.9998999834060669,"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.9998999834060669,"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.9998999834060669,"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.998199999332428,"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/linear-logic","display_name":"Linear logic","score":0.8733432292938232},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.6760363578796387},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.641030490398407},{"id":"https://openalex.org/keywords/sequent","display_name":"Sequent","score":0.6268797516822815},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5818196535110474},{"id":"https://openalex.org/keywords/cut-elimination-theorem","display_name":"Cut-elimination theorem","score":0.5799578428268433},{"id":"https://openalex.org/keywords/sequent-calculus","display_name":"Sequent calculus","score":0.5408021211624146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5382937788963318},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.522837221622467},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45632436871528625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43584734201431274},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4214697480201721},{"id":"https://openalex.org/keywords/proof-calculus","display_name":"Proof calculus","score":0.2999419569969177},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.13030466437339783}],"concepts":[{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.8733432292938232},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.6760363578796387},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.641030490398407},{"id":"https://openalex.org/C89421646","wikidata":"https://www.wikidata.org/wiki/Q843632","display_name":"Sequent","level":2,"score":0.6268797516822815},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5818196535110474},{"id":"https://openalex.org/C111404639","wikidata":"https://www.wikidata.org/wiki/Q376166","display_name":"Cut-elimination theorem","level":4,"score":0.5799578428268433},{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.5408021211624146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5382937788963318},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.522837221622467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45632436871528625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43584734201431274},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4214697480201721},{"id":"https://openalex.org/C6489637","wikidata":"https://www.wikidata.org/wiki/Q7250002","display_name":"Proof calculus","level":3,"score":0.2999419569969177},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.13030466437339783},{"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":1,"locations":[{"id":"doi:10.1145/1149114.1149116","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1149114.1149116","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W367533796","https://openalex.org/W1985245264","https://openalex.org/W2000131140","https://openalex.org/W2008441811","https://openalex.org/W2010649834","https://openalex.org/W2028503265","https://openalex.org/W2054420170","https://openalex.org/W2079171825","https://openalex.org/W2111379929","https://openalex.org/W2124339980","https://openalex.org/W2152733053","https://openalex.org/W2160130037","https://openalex.org/W2164485560","https://openalex.org/W2752885492","https://openalex.org/W2911865844","https://openalex.org/W2913299800"],"related_works":["https://openalex.org/W2163170048","https://openalex.org/W2134137673","https://openalex.org/W1590710253","https://openalex.org/W1551302556","https://openalex.org/W1983313429","https://openalex.org/W2117737141","https://openalex.org/W2138536973","https://openalex.org/W2167636254","https://openalex.org/W2160130037","https://openalex.org/W4287997303"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,53,71,78,104],"following":[3],"decision":[4],"problems:ProofNet:":[5],"Is":[6,18],"a":[7,15,19,41,58],"given":[8,20],"multiplicative":[9],"linear":[10],"logic":[11],"(MLL)":[12],"proof":[13,16,93],"structure":[14,80],"net?EssNet:":[17],"essential":[21,96],"net":[22],"(of":[23],"an":[24],"intuitionistic":[25],"MLL":[26],"sequent)":[27],"correct?In":[28],"this":[29],"article":[30],"we":[31,56,87],"show":[32,63],"how":[33],"to":[34,50,69],"obtain":[35,57],"linear-time":[36,48,59,89],"algorithms":[37,90],"for":[38,61,91,100],"EssNet.":[39],"As":[40],"corollary,":[42],"by":[43],"showing":[44],"that":[45,65,74,98],"ProofNet":[46],"is":[47,67,81],"reducible":[49],"EssNet":[51],"(by":[52],"Trip":[54],"Translation),":[55],"algorithm":[60],"ProofNet.We":[62],"further":[64],"it":[66],"possible":[68],"optimize":[70],"verification":[72],"so":[73],"each":[75],"node":[76],"of":[77,103],"input":[79],"visited":[82],"at":[83],"most":[84],"once.":[85],"Finally,":[86],"present":[88],"sequentializing":[92],"nets":[94],"and":[95],"nets,":[97],"is,":[99],"finding":[101],"derivations":[102],"underlying":[105],"sequents.":[106]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}